Task $4$: Implementation

of

Card game

The course of the game is simulated in the beggar man's class. For the face$-$down deck of cards

closedPilely and closedPile$2$ the structure Deque $($double$-$ended queue$)$ is used $($in

Contrast to the term deck of cards$).$ This data structure can be used as a stack $($e$.$g$.$ with the

Methods addLast $()$ and pollLast $(),$ as well as a queue $($e$.$g$.$ with the methods

addLast$)$ and pollfirst $()$ can be used. The reason for using deque is

that both functionalities are required here. When the cards are dealt, the cards are dealt

placed on the face down piles. The last cards dealt are drawn first $($last$-$in

first$-$out$),$ the cards won in a round will be pushed under the pile and

new cards are removed from above, i$.$e$.$ first$-$in$,$ first$-$out.

The description of the individual methods can be found in the following API and thJAVA programming homework

I need to write a specific method $($ public void playRound$())$in JAVA in a given file, I$\text{'}$m having big troubles and am close to deadline. This is the code that I have to change, I started doing the playRound method via AI$,$ I know that's how its supposed to look like but I$\text{'}$m not getting any further.

public void playRound$()\{$

$//$ Erstellen Sie zwei Stacks f$$r die w$$hrend der Runde gezogenen Karten

Stack openPile$1=$ new Stack;

Stack openPile$2=$ new Stack;

$//$ Ziehen Sie die obersten Karten von den verdeckten Stapeln

Card card$1=$ closedPile$1.$pollLast$()$;

Card card$2=$ closedPile$2.$pollLast$()$;

$//$ Vergleichen Sie die gezogenen Karten

while $($card$1!=$ null && card$2!=$ null$)\{$

$//$ Wenn die Karten gleichwertig sind$,$ ziehen Sie die n$$chste Karte

if $($card$1.$compareTo$($card$2)==0)\{$

card$1=$ closedPile$1.$pollLast$()$;

card$2=$ closedPile$2.$pollLast$()$;

$\}$ else if $($card$1.$compareTo$($card$2)<mtext\; id="EditorElement\_5675675"></mtext><mn\; id="EditorElement\_5675676">0</mn><mi\; id="EditorElement\_5675677">)</mi><mtext\; id="EditorElement\_5675678"></mtext><mi\; id="EditorElement\_5675679">\{</mi>$

$//$ Wenn die erste Karte kleiner ist, f$$gen Sie sie dem offenen Stapel des zweiten Spielers hinzu

openPile$2.$push$($card$1)$;

card$1=$ closedPile$1.$pollLast$()$;

$\}$ else $\{$

$//$ Wenn die zweite Karte kleiner ist, f$$gen Sie sie dem offenen Stapel des ersten Spielers hinzu

openPile$1.$push$($card$2)$;

card$2=$ closedPile$2.$pollLast$()$;

$\}$

$\}$

$//$ Am Ende der Runde, wenn einer der Stapel leer ist, setzen Sie den Gewinner

if $($closedPile$1.$isEmpty$())\{$

winner $=2$;

$\}$ else if $($closedPile$2.$isEmpty$())\{$

winner $=1$;

$\}$ else $\{$

$//$ Wenn beide Stapel nicht leer sind$,$ setzen Sie den Gewinner basierend auf den offenen Stapeln

if $($openPile$1.$size$()>$ openPile$2.$size$())\{$

winner $=1$;

$\}$ else if $($openPile$1.$size$()$ openPile$2.$size$())\{$

winner $=2$;

$\}$ else $\{$

$//$ Falls beide Stapel gleich gro$$ sind$,$ bleibt der Gewinner unbestimmt

winner $=-1$;

$\}$

$\}$

$//$ Sammeln Sie die w$$hrend der Runde gezogenen Karten

closedPile$1.$addAll$($openPile$1)$;

closedPile$2.$addAll$($openPile$2)$;

$\}$

what's wrong about this is the logic, you basically have a closed pile and you need to draw the top card of the pile $($LIFO$)$ now you compare the drawn card with the drawn card from the other closed pile, and they become your opnened stack, now you compare the cards with card$1.$compareTo$($card$2),$ if the returned number is negative, card$1$ has a lower value than card$2,$ player $2$ has won and the won card$1$ gets put on card$2,$ they get flipped over and put on the bottom of the closed pile. That's relevant, because in the case that after the compare you get the value zero, both players take another card from the top of the pile. If the value then is positive player $1$ has won and the won cards from player $2$ get put on the opened cards flipped over and then put onto the bottom of the pile of the closed pile of player $1.$ As soon as a player is out of cards while drawing or after the end of the round, the other player wins. If both players end up with no cards at the same time its a draw.

This programming task is about simulating the course of the game round by round. Loading

First seek the Card class, which can be a playing card in the game of Skat. The class

implements the Comparable interface. For two objects cardl and card$2$ of the type Ca approx

gives

card$1.$compareTo $($card$2)$

returns a negative number if the card cardl has a lower value than the card card$2,$

a positive number if it has a higher value and $0$ if the cards are of the same value

stt$,$ t$.$e$.$ only differ in color $($clubs$,$ spades, hearts, diamonds$).$ A card is placed over the

Calling the constructor

public card $($int id$)$

generated with an input argument id between $0$ and $31.$ The specific assignment of ID to card

is not relevant for the task, but if you are interested it can be opened by executing the main $0$ method of

Card can be issued.