Snake Puzzle

Snake puzzles are path-planning challenges where the player guides a snake through a grid to eat all food items (or fill the entire board) without crashing into walls or into the snake's own body. Unlike the classic real-time Snake game, the puzzle variant is turn-based: the player plans each move carefully, and the snake grows longer as it eats, progressively constraining the available space. The challenge is to find an order and path that allows the snake to reach every target without trapping itself.

Rules

1. The snake occupies one or more connected cells on the grid, with a distinct head and tail.
2. Each turn, the player moves the snake's head one cell in any of the four cardinal directions (up, down, left, right).
3. The rest of the snake's body follows the head, occupying the cells the head previously passed through.
4. The snake cannot move through walls or through its own body.
5. When the snake's head moves onto a food item, the snake grows by one cell (the tail doesn't retract for that move).
6. The puzzle is solved when all food items are eaten (or the entire board is filled, depending on the variant).
7. If the snake cannot make any valid move, the puzzle is failed.

Strategies

• Plan the Full Path: Unlike real-time Snake where you react moment to moment, puzzle Snake rewards planning the entire route before making any move.
• End Position Matters: Think about where the snake's body will be when you eat the last food item. If you fill a corridor eating the penultimate item, you may not be able to reach the last one.
• Keep Escape Routes Open: Avoid moves that close off large sections of the grid. The snake's growing body is a wall that restricts future movement.
• Eat in the Right Order: The order in which food is eaten matters enormously. Sometimes a food item that is closer should be saved for later to avoid blocking the path to a more remote item.
• Use the Tail as a Timer: The snake's tail retracts one cell per move (except when eating). If you need to pass through a space currently occupied by the tail, you can sometimes wait for it to retract.
• Hamiltonian Path Thinking: On a grid with food on every cell, the puzzle is equivalent to finding a Hamiltonian path — a path that visits every cell exactly once. Think in terms of sweeping patterns (zigzag, spiral) that cover the entire area.

The snake game concept originated with the arcade game "Blockade" (1976) by Gremlin Industries, where two players each controlled a growing line that left a trail behind it. The first player to crash into a wall, trail, or the opponent lost. This was followed by "Nibbler" (1982), the first single-player snake game, where the snake ate food to grow and the player had to avoid the walls and the snake's own body.

The snake game achieved global ubiquity when Nokia pre-installed "Snake" on its mobile phones starting with the Nokia 6110 in 1997. Programmed by Taneli Armanto, Nokia's Snake became one of the most played games in history, with an estimated 400 million installations across Nokia's phone range. The game's simple controls (using the phone's directional buttons) and addictive gameplay made it a cultural phenomenon.

The transition from real-time action game to turn-based puzzle is more recent. Puzzle snake games began appearing in the 2000s, with designers recognizing that removing the time pressure and focusing on the planning aspect created a pure logic challenge. "Snakebird" (2015) by Noumenon Games is a notable example, combining snake movement with gravity to create fiendishly difficult puzzles. "Snake Pass" (2017) explored 3D snake movement, while numerous mobile puzzle games adapted the format.

The mathematical underpinning of snake puzzles connects to Hamiltonian path problems in graph theory — finding a path through a graph that visits each vertex exactly once. This problem is NP-complete in the general case, meaning that designing and solving snake puzzles that fill the entire board is genuinely computationally hard. This theoretical difficulty explains why these puzzles can be so challenging even on small grids.