Question

Spring 2019 ECE 103 Engineering Programming Problem Statement A standard deck of playing cards contains 52 cards. There are four suits (heart, diamond club +, spade+) and thirteen ranks (ace, 2 thru 10,jack, queen, king) per suit. Rank Numeric Value 10 10 10 10 gueen 10 Write a program that does the following: I. Simulates a randomized shuffling of a 52 card deck 2. Determines how many combinations of 21 exist in the deck by following this procedure: Consecutively draws cards from the shuffled deck until either the combined value is 21 (win) or the combined value is over 21 (bust). Continues drawing / displaying Icombining cards until all the cards in the deck are used up. 2. Displays the total number of "wins" and "busts" for the given deck

C Program Please! Thanks!

Answer 1

Complete Program:

File: hw6.c

// Header files section
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>

// define the constants
#define MAX_CARDS 52
#define MAX_RANKS 13
#define MAX_SUITS 4
#define COLS 4
#define str(s) #s

// declare an enumuration for suit
enum Suit { H, D, C, S };

// declare a structure for card
struct card
{
    char* rank;
    enum Suit suit;
    int value;
};
typedef struct card Card;

// function prototypes
void initialize(Card deck[]);
void shuffle(Card deck[]);
void findCombinationsOf21(Card deck[]);
void display(Card deck[]);

// start main function
int main()
{
    unsigned int seedValue;

    printf("Enter a seed value: ");
    scanf("%u", &seedValue);

    srand(seedValue);

    Card deck[MAX_CARDS] = { "", ' ', 0};

    initialize(deck);

    printf("\nBefore shuffling:\n");
    display(deck);

    shuffle(deck);

    printf("\nAfter shuffling:\n");
    display(deck);
      
    printf("\nFind combinations of 21:\n");
    findCombinationsOf21(deck);

    return 0;
} // end of main function

// initialize function implementation
void initialize(Card deck[])
{
    int i;

    for (i = 0; i < MAX_CARDS; i++)
    {
        if(i % MAX_RANKS == 0)
            deck[i].rank = "A";
        else if (i % MAX_RANKS == 1)
            deck[i].rank = "2";
        else if (i % MAX_RANKS == 2)
            deck[i].rank = "3";
        else if (i % MAX_RANKS == 3)
            deck[i].rank = "4";
        else if (i % MAX_RANKS == 4)
            deck[i].rank = "5";
        else if (i % MAX_RANKS == 5)
            deck[i].rank = "6";
        else if (i % MAX_RANKS == 6)
            deck[i].rank = "7";
        else if (i % MAX_RANKS == 7)
            deck[i].rank = "8";
        else if (i % MAX_RANKS == 8)
            deck[i].rank = "9";
        else if (i % MAX_RANKS == 9)
            deck[i].rank = "10";
        else if (i % MAX_RANKS == 10)
            deck[i].rank = "J";
        else if (i % MAX_RANKS == 11)
            deck[i].rank = "Q";
        else if (i % MAX_RANKS == 12)
            deck[i].rank = "K";
              
        if(i / MAX_RANKS == 0)
            deck[i].suit = H;
        else if (i / MAX_RANKS == 1)
            deck[i].suit = D;
        else if (i / MAX_RANKS == 2)
            deck[i].suit = C;
        else if (i / MAX_RANKS == 3)
            deck[i].suit = S;

        if (i % MAX_RANKS < 10)
            deck[i].value = i % MAX_RANKS + 1;
        else
            deck[i].value = 10;
    }
} // end of initialize function

// shuffle function implementation
void shuffle(Card deck[])
{
    int i, randIndex;
    Card randCard = { "", ' ', 0 };  

    for (i = 0; i < MAX_CARDS; i++)
    {
        randIndex = rand() % MAX_CARDS;

        randCard = deck[i];
        deck[i] = deck[randIndex];
        deck[randIndex] = randCard;
    }
} // end of shuffle function

// display function implementation
void display(Card deck[])
{  
    int i, j, k;

    for (i = 0; i < MAX_RANKS; i++)
    {
        for(j = 0, k = 0; j < COLS; j++, k += MAX_RANKS)
        {
            if(deck[i + k].suit == H)
                printf("%2s%2s\t", deck[i + k].rank, str(H));
            else if (deck[i + k].suit == D)
                printf("%2s%2s\t", deck[i + k].rank, str(D));
            else if (deck[i + k].suit == C)
                printf("%2s%2s\t", deck[i + k].rank, str(C));
            else if (deck[i + k].suit == S)
                printf("%2s%2s\t", deck[i + k].rank, str(S));
        }
        printf("\n");
    }
} // end of display function

// findCombinationsOf21 function implementation
void findCombinationsOf21(Card deck[])
{
    int i = 0;
    int total = 0;
    int busts = 0;
    int wins = 0;
    Card currCard = { "", ' ', 0 };

    for (i = 0; i < MAX_CARDS; i++)
    {
        currCard = deck[i];
      
        if (currCard.suit == H)
            printf("%s%s ", currCard.rank, str(H));
        else if (currCard.suit == D)
            printf("%s%s ", currCard.rank, str(D));
        else if (currCard.suit == C)
            printf("%s%s ", currCard.rank, str(C));
        else if (currCard.suit == S)
            printf("%s%s ", currCard.rank, str(S));      

        if (currCard.rank == "A")
        {
            if(total + 11 <= 21)
                total = total + 11;
            else
                total = total + 1;
        }
        else
        {
            total = total + currCard.value;
        }

        if (total > 21)
        {
            printf("BUST\n");
            total = 0;
            busts++;
        }
        else if (total == 21)
        {
            printf("WIN\n");
            total = 0;
            wins++;
        }
    }  
    printf("OUT OF CARDS\n");

    printf("\nNumber of wins = %d\n", wins);
    printf("Number of busts = %d\n", busts);
} // end of findCombinationsOf21 function

Sample Output:

Enter a seed value: 4569 Before shuffling: AH AD 2D 3 H 2H IIIIIIII OU OOOOO WND 0000000000000 ՄԻ Մ Մ Մ Մ Մ OU OVOU WND Մ Մ Մ Մ Մ Ն 10 D JH QH KH QD KD Ն After shuffling: 10 C 3 H 10 S 8 C 2S CON UTDOOO AN OODOODIDO NOD OIO Onoon ONU O DNToob Da JUOMIOIT O O UIUIOIMUM OOO YMMDO 5 C 2 H 2D 10 D 8H 10 H 4H 5 H 5 0 3 0 JD 3D AS JS Find combinations of 21: 10C 8C 2C 4D BUST 6H QD 6C BUST AC KD WIN 5C 2D 8H 4H 3H BUST 25 AH 6S 7C BUST KC 8S 9C BUST JC 2H 10D BUST 10H 5H 105 BUST 7H AD JH BUST 7D 4S 9S 9D BUST 6D 5D JD WIN AS 3S QC BUST 5S 7S 9H WIN 4C KH 8D BUST QH KS 3C BUST 3D JS QS BUST OUT OF CARDS Number of wins = 3 Number of busts = 13