home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!dtix!darwin.sura.net!mips!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!osiris.cso.uiuc.edu!gordon
- From: gordon@osiris.cso.uiuc.edu (John Gordon)
- Newsgroups: comp.lang.c
- Subject: Re: Knight's tour
- Message-ID: <BswAwB.Dq7@news.cso.uiuc.edu>
- Date: 13 Aug 92 00:04:57 GMT
- References: <1992Aug12.160827.11332@seas.smu.edu>
- Sender: usenet@news.cso.uiuc.edu (Net Noise owner)
- Organization: University of Illinois at Urbana
- Lines: 24
-
- pedersen@seas.smu.edu (Ted Pedersen) writes:
-
- >Anyone out there have any nice Knight's Tour code (or know where it can
- >be readily obtained)?
-
- >(Note : the Knight's Tour is a problem where you try and make a knight
- > visit all of the squares of a chess board (without repitition) and having
- > your knight return to it's original starting point. I don't think I said
- > it very well but I hope the idea is sort of clear for those who haven't
- > heard of the problem.)
-
- >Actually what would be a dream come true is if there is an ftp site or a book
- >that has programs that solve some of the classical chess problems (n - queens
- >and knights tour are good examples of that). Hope someone can help. Thanks.
-
- The "What's The Code?" column in Computer Shopper magazine recently
- printed an article on the Knight's Tour, and I think it has dealt with
- a queen-related problem too. It really is a neat column, I have saved many
- articles from it, ranging from CPU caching schemes to the aforementioned
- Knight's Tour problem. Email me if you want the exact issue date.
-
- ---
- John Gordon My incredibly witty saying has been
- gordon@osiris.cso.uiuc.edu Politically Corrected into oblivion.
-