Card Game $-$Match exactly $15$

Problem: Card game $-$Match exactly $15$

This is a $4-$player card game where each player will have $10$cards in the form of $5$cards in a stack and the next $5$cards in a queue from a deck of $52$cards$.$ There will also be $4$cards on the table face up$.$

In each player$$s turn, the player will try to make a total point of exactly $15$by adding the number of the top card in the player$$s stack and the number of one of four cards on the table. If none of the cards on the table adds up to exactly $15,$then the player can dequeue $($player$$s choice, if wants to swap$)$one card from the player$$s queue and swap it with the top card of the player$$s stack $($the top card from the stack must be enqueued to the player$$s queue$).$After swapping $($if performed by the player$),$if the top card still does not make a total point of exactly $15,$then the player$$s card from the top of the stack will be popped and discarded, and enqueued back to the deck. Otherwise, for the match of point $15,$the player will get $15$points$,$ and both the cards that add up to $15$will be discarded from the stack and the table and enqueued back to the deck. The table will be refilled from the deck.

After five rounds of play the stacks of each player will be empty and the game ends. At this point, the player$($s$)$with the highest points will be the winner$($s$).$

Initial Setup:

$1)$The game consists of a deck of $52$cards with $4$sets$.$ Each set contains cards numbered $1$to $13$with a specific color. Our deck has $$RED$($R$),$GREEN$($G$),$ORANGE$($O$),$and PURPLE$($P$)$colors$.$ Example cards: $1$R$,10$G$,3$O$,13$P$,$etc$.$

$2)$An initial queue called deck of size $52.$The cards will be stored in this queue.$$

$3)$Each player $($Players $1$to $4)$has a dedicated stack and queue with a size of $5$each$.$ For player i$,$we called them stack$\_$i and queue$\_$i$.$These stacks and queues function like personal zones where players accumulate cards and play during the game.

$4)$Create classes for a bounded stack and a bounded queue called Stack and Queue, respectively. Then, create each instance of these classes as required.$$

$5)$A table with a list of $4$cards face up on the table.$$

$6)$Implement your solution with modularization using functions.$$

Gameplay:

$($A$)$In the first round, starting with the player$\_$i$,$

$1)$Pop the top card from the stack$\_$i$.$

$2)$The sum of the player's popped card and one of the table cards must equal to $15.$

$3)$If this condition is met, $15$points will be added to the $$player$\_$i$$s score. Then both the popped and the chosen cards on the table will be enqueued $($in any order$)$back to the deck. $($If multiple cards on the table match the condition, take the first card from the list.$)$

$($i$)$The table will be refilled with a card from the deck.$$

$4)$If the condition is not met, ask the user if player$\_$i wants to discard $($D$/$d$)$the popped card or swap $($S$/$s$)$it with the card in the queue$\_$i$.$

$($i$)$If the player wants to discard the popped card, then enqueue the card back to the deck.

$($ii$)$If the player wants to swap, then dequeue a card from queue$\_$i and enqueue the popped card into queue$\_$i$.$Then perform step $3$again with the dequeued card.

$($iii$)$If the condition is not met, the dequeued card will be enqueued back to the deck.

$($B$)$The same actions should be performed by the other players as well and their score will be updated accordingly for each round.$$

$($C$)$According to the players$$stack size, there are five rounds in total, and the game will continue until all cards are popped from the players' stacks.$$

$($D$)$For each round and each player, the output format will be as follows:

$$Round: $1,$Player $1$is playing.

$$Player $1$gets $15$points by matching $2$R from hand and $11$G from the table.$[$if there is a match$],$or

$$No Matches for Player $1,$would you like to Discard$($D$/$d$)$the card or swap $($S$/$s$)?$

$$Player $1$discarded the card on hand! $[$if D$/$d is entered as input$],$or

$$Player $1$swaps the card $[3$R$]$from the queue. $[$if S$/$s is entered as input$]$

$$Player $1$gets $15$points by matching $3$R from hand and $12$P from the table. or

$$No Matches for Player $1,$discarded the card on hand!

$($E$)$After each player$$s turn, the updated table will be displayed.$$

Display the color of the cards in the player $($F$)$stack and queue with the ANSI escape command. For this, you can think of lab $6$to apply the colors. Use the following color codes:

color$\_$code$\_$dict $=\{\text{'}$R$\text{'}$: $\text{'}\backslash 033[41$m$\text{'},\text{'}$G$\text{'}$: $\text{'}\backslash 033[42$m$\text{'},\text{'}$O$\text{'}$: $\text{'}\backslash 033[43$m$\text{'},\text{'}$P$\text{'}$: $\text{'}\backslash 033[105$m$\text{'}\}$

reset$\_$code $=\text{'}\backslash 033[0$m$\text{'}$

$($G$)$Here you can see sample$\_$output. Please stick to the required output format. $($Run your code in the terminal$/$command prompt to see the expected output.$$

Ex: $[$path to your file$]$python filename.py$).$

$($H$)$The final scores of the players will also be stored in a "game$\_$score.txt$"$file with below format:

Scores:

Player$\_1=0\mathrm{.}0$;

Player$\_2=30\mathrm{.}0$;

Player$\_3=0\mathrm{.}0$;

Player$\_4=15\mathrm{.}0$;

Player $2$wins$!$