Queues

Rules:

• Each player gets dealt half of the deck. ( standard 52 card deck, no jokers )
• Each player plays the first card in their stack (queue) of cards
• If the cards are the same value, it is a tie, and the cards are removed from play.
• otherwise the player with the higher value card puts their card at the bottom of their deck, then the opposing players card at the bottom of their deck.
• If a player has run out of cards they have lost.

The output should look something like the file at this link. Your output does not need to look exactly like mine, but it should be formatted and lined up so that it is easy to read. The output must provide all of the same information at a minimum.

Date Types

You will need to have queues of type Card, so you will need to define a Card datatype. For this problem, comparing two cards should be based on the face value of the card ( ignore the suit ). Make this type do the work for you ( comparisions, output, etc. ).

You cards will need to be initalized and shuffled. There are stl functions that can do all of this for you, use them ( random_shuffle and for_each ).

This program is due on February 18th.

The Goals

• Use the stl deque container
• Solve a simple queue problem
• Create and use a simple data type in an stl container.