Lemmings (1991)

Lemmings is undoubtedly one of the most famous games in the history of computer entertainment, and certainly the most often converted - it has been implemented on 28 different hardware platforms.

Just like in reality, in the DMA Design product, lemmings migrate, with the difference, however, that in a computer game the obstacles they encounter on their way are more improbable. The program contains 120 stages, divided into four levels of difficulty, the first of which is a not very stressful familiarization with the possibilities of the creations, while the last one is already a real challenge and requires from the player an incredible ingenuity. Each of the lemmings can be assigned one of eight activities: climbing, falling from high heights with an umbrella, self-destruction, stopping other lemmings, building bridges, as well as digging down, sideways and diagonally. Each of these functions is limited by a number that says how many times a skill can be used during a given stage. As you can easily guess, at first we can experiment as much as we want, because we have almost unlimited possibilities in using these functions, later it is much worse and we have to come by ourselves, when and where to use what is given to us. In order to complete a given stage successfully, it is necessary to bring the number of lemmings specified at the beginning to the output. If we fail to do so, we can repeat the board as much as we like, not much of it, all the time we receive codes that will allow us to continue the fun from the last completed level.

The program has raw, but clear graphics in low resolution and extensive soundtrack - especially the music goes above average here. Generally, the product is aimed at head breaking enthusiasts and angelic patience owners, because while at the beginning of the game everything seems seemingly easy, later, for most daredevils puzzles become too difficult, and even impossible to solve.

Please let us know if you have any comments or suggestions regarding this description.

Last updated on 08 February 2008