Giant in the Playground Forums - View Single Post

BarroomBard · 03-12-2011, 06:05 PM

It should be solvable: there is a similar chess problem called the Knight's tour, where a Knight tries to visit every square on the board once and only once.

03-12-2011, 06:05 PM	Top - End - #9
BarroomBard Dwarf in the Playground Join Date: Jun 2007	Re: Can this puzzle be solved? It should be solvable: there is a similar chess problem called the Knight's tour, where a Knight tries to visit every square on the board once and only once.