Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!news.sprintlink.net!howland.reston.ans.net!newsfeed.internetmci.com!news.kei.com!simtel!swidir.switch.ch!swsbe6.switch.ch!news.unige.ch!usenet
From: Faundea1@uni2a.unige.ch (Alex Faundez)
Subject: Re: 8 Queens Problem
Content-Type: Text/Plain; charset=ISO-8859-1
Message-ID: <1995Nov16.155625.2918@news.unige.ch>
Sender: usenet@news.unige.ch
Reply-To: faundea1@uni2a.unige.ch
Organization: Universite de Geneve
X-Newsreader: WinVN 0.99.5
References: <gipxc02-061195192727@ngalm424.gal.nt.com>
Mime-Version: 1.0
Date: Thu, 16 Nov 1995 15:56:25 GMT
Lines: 21

In article <gipxc02-061195192727@ngalm424.gal.nt.com>, gipxc02@nt.com says...
>
>How does one place 8 queens on a chessboard so that no queen attacks any
>other ?
>A generalised version of the 8 queens problem is the N queens problem,
>where it is required to place N queens on an NxN board such that no piece
>attacks another !!
>
>Has anyone written  prolog  code for this procedure ?? If so i'd appreciate
>your help .
>
Stuart Russell uses this problem in his excellent book (Artificial 
Intelligenge, a modern approach, written by Stuart Russell and Peter Norvig, 
edited by Prentice Hall). Moreover, there's a Web site where you can find the 
codes for each problem discussed in his book.The address is 
http://www.cs.berkeley.edu/[wave or tilde, I can't type it with my 
keyboard!!]russell/aima.html.
You can also get the Lisp source code that accompanies thebook by anonymous 
ftp from ftp.cs.berkeley.edu, in the directory /ucb/people/russell/aima.
Hope it helps.

