Reachability
Rules[edit]
Draw paths from each each arrow such that all cells of the grid are visited by paths. A path can move only into the cell that is pointed at by the arrow, and then moving through the centres of cells horizontally or vertically. A path can visit either four or five cells including the cell with the arrow.
(Rules and example from WPC 2017 IB)
History of the puzzle[edit]
Invented by Anurag Sahay (India). The first puzzle was posted in Anurag's blog in January 2012.[1]
Appearances in the past WPCs[edit]
- WPC 2017/Round 2 by Prasanna Seshadri