For this exercise we will be building a variable that contains a representation of all 52 unique cards that exist in a standard playing card deck. (That's it, that is the task))

Consider your algorithms from Monday, one thing that some groups noticed was that you do not need to list out all 52 cards. There exists similarities between cards. Take the time to think of what all cards share. Use abstraction.

They all have a front and back, is that useful? They all have a color, how useful is that? A number? And so on. If you were to treat each card individually and wanted to build out a deck how many times would you need to invoke the "add" block to your deck list variable?

Once for each card. 52 invocations.

When you were thinking earlier, the two primary things about a card that stand out for the purpose of playing games are the suit and the rank.

Create a script in Snap! that produces a deck of 52 cards. One card for each possible combination of rank and suit (13 ranks x 4 suits)

Try to avoid 52 add blocks, think of ways you can more efficiently build out the deck you will be using for your games.

HINT!:

In Snap! create two lists, one that contains the suit values [Hearts, Diamonds, Spades, Clubs] and one that includes the ranks values [2,3,4,5,6,7,8,9,10,J,Q,K,A].

For this exercise I want you to go way back to Lesson 2.2. The "Another Brick in the Wall" exercise where you built a program that printed out bricks that filled the page. This lab used "Nested Loops". The fancy way of saying a loop in a loop.

See if you can use these two lists and our new knowledge of traversing to create a custom block that builds a deck variable for use in your card game projects. The end deck should have 52 cards. For each combination of Suit+Rank (13x4).

Loop through the ranks once for each suit and join the values.