From: W.-H. Steeb
Subject: Common LISP and Eight Queen problem
Date: 
Message-ID: <whs.130.3018EABA@rau3.rau.ac.za>
I am looking for a Common LISP program
which solve the eight queen problem.
As an exchange I can offer a C++ version.
email: ···@RAU3.RAU.AC.ZA
Prof. W.-H. Steeb
From: Marty Hall
Subject: Re: Common LISP and Eight Queen problem
Date: 
Message-ID: <DCFpIs.5A@aplcenmp.apl.jhu.edu>
In article <················@rau3.rau.ac.za> ···@rau3.rau.ac.za (W.-H. Steeb) writes:
>I am looking for a Common LISP program
>which solve the eight queen problem.

Many people seem to be unaware that if all you want is ONE solution,
no search is required for solving N-Queens for *any* N >= 4, and the
location of the queen on each row can be calculated in constant time
per-row with just a few lines of code. The algorithm was given
SigArt Bulletin Vol 2 No 2, pg 7. 

I can send a Lisp implementation to anyone who is interested, but it
is just a straightforward implementation of the SigArg algorithm.

						- Marty
(proclaim '(inline skates))