"Fredrik Lundh" <[EMAIL PROTECTED]> wrote: >[EMAIL PROTECTED] wrote: > >> The problem I'm trying to solve is. >> There is a 5x5 grid. >> You need to fit 5 queens on the board such that when placed there are >> three spots left that are not threatened by the queen. > >when you're done with your homework (?), you can compare it with >Guido's solution: > > http://svn.python.org/view/python/trunk/Demo/scripts/queens.py
That solves a different problem. The traditional N queens problem would be "place 5 queens so that none of them threatens another". That's very different from his problem specification. It turns out there is only 1 unique (non-rotated, non-reflected) solution to the problem as he posted it. -- - Tim Roberts, [EMAIL PROTECTED] Providenza & Boekelheide, Inc. -- http://mail.python.org/mailman/listinfo/python-list
