The Knight's Tour is a puzzle almost as old as chess itself. The
problem is very simple, the knight begins at the position shown,
then after 63 moves has traversed the entire chess board, landing
on every square once and only once. Since, starting from the
position shown, there are two possible solutions (which are
isometric or mirror images along a 45º diagonal), the correct
isomer is shown by the first three characters of the solution.
The solution, of course, takes the form N dd mm.mmm W ddd
mm.mmm.
You can check your answers for this puzzle on
Geochecker.com.
For a complete list of puzzle caches which have GeoChecker
confirmation and to see the hit/miss result counts for each,
go
here.