Unequal Length Maze

From WPC unofficial wiki


Find a path from “S” to “F” passing through centres of all cells horizontally or vertically exactly once. The path must alternate between horizontal and vertical segments where two consecutive segments cannot be the same length.

(Rules and example from WPC 2017 IB)

History of the puzzle[edit]

First appeared on Erich Friedman's (USA) website in 2006. [1]

Appearances in the past WPCs[edit]