Escape Level : "Rook's Tour (Full Implementation)" by Dave

« back Browsing Levels: #3758 "Rook's Tour (Full Implementation)"


prev: #3757 "That Space"	next: #3759 "Rook's Tour (Full Implementation)"

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

added 27 Nov 2013 13:37

Solved 1/1

Cooked 0/1

Difficulty 8.00

Style 9.00

Rigidity 6.00

Shortest Solution
By Dave

On 27 Nov 2013 13:37

Comments (turn spoilers on)

18677 Rook's Tour (Full Implementation) Dave (2400) Wed 27 Nov 2013 17:54

Moved to graveyard:
Thank's Jim. Fortunately a small error rather than a fundamental problem with the mechanism.

Fix coming.

I'm also changing red to blue for the chequer effect. I'm not sure this is a necessary precaution but just in case ... Besides it gives you a very visual indication when a move has been made.

18675 Rook's Tour (Full Implementation) Dave (2400) Wed 27 Nov 2013 13:37

'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 is fatal but it can be passed over safely.

The only catch is you have to find the longest route possible. There are mathematical proofs of the length of the maximal route (330 for 8x8) but none regarding the number of different solutions that I am aware of.

Comments (turn spoilers on)

18677	Rook's Tour (Full Implementation)	Dave (2400)	Wed 27 Nov 2013 17:54
	Moved to graveyard: Thank's Jim. Fortunately a small error rather than a fundamental problem with the mechanism. Fix coming. I'm also changing red to blue for the chequer effect. I'm not sure this is a necessary precaution but just in case ... Besides it gives you a very visual indication when a move has been made.

18675	Rook's Tour (Full Implementation)	Dave (2400)	Wed 27 Nov 2013 13:37
	'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 is fatal but it can be passed over safely. The only catch is you have to find the longest route possible. There are mathematical proofs of the length of the maximal route (330 for 8x8) but none regarding the number of different solutions that I am aware of.