n-queen problem

[jack]

haw to disvolve n-queen problem in c++ using stack

[jonnin]

write it iteratively. place a queen at random, and cross off the squares that
are now illegal(bool flags). repeat until all are placed. If cannot place
them all, start over with new random location that was not used in last attempt.
This is not the best method, but a modern machine can do it by brute force
in short order, and the best solutions are all over the net, ...




"jack" <yangj36@yahoo.com> wrote:
>
>haw to disvolve n-queen problem in c++ using stack

[jonnin]

Sorry. Use a stack where? anywhere? Missed that on first reading.


"jonnin" <jonnin@vol.com> wrote:
>
>write it iteratively. place a queen at random, and cross off the squares
that
>are now illegal(bool flags). repeat until all are placed. If cannot place
>them all, start over with new random location that was not used in last
attempt.
> This is not the best method, but a modern machine can do it by brute force
>in short order, and the best solutions are all over the net, ...
>
>
>
>
>"jack" <yangj36@yahoo.com> wrote:
>>
>>haw to disvolve n-queen problem in c++ using stack
>

[Alex]

You could use backtracking (yeah, I know it's not the best method). I've
got the sources in Pascal. If you want, I can send them to you.
jack <yangj36@yahoo.com> wrote in message news:3a6d1083$1@news.devx.com...
>
> haw to disvolve n-queen problem in c++ using stack