Tiger in the Woods

From WPC unofficial wiki
Revision as of 19:43, 10 January 2021 by EctoPLASMA (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Tiger in the Woods Example.png Tiger in the Woods Example Solution.png

Draw a path in the grid that starts from any white cell and travels horizontally and vertically to visit every white cell. The path can cross over itself but it may not overlap itself. It cannot cross the start or end cells. Following the path from the starting cell, it may change direction only after facing either a black cell or the edge of the grid. The path must end facing a black cell or edge.

(Rules and example from WPC 2017 IB)

History of the puzzle[edit]

First appeared on WPC 2005/Part 5. Author of the puzzle was Zoltán Horváth (Hungary).

Probable precursor to this puzzle appeared on 2002 US Qualifier.[1] The puzzle, also entitled "Tiger in the Woods," asked solver to find a shortest way through the maze under the same rule about changing of the direction. Author of the puzzle was Nob Yoshigahara (Japan). Some puzzles in the competition was golf-themed, hence the name.

Appearances in the past WPCs[edit]