So there is no misunderstanding, the trial positioning would be
applicable to all levels, not just the first. In other words, solving
for each of the remaining Queens in turn is the same as for the first
Queen, except for the eighth Queen where no lower level positioning
need be considered,
On
om: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On
Behalf Of Lee Cullens
Sent: Wednesday, April 13, 2005 11:04 AM
To: [EMAIL PROTECTED]
Cc: tutor@python.org
Subject: Re: [Tutor] Re: Interesting anomaly with the Eight Queens
problem
John
The type of problem you mention and the extent of positioning
John
The type of problem you mention and the extent of positioning you go to
could result in an incomplete solution. In very general terms one
would need to place the first Queen then find an appropriate position
for the second, and each of the remaining Queens in turn until either
there are n
I read through Magnus Hetland's book and noticed the Eight Queens problem, which I had solved some time ago using Visual Basic.This time, I wanted to use a non-recursive solution. I randomly place each queen on board coordinates running from 0,0(top left hand corner of board) to 7,7(lower right han
