For this assignment, you are to complete a Java project for playing Skip-3 Solitaire. In Skip-3 Solitaire, cards are dealt one at a time from a standard deck and placed in a row. If the rank or suit of a card matches the rank or suit either one or three cards to its left, then that card (and any cards in the pile beneath it) can be moved on top of the matching card. For example, suppose the three of clubs, five of hearts, nine of spades, and jack of hearts are initially dealt. They would be placed in a row, in left-to-right order, as shown below.
If the next card dealt is the five of spades, then that card is placed to the right and is found to match the five of hearts three spots to its left. Thus, the player can move the five of spades on top of the five of hearts, shortening the row of cards. The consolidation of these piles then allows the nine of spades to match with the five of spades that is immediately to its left. Thus, the player can move the pile topped by the nine of spades on top of the five of spades, shortening the row even further. Pictorially, the consolidation steps are:
Note that the addition of a single card can start a chain reaction in which many piles of cards, both to the left and right, are moved. The goal of the game is to end with as few piles of cards as possible. Theoretically, the game could end with a single pile of 52 cards, although that outcome is extremely unlikely. Also, note that only the top card in a pile needs to be stored, since the cards below it are never seen again.
RowOfPiles, as well as a
Scannerobject for implementing the game. Once you have tested this basic version of the game, make the following improvements.
Note: late submissions will not be accepted for this assignment.