« back             Browsing Levels: #3759 "Rook's Tour (Full Implementation)"
prev: #3758 "Rook's Tour (Full Implementation)" next: #3760 "Improv 2.1"


"Rook's Tour (Full Implementation)" by Dave

added 27 Nov 2013 18:01
Solved2/2
Cooked0/2
Difficulty9.50
Style9.50
Rigidity7.50
Shortest Solution
NameOriginal
Length332 moves
ByDave
On27 Nov 2013 18:01

Comments (turn spoilers off)
18678 Rook's Tour (Full Implementation) Dave (2400) Wed 27 Nov 2013 18:01  
  'Rook's Tour (Full Implementation)' uploaded by Dave:
An implementation of the classic Maximal Rook's Tour (or Arrow Tour) problem. Move a rook around a chess board in a re-entrant tour visiting every square once. A square is 'visited' if you stop and change direction on it. Once visited any attempt to stop on it again will be fatal but it can be passed over safely.

The only catch is you have to find the longest possible route (330 for 8x8).

Fixed.