Memory game Christmas edition.
| Download Memory2 desktop application (Windows 64bit) | Download Memory2 source code (Lazarus/Free Pascal) |
Description: The aim of this kind of memory games is to find all pairs (resp. all triplets) of a given picture. A such
pair (triplet) is considered to be found, if you subsequently clicked 2 (3) identical pictures. To play the game, click a first picture to show it
with its face up. Clicking a second picture shows this one, too, face up. If the two pictures form a pair (resp. in find triplets
mode, after a third picture click, the three pictures form a triplet), they will stay face up (because the pair resp. triplet has been found),
otherwise they will be hidden again when you click the next picture. Remembering which picture is at which place in the grid, you will be able to
click the pair's (triplet's) pictures subsequently, i.e. to find the picture pairs (resp. triplets). The game is over when all picture pairs (triplets)
have been found (all pictures are with their face up).
Note: Clicks are done by pairs (resp. triplets), i.e. that if, for example, in find picture pairs game
mode, you click a given picture P1 and then 2 identical pictures P2a and P2b, this is not having found the pair, but having associated P1 with P2a
and then started a new click-pair with picture P2b; thus, after these three clicks, to select the pair, you'll have to click P2a again, in order to mark
it being a pair with P2b, clicked just before.
The Christmas edition of the game is a special release of my original Memory application. The download archive
contains 5 Christmas related picture sets: Nativity I, Nativity II, Santa Claus, Christmas trees, and Christmas bells. Please, note that the picture sets available
at the standard Memory game download page are not compatible with the Christmas edition of the game.
Free Pascal features: Display of images loaded from file; randomly selected images.
Screenshots:
|
|
If you like this application, please, support me and this website by signing my guestbook.