The Knight's Tour

Article View: gnu.chess

Article #5891

#5891

From: Michael Vargo
Date: Fri, 07 Feb 1992 20:13

12 lines
1398 bytes

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 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
----------------------------------------------------------------

Technical Details

Message-ID: <1992Feb7.201342.4702@ctp.com>

Path: arc1-ca.pugleaf.net!sparky!uunet!psinntp!ctp!mvarg

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: f936d,df05c049f137db20,start
X-Google-Attributes: gidf936d,public
X-Google-Thread: 10d71d,df05c049f137db20,start
X-Google-Attributes: gid10d71d,public
X-Google-ArrivalTime: 1992-02-08 17:13:02 PST
Newsgroups: gnu.chess,rec.games.chess
Path: arc1-ca.pugleaf.net!sparky!uunet!psinntp!ctp!mvarg
From: mvarg@ctp.com (Michael Vargo)
Subject: The Knight's Tour
Sender: news@ctp.com ( C News - Network News BBS)
Message-ID: <1992Feb7.201342.4702@ctp.com>
Date: Fri, 7 Feb 1992 20:13:42 GMT
Distribution: gnu
Organization: Cambridge Technology Partners