Simple Loop

From WPC unofficial wiki
Jump to navigation Jump to search


Simple Loop Example.png Simple Loop Example Solution.png

Draw a single closed loop (without intersections or crossings) through the centres of all white cells. Loop paths must be orthogonal.

(Rules and example from PGP IB)

Rule variation[edit]

  • Simple path: Instead of a loop, draw a single path connecting two given cells.

History of the puzzle[edit]

In terms of graph theory, this is the Hamiltonian path problem on grid graphs. This concept is named for William Rowan Hamilton (Ireland) for inventing the icosian game in 1857.


Path Battleships[edit]

See List of Battleships variants#Path Battleships.


See Star Battle#Comet.

Loop around Pentominoes[edit]

Loop around Pentominoes Example.png Loop around Pentominoes Example Solution.png

Addition of object placement rules similar to Pentominoes (but not identical). First appeared on WPC 2018/Round 6. The puzzle was by Jiří Hrdina (Czech Rep.).

Place some pentominoes so that they don't touch each other even diagonally. One cell from each pentomino is already marked with a letter corresponding to the shape of the pentomino. Then draw a single closed loop through the centres of all white cells.

(Example from WPC 2018 IB)

Loop around Snake[edit]

Loop around Snake Example.png Loop around Snake Example Solution.png

Hybrid with Snake. First appeared on WPC 2018/Round 6. The puzzle was by Jiří Hrdina.

Draw a snake and a single closed loop through all the remaining cells. The numbers outside indicate how many cells are used by the Snake.

(Example from WPC 2018 IB)

Appearances in the past WPCs[edit]