Step 1: How should we make the game?
Well the best way for us to go about making the game would be to lay out the method here. In real life how would we play a game of memory. We'll think of each card as a playing card. We want to customize our images and make it easy to add more at any time, correct? So lets say all the cards constatute a deck. Here's how I recommend we go about starting the game.
1) Shuffle the deck
2) Take out X cards for the deck (a real deck would have 52, and make for a very, very long game. That's why we only use X cards total. This would also make it easy for us to make levels later on, incase we want to change X dynamically.).
3) Photocopy the retreived cards so we have perfect duplication (2 of each card).
4) Shuffle the duplicates (we can't have them be in the same order as our first set).
5) Lastly, deal the cards out from both decks at the same time.
![]() |
LOGIC MONSTER! Logic monster sez that ideally you'd want to deal them out randomly because otherwise someone could realize that if the decks were delt at the same time, there is no way N can match N + 2K, thus cutting possibles in HALF! But we'd like to think no one would notice this without knowing how it's programmed. It's not like they actually watched the cards get delt from both decks. |
So does that sound like a reasonable form of getting cards and dealing them out? How can we make it more fun?
Now anyone can eventually get all the cards figured out, but it's our job to make the game fun. In that case, we'll keep track of the number of tries and time that occurs during play. This will allow us to get a scoring system, and then the game becomes more competative/interactive.
| » Level Intermediate |
|
Added: 2005-04-06 Rating: 4.88 Votes: 33 |
| » Author |
| I'm the admin for BEF |
| » Download |
| Download the files used in this tutorial. |
| Download (115 kb) |
| » Forums |
| More help? Search our boards for quick answers! |
-
You must have javascript enabled in order to post comments.



Comments
There are no comments yet. Be the first to comment!