Here is the list of games and puzzles that are currently in our index.
Is your favorite game missing?
Are you aware of a new complexity result for one of the listed games?
You are welcome add or edit the listed games by following the instructions on this page
15-puzzle ($n^2-1$ puzzle)
$n^2-1$ numbered tiles can be slid in a $n \times n$ board with the goal of arranging them in increasing order.
Two players move amazons on a square board. After moving, an amazon shoots an arrow that blocks movement. The last player to move wins.
A player swaps adjacent items in a $n \times m$ grid in order to form as many matches of three as possible.
A variant of Bejeweled.
A cooperative card game in which players can see others' cards but not their own. Players exchange hints with the goal of playing the cards in a specific order.
A puzzle game involving colored stones and flowers. The player moves and swaps stones. Flowers spread to adjacent stones of the same color. The goal is to bloom flowers on all the stones.
A puzzle in which the player needs to identify the location hidden mines in a rectangular board by using numeric clues.
Given an initial configuration of pegs on a board, two players alternate in moving a peg as in Peg Solitaire, and the winner is the last player to move.
Given an initial and a final configuration of pegs on a board, find a sequence of peg-solitaire moves that transforms the initial configuration into the final one.
Given a collection of polyominoes, pack them into a target shape.
Two players take turn placing reversible disks on a square board. Moves reverse one or more of the opponent's disks.
Shannon Switching Game on Vertices (Hex)
Blue and Red altenate in coloring the vertices of a graph $G$. Blue wants to connect two distinguished vertices $s,t$ of $G$ with a blue path. Red wants to select a $s$-$t$ vertex-cut.
Shannon Switching Game (Gale, Bridg-it)
Blue and Red altenate in coloring the edges of a graph $G$. Blue wants to connect two distinguished vertices $s,t$ of $G$ with a blue path. Red wants to select a $s$-$t$ edge-cut.
Simultaneous Maze Solving
Find a short sequence of moves that solves several mazes at once.
Given a region of a board and a target position inside that region, find a configuration of pegs outside the region and a sequence of moves that allows some peg to reach the target position.
A single player game in which the player packs tetrominoes in a rectangular grid.
A puzzle game in which the player has to lay down tracks to get colored trains from their departure stations to a suitable destination stations.
Two players take turns placing and colored pegs on a rectangular board. Pegs of the same player that are a knight's move away from each other can be linked together. The goal is to connect two opposing sides of the board with a chain of links.
Collect colored dots arranged in a rectangular board by drawing monochromatic paths.