Zhris
Enthusiast
Oct 2, 2012, 11:44 AM
Post #1 of 3
(2165 views)
|
|
Blackjack total algorithm
|
Can't Post
|
|
Hey,
I'm trying to write a command line blackjack spinoff in Perl, but am stuck on writing the algorithm that will generate/process all the possible totals from a set of cards. The main issue is that an Ace can have a value of 1 or 11 (or configurably, whatever I desire).
Below, I have a hand, which is an array of arrays, representing each card and their possible values:
my $hand =
[
[1,11],[2],[1,11],[10] # Represents the values of Ace, Two, Ace, King.
];
I would like to generate another array of arrays, representing every possible combination of values:
my $combinations =
[
[1,2,1,10],
[1,2,11,10],
[11,2,1,10],
[11,2,11,10]
];
I can then use this data to return an appropriate total based on a number of blackjack rules. In this case "14".
However, I can't get my head round the type of processing $hand requires in order to generate $combinations. My thought is it will have to be some kind of recursive process, reiterating per value of cards with multiple values.
I would really appreciate some advise on how to approach this task. Where do I begin!
Thanks alot,
Chris
(This post was edited by Zhris on Oct 2, 2012, 11:46 AM)
|
MAIN
SEARCH
WHO'S 
LOG 