D. Final Algorithm, Flowchart, or Pseudocode

Solitaire Pseudocode

1. Create vector of suits.
2. Create vector of values.
3. Use loop to generate a deck of 52 cards.
4. Use function to shuffle cards.
5. Sort the cards into 7 column vectors with 1 card in the first vector, 2 in the second, 3 in the third, etc.
6. Pile rest of the cards into a stack (another vector).
7. Reveal the last card in each vector and the top most card from the stack.
8. Ask user to input card they want to move, then input number of the stack they want to move it to, or “f” to move the card to a foundations pile.
9. If the move is valid, execute by adding the card that is moved to the new pile and removing the card from its previous pile. Or, if “f” was entered, move the card to the appropriate foundations pile according to suit.
10. Else print “Invalid move.”
11. Repeat steps 8 through 10 until user enters “draw” when they believe they do not have any moves left.
12. Reveal another card from the stack that replaces previous revealed card.
13. Go back to 11.
14. Whenever stack empties, refresh by adding all cards back to the stack from the discarded pile.
15. Game ends when user believes there are no moves left.