From: David Vincelli Date: 2005-10-23T12:10:38+09:00 Subject: Re: combination sums of several arrays On 10/22/05, James Edward Gray II wrote: > Actually, you can do it a little easier. Just count them all as 11 > and if you're over 21, subtract 10 until you're out of aces, or you > are under. Here's some sample code from my own version: Your code is very interesting, thanks :) -- David Vincelli