Knights Tour

Article View: comp.lang.prolog

Article #632

#632

From: Ted Pedersen
Date: Thu, 13 Aug 1992 16:58

15 lines
1157 bytes

I would very much like to find some Prolog code to solve the Knight's Tour
problem. This is the problem where you have a lone knight on a chess board and 
the goal is to have your knight visit all of the squares on the board and 
return to his starting place without visiting any square twice. 

I am not very experienced with Prolog so I am using these problems to (hopefully
) teach myself a little bit about Prolog.
  
If anyone knows of any repositories of source code to solve these sorts of
problems (Knights Tour, N-Queens problem, etc.) I would appreciate any tips. 
I enjoy these sorts of problems so anyone who knows of interesting variations
on the Knight's Tour or N-Queens problem etc. I would like to hear about them.
 
Ted Pedersen
Southern Methodist University

Technical Details

Message-ID: <1992Aug13.165812.12011@seas.smu.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!seas.smu.edu!pedersen

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.prolog
Path: arc1-ca.pugleaf.net!sparky!uunet!seas.smu.edu!pedersen
From: pedersen@seas.smu.edu (Ted Pedersen)
Subject: Knights Tour
Message-ID: <1992Aug13.165812.12011@seas.smu.edu>
Sender: Ted Pedersen 
Nntp-Posting-Host: express.seas.smu.edu
Organization: SMU School Of Engineering and Applied Science
Date: Thu, 13 Aug 1992 16:58:12 GMT
Lines: 15