On a 4 x 4 board what is the longest and the shortest 'tour' that a knight may make subject to no valid next destination being available, and not being able to revisit a prior square.
The knight starts in the top left cell (A).
| A |
B |
C |
D |
| E |
F |
G |
H |
| I |
J |
K |
L |
| M |
N |
O |
P |
|
Dismissing mirrored tours (A-P being the mirror) how many such routes are there?
(In reply to
re(2): solution (and variance) by Charlie)
In brianjn's defense, I had yet to append the additional routes that began A-J-P / A-G-P when he submitted his comment.
|
|
Posted by Dej Mar
on 2009-05-06 14:34:38 |
re(3): solution (and variance)
