Permutation game
OwnerPeter Selingerinventor
Life of this patent
Estimating the term…
Abstract
Among other things, in general, a permutation puzzle game is provided whose object is to arrange a set of tiles in a prescribed arrangement, starting from an initial arrangement or a series of initial arrangements, using permitted game moves. Such a puzzle game can be played using physical tiles, or virtually upon a computer. Methods, systems, and computer-readable media related to permutation puzzle games are also provided.
Claims24
A puzzle gaming system for amusement of a user,
- the system comprising computer-readable instructions that implement a game window upon a computer display,
- the game window having a set of locations corresponding to triple coordinates (x, y, z) and a set of tiles correspondingly placed such that each location is occupied by only one tile,
- the instructions further comprising a user-controllable action that when activated allows for a move selected from a horizontal move from (x, z) to (x′, z′) and a vertical move to (y, z) to (y′, z′),
- in which the horizontal move results in the game window swapping all m pairs of tiles corresponding to (x, b, z) and (x′, b, z′) where b=1 to m,
- and in which the vertical move results in the game window swapping all n pairs of tiles corresponding to (b, y, z) and (b, y′, z′) where b=1 to n.
A method for amusement of a user, the method comprising providing an arrangement of tiles corresponding to triple coordinates (x, y, z) at game start, providing an arrangement of tiles desired at game end, and providing a set of game rules explaining legal moves, the legal moves consisting of horizontal moves and vertical moves, in which the horizontal move requires the user to choose a move from (x, z) to (x′, z′) and swap all m pairs of tiles corresponding to (x, b, z) and (x′, b, z′) where b=1 to m, and in which the vertical move requires the user to choose a move from (y, z) to (y′, z′) and swap all n pairs of tiles corresponding to (b, y, z) and (b, y′, z′) where b=1 to n.
Dependencies are inferred from the claim text.