Pikachu Game made with C++ | HCMUS Programming Techniques Project
The Matching Game (commonly known as Onet Connect Animal) includes a board of multiple cells, each of which presents a figure. The player finds and matches a pair of cells that contain the same figure and connect each other in some particular pattern. A legal match will make the two cells disappear. The game ends when all matching pairs are found. Figure 1 shows some snapshots from the Pikachu Puzzle Game. In this project, we will develop a simplified version of this Matching Game by remaking the game with characters (instead of figures).
This mode contains the essential steps to make the game possible.
- Game starting: Initialize a board with the given size while satisfying the following conditions
- The total number of cells must be even.
- The number of distinct characters is specified in advance.
- For each character, determine an even number to define the number of occurrences for that character.
- Any matching pair must satisfy the following conditions
- Characters on the two cells must be identical.
- When the cells disappear, their positions are replaced with blank spaces.
- The matching pattern must be one of the below motifs.
- I Matching
- L Matching
- U Matching
- Z Matching
- Game finishing: check the following conditions
- Are there any cells left?
- Are there any valid pairs left?
- Read more in the Report File
Players will experience the game better if you can add one (or more) of the following extra features to the game.
- Color and sound effects
- Visual effects
- Background: You can design anything for a background. Then, when a matching pair disappears, the background content corresponds to those emptied cells.
- Leaderboard: The top N players that finished their games with the shortest time will register their information to the Leaderboard.
- Move suggestion: Show player a valid match when they press the "Help" key.
- You can check for more details in the report file