🚀 go-pugleaf

--=Boundary=-- 1 (308B5F67)
Content-Transfer-Encoding: 7BIT
Content-Type: Text/Plain; charset=US-ASCII

     I also had the N-queens problem in my Data Structures class at
     U.Md.  It's described and diagrammed in many textbooks if you need 
     supplemental information.
     
     Ruth Parrish


______________________________ Reply Separator _________________________________
Subject: Re: a beginer want to know ......
Author:  info-gnu-chess-ownrr@prep.ai.mit.edu at VITRO_VAX
Date:    10/21/95 4:15 PM


zhuhail@vax.sbu.ac.uk wrote:
: I just want to know how difficult following problem is:
: put 8 queens in the chess board without attach each orther. 
: How many solutions it may have.
     
I suspect that you're doing this as part of a school assignment.
I had to solve the same problem myself when I took an introductory 
level computer science course many years ago.  At any rate, there's 
no great mystery, once you get past the mental block of worrying 
about how to write a chess program, which is quite different from 
what you have to do here.  Basically, the solution consists of 
figuring out an elegant way of determining whether two queens 
intersect, and then simply finding the answer by a brute-force method 
of placing a queen, placing another queen, backing up when you're not 
able to place yet another queen, and so on until all eight queens are 
successfully placed.  Many possible solutions will, of course, map to 
each other, but I'm not sure how many truly
unique classes of solutions exist.  Hope this helps!
     
     
------------------------------------------------------------------------- 
|  Scott Taylor (staylor@netcom.com)  |  What kind of an idea are you?  | 
|  CI$: 70662,1777   AOL: STaylor758  ----------------------------------| 
|  WWW URL: ftp://ftp.netcom.com/pub/st/staylor/homepage.html           | 
-------------------------------------------------------------------------
     
--
------------------------------------------------------------------------- 
|  Scott Taylor (staylor@netcom.com)  |  What kind of an idea are you?  | 
|  CI$: 70662,1777   AOL: STaylor758  ----------------------------------| 
|  WWW URL: ftp://ftp.netcom.com/pub/st/staylor/homepage.html           | 
-------------------------------------------------------------------------

--=Boundary=-- 1 (308B5F67)
Content-Transfer-Encoding: 7BIT
Content-Type: Text/Plain; charset=US-ASCII

X-From: staylor@netcom.com AT VITRO_VAX
X-To: info-gnu-chess@prep.ai.mit.edu AT VITRO_VAX
X-Hop-count: 1
X-Message-id: staylorDGt3tp.7zE
X-References: O?)
X-trace: from gnu-life.ai.mit.edu; by vitro.com; Relayed; 10/21/95  1:10PM
X-trace: from gnu-life.ai.mit.edu; by vitro.com; Relayed; 10/21/95  1:10PM
X-trace: from life.ai.mit.edu; by gnu-life.ai.mit.edu; Relayed; 10/21/95
 12:52PM
X-trace: by life.ai.mit.edu; Relayed; 10/21/95 12:52PM
X-trace: by news.cis.ohio-state.edu; Relayed; 10/21/95 12:37PM

--=Boundary=-- 1 (308B5F67)--