Question

******ONLY C++******

Objectives:

• Appropriate use of arrays

• Use of Sorting functions

• Analysis of data using conditional structures

• Organize code into usable functions

Problem:

Poker is an easy game to learn and a hard game to win. Write a program that will generate five card hands from a shuffled deck and then keep track of what type of hand it is, providing a count and a percentage at the end.

Details:

​Program Flow:

1. Ask the user for how many hands to generate

2. Shuffle the “deck”

3. Select a 5-card hand from the top of the deck

4. Evaluate hand for ranking in poker

5. Store type of hand in an array

6. Return to step 2 until all hands have been generated

7. Print a formatted list of how many hands fall into each ranking and the percentage of total hands in each ranking

8. End program

Functions:

1. Shuffle – inputs an integer array and a number, swaps random elements of the array that number of times

2. Separate – inputs an array of integers and an empty 5-element array of integers, selects the first 5 elements of the first array, and fills the empty array with copies of those elements

3. Sort – inputs an array of integers, and sorts the array in place

4. Select – inputs an array of 5 integers, returns an integer representing the type of hand

Representation:

1. All cards will be represented by integers (0 – 51)

2. Card rank (A-2-3-4-5-6-7-8-9-10-J-Q-K) can be calculated by x/4 + 1

3. Card suit can be calculated by x%4 (♠=0,♥=1,♦=2,♣=3)

Answer 1

Code:

#include <bits/stdc++.h>
using namespace std;

struct card{
int val;
int col;
int shuffleVal;
};

bool shuffleFunc(card a, card b){
return a.shuffleVal < b.shuffleVal;
}

bool sortFunc(card a, card b){
return a.val < b.val;
}

bool isFlash(vector<card> v){
return (v[0].col == v[1].col) && (v[0].col == v[2].col) &&
(v[0].col == v[3].col) && (v[0].col == v[4].col);
}

bool isStraight(vector<card> v){
return (v[0].val+1 == v[1].val) && (v[1].val+1 == v[2].val) &&
(v[2].val+1 == v[3].val) && (v[3].val+1 == v[4].val);
}

int evaluate(vector<card> h) {
sort(h.begin(),h.end(),sortFunc);
if(isFlash(h) && isStraight(h))
return 1;
if((h[0].val == h[1].val || h[4].val == h[3].val) && h[1].val == h[2].val && h[3].val == h[2].val)
return 2;
if((h[0].val==h[1].val && h[1].val==h[2].val && h[3].val==h[4].val)
|| (h[0].val==h[1].val && h[2].val==h[3].val && h[3].val==h[4].val))
return 3;
if(isFlash(h))
return 4;
if(isStraight(h))
return 5;
if((h[0].val==h[1].val && h[1].val==h[2].val) ||
(h[1].val==h[2].val && h[2].val==h[3].val) ||
(h[2].val==h[3].val && h[3].val==h[4].val))
return 6;
if((h[0].val==h[1].val && h[2].val==h[3].val) ||
(h[0].val==h[1].val && h[3].val==h[4].val) ||
(h[1].val==h[2].val && h[3].val==h[4].val))
return 7;
if((h[0].val==h[1].val || h[1].val==h[2].val) ||
(h[2].val==h[3].val || h[3].val==h[4].val))
return 8;
return 9;
}

int main() {
vector<card> deck;
for(int i = 1; i <= 13; i++) {
card c;
c.col = 0;
c.val = i;
deck.push_back(c);
}
for(int i = 1; i <= 13; i++) {
card c;
c.col = 1;
c.val = i;
deck.push_back(c);
}
for(int i = 1; i <= 13; i++) {
card c;
c.col = 2;
c.val = i;
deck.push_back(c);
}
for(int i = 1; i <= 13; i++) {
card c;
c.col = 3;
c.val = i;
deck.push_back(c);
}

// 1. Ask for number of hands
int n;
cin >> n;

vector<int> handRank(10,0);

for(int i = 1; i <= n; i++) {
// 2. Shuffle
for(int i = 0; i < 52; i++)
deck[i].shuffleVal = rand()%1000;
sort(deck.begin(),deck.end(),shuffleFunc);

// 3. Get 5-card hand
vector<card> hand(5);
for(int i = 0; i < 5; i++)
hand[i] = deck[i];

// 4. evaluate hand
int rnk = evaluate(hand);

// 5. store type
handRank[rnk]++;
}

// 7. print rank info
for(int i = 0; i <= 9; i++) {
cout<<"Rank #"<<i<<": "<<handRank[i]<<" - "<<(double)((double)handRank[i]/n*100.0)<<"%\n";
}

return 0;
}

Output:

D:\!1Programming\main\bin\Debug\main.exe 10000 Rank #0: 0 - 0% er Rank #1: 0 - 0% Rank #2: 1 - 0.01% eRank #3: 12 - 0.12% KeR