**Abstract**: Subway shuffle is an addicting puzzle game created by Bob Hearn. It is played on a graph with colored edges that represent subway lines; colored tokens that represent subway cars are placed on the nodes of the graph. A token can be moved from its current node to an empty one, but only if the two nodes are connected with an edge of the same color of the token. The aim of the game is to move a special token to its final target position. We prove that deciding if the game has a solution is PSPACE-complete even when the game graph is planar.

# Tag Archives: Puzzles

# The Crazy Frog Puzzle and Permutation Reconstruction from Differences

The *Crazy Frog Puzzle* (CFP) is the following: we have a $n \times n$ partially filled board, a crazy frog placed on an empty cell and a sequence of horizontal, vertical, and diagonal jumps; each jump has a fixed length and two possible opposite directions. The crazy frog must follow the sequence of jumps, and at each step it can only choose among the two available directions. Can the frog visit every empty cell of the board exactly once (it cannot jump on a blocked cell and on the same cell two times)?

Figure 1: an example of the Crazy Frog Puzzle on the left and its solution on the right.

We prove that the Crazy Frog Puzzle is $\sf{NP}$-complete even if restricted to 1 dimension and even without blocked cells. The 1-D CFP without blocked cells corresponds to the problem of reconstructing a permutation from its differences:

*Permutation Reconstruction from Differences* problem:

**Input**: a set of $n-1$ distances $a_1,a_2,…,a_{n-1}$

**Question**: does exist a permutation $\pi_1,…,\pi_n$ of the integers $[1..n]$ such that $| \pi_{i+1} – \pi_i| = a_i$, $i=1,…,n-1$ ?

For example, given the differences $(2,1,2,1,5,3,1,1)$ a valid permutation of $[1..9]$ is $(5,7,6,8,9,4,1,2,3)$

**Update 2013-12-19**: a new version of the paper is available.

click here to download a draft of the paper

# Complexity of the Hidden Polygon Puzzle

The *Hidden Polygon Puzzle (*for brevity HPP) decision problem is:

**Input**: a set $P$ of $m$ integer points on a $n \times n$ square grid and an integer $k \leq m$;

**Question**: does exist a simple rectilinear polygon with $k$ or more vertices $(v_1,v_2, …, v_t), \; v_i \in P, t \geq k$?

The following figure shows an example of a HPP puzzle.

Figure 1: Given the 21 points on the right, can we find

a simple rectilinear polygon with at least 16 vertices?

A possible solution is shown on the right.

The problem is a slight variant of the $\sf{NP}$-complete puzzle game Hiroimono; we prove that the Hidden Polygon Puzzle is $\sf{NP}$-complete, too using a completely different reduction.

# Hidato is NP-complete

Hidato (also known as Hidoku) is a logic puzzle game invented by Dr. Gyora Benedek, an Israeli mathematician. The rules are simple: given a grid with $n$ cells some of which are already filled with a number between $1$ and $n$ (the first and the last number are circled), the player must completely fill the board with consecutive numbers that connect horizontally, vertically, or diagonally.

Figure 1: An Hidato game (that fits on a $8 \times 8$ grid) and its solution on the right.

We prove that the corresponding decision problem $\sf{HIDATO}$ : “*Given a Hidato game that fits in a $m \times n$ grid, does a valid solution exist?*” is $\sf{NP}$-complete.

# Binary Puzzle is NP-complete

Binary Puzzle (also known as Binary Sudoku) is an addictive puzzle played on a $n \times n$ grid; intially some of the cells contain a zero or a one; the aim of the game is to fill the empty cells according to the following rules:

- Each cell should contain a zero or a one and no more than two similar numbers next to or below each other are allowed
- Each row and each column should contain an equal number of zeros and ones
- Each row is unique and each column is unique

We prove that the decision version of Binary Puzzle is NP-complete.

# The complexity of the puzzle game Net: rotating wires can drive you crazy

An amateur proof that the puzzle game Net is NP-complete.

**Abstract**

The puzzle game Net`, also known as FreeNet or NetWalk, is played on a grid filled with terminals and wires; each tile of the grid can be rotated and the aim of the game is to connect all the terminals to the central power unit avoiding closed loops and open-ended wires. We prove that Net is NP-complete.`

# Intertia is NP-complete

A quick proof that the puzze game Inertia (see this version on Simon Tatham’s Portable Puzzle Collection) is NP-complete.

# The Complexity of Camping

An amateur proof that the `Tents`

puzzle game is NP-complete.

**Abstract**

We prove that the `Tents`

puzzle game is NP-complete.

# Rolling a cube can be tricky

An amateur proof that the rolling cube puzzle is NP-complete.

**Abstract**

We settle two open problems related to the rolling cube puzzle: Hamil-

tonian cycles are not unique even in fully labeled boards and rolling

cube puzzle is NP-complete in labeled boards without free cells and with

blocked cells.

click here to download the paper

NOTE: another example of two distinct Hamiltonian cycles in a fully labeled board has also been found by Pálvölgyi Dömötör (see this post on mathoverflow).