Question
When I was learning Turbo Pascal in school I "invented" a puzzle game described below. Later (late '90s) I found that this game had apparently been invented before, as a very similar version was included in a linux distribution. (I do not remember which one, and currently do not have any linux installed.)
The game started with balls or square blocks arranged in a rectangular grid (5-30 balls on each side) with randomly assigned colors (3-5 different colors in total). When clicking any ball, it was removed along with all neighbors (i.e. the ball above, below, left and right) of the same color, all neighbor's neighbors of the same color, etc. In other words, the region of connected balls of the same color that involved the selected ball was removed. Remaining balls above removed balls then fell down, staying in the column they were in. When a column became empty, it was removed, i.e. the colums left and right of it were pulled together.
The player got points for each move according to a function increasing faster than the number of balls removed, probably proportional to the square of the number of balls removed (i.e. a move removing 5 balls at once was worth much more than two moves removing 2 and 3 balls, resp.). There was only one player, no opponent or time limit, clearing the playing field with the fewest number of moves / the highest score was the only goal.
Answer
This makes me think of Jawbreaker
But I can't find the Linux version of it. Maybe it has a different name.
Other versions includes:
Check more discussion of this question.
No comments:
Post a Comment