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).
Dismissing mirrored tours (A-P being the mirror) how many such routes are there?
(In reply to re: solution (and variance)
I think both DejMar and I listed 4 short paths and 24 long paths, which when reflected then brought the total to 8 and 48.
Posted by Charlie
on 2009-05-06 11:06:54