This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
notes:discrete:fall2023:projects:bjm0 [2023/10/25 14:53] – [CHANCES] walley | notes:discrete:fall2023:projects:bjm0 [2023/11/02 01:53] (current) – [Ace Logic] cfoster8 | ||
---|---|---|---|
Line 19: | Line 19: | ||
=====GAMEPLAY===== | =====GAMEPLAY===== | ||
- | ===Ace Logic=== | + | ===Shuffle Cards and Values=== |
+ | In past documentation pages we implemented a way to shuffle cards but that way made it hard/ | ||
+ | |||
+ | The following 2 arrays are needed: | ||
+ | <code C> | ||
+ | // Values to be assigned to each card | ||
+ | int[52] cardValues = {2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 11, | ||
+ | 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 11, | ||
+ | 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 11, | ||
+ | 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 10, 10, 11}; | ||
+ | |||
+ | |||
+ | // All cards before they are randomized | ||
+ | int[52] cardOrder = {1, | ||
+ | | ||
+ | | ||
+ | | ||
+ | </ | ||
+ | |||
+ | Once you have created your arrays you will want to make the following for loop: | ||
+ | <code C> | ||
+ | // Fisher-Yates shuffle algorithm | ||
+ | for (int i = 51; i > 0; i--) | ||
+ | { | ||
+ | // Generate a random index between 0 and i | ||
+ | int j = rand() % (i + 1); | ||
+ | |||
+ | // Swaps cardOrder[i] and cardOrder[j], | ||
+ | int temp = cardOrder[i]; | ||
+ | int temp2 = cardValues[i]; | ||
+ | cardOrder[i] = cardOrder[j]; | ||
+ | cardValues[i] = cardValues[j]; | ||
+ | cardOrder[j] = temp; | ||
+ | cardValues[j] = temp2; | ||
+ | } | ||
+ | </ | ||
+ | |||
+ | In this version of the shuffle, we also shuffle the card values making it so they still line up and are assigned correctly. This version does not include suits but you can also do the same thing. Create an array of numbers 0-3. the numbers represent a suit so heart could be 0, diamond as 1, spade as 2, and clubs as 3. | ||
+ | ====Ace Logic==== | ||
One of the unique aspects of Black Jack is that an Ace can either be 11 or 1 depending on what the player decides. Here is an example of a hand involving an Ace. | One of the unique aspects of Black Jack is that an Ace can either be 11 or 1 depending on what the player decides. Here is an example of a hand involving an Ace. | ||
Line 56: | Line 94: | ||
+ | ====Dealer Strategy==== | ||
+ | The dealer in blackjack always hits until hitting at least 17, and goes after the player does. A simple way of doing this is to out a check for if the player stands or busts towards the end of the loop, and set a flag if they do. | ||
+ | if(stand == true || playerbust == true){} | ||
+ | |||
+ | Next you need a check to see if the dealer' | ||
=====CHANCES===== | =====CHANCES===== | ||
Line 75: | Line 118: | ||
When dealing cards, make sure to decrement its point value from the probabilities array. (i.e. you draw the 5 of Spades, decrement '' | When dealing cards, make sure to decrement its point value from the probabilities array. (i.e. you draw the 5 of Spades, decrement '' | ||
+ | |||
+ | To calculate the player' | ||
+ | < | ||
+ | int playerScore; | ||
+ | int bust; // Counting number for the number of bust outcomes. | ||
+ | int total; | ||
+ | </ | ||
+ | |||
+ | You'll need to loop through for each possible value stored in the '' | ||
+ |