🚀 go-pugleaf

In article <1992Feb7.201342.4702@ctp.com> mvarg@ctp.com (Michael Vargo) writes:
:I'm looking for the algorithm for the "Knights Tour." It is an algorithm to
:>make a knight move around the chess board and hit every square exactly once.
:>I am looking for an optimized version, not a brute force method that I would have to run all night...Thanks...
:
I did this once using paper and a pencil.
If you don't need to get back to square one it is easy.
Keep track of all visited squares and remove them as you go.
Then jump to the least connected square.

:----------------------------------------------------------------
:I Michael Vargo                  II  Internet: mvarg@ctp.com   I 
:I Cambridge Technology Partners  II                            I
:I 617-349-1231                   II                            I
:----------------------------------------------------------------
:I "If you choose not to decide, you still have made a choice"  I
:I                                        - Freewill            I
:----------------------------------------------------------------

Urban Koistinen - md85-epi@nada.kth.se