[XSL-LIST Mailing List Archive Home] [By Thread] [By Date]

Re: [xsl] n-queens?

Subject: Re: [xsl] n-queens?
From: "Mark" <mark@xxxxxxxxxxxx>
Date: Sat, 21 Apr 2012 11:25:29 -0700

This puzzle, although interesting, is commonly given to beginning programming students. I remember facing it myself. One I have never seen solved are the number of boards where less than eight queens is the maximum.

-----Original Message----- From: Ivan Shmakov
Sent: Saturday, April 21, 2012 8:26 AM
To: xsl-list@xxxxxxxxxxxxxxxxxxxxxx
Cc: Ivan Shmakov
Subject: Re: [xsl] n-queens?

Michael Hopwood <michael@xxxxxxxxxxx> writes:

I'm no chess OR maths expert but - surely they are not actually chess
queens if any two of the same colour can threaten each other?  The
puzzle using actual chess queens, at least one of which is of the
other colour, would look quite different...

AIUI, for the purposes of this puzzle, /each/ of the queens is assumed to be of its own distinct colour.

--cut: http://en.wikipedia.org/wiki/Eight_queens_puzzle --
   The eight queens puzzle is the problem of placing eight chess queens
   on an 8C8 chessboard so that no two queens attack each other.  Thus,
   a solution requires that no two queens share the same row, column,
   or diagonal.  The eight queens puzzle is an example of the more
   general n-queens problem of placing n queens on an nCn chessboard,
   where solutions exist for all natural numbers n with the exception
   of 2 and 3.
--cut: http://en.wikipedia.org/wiki/Eight_queens_puzzle --

FSF associate member #7257

Current Thread