On Dec 23, 8:05 am, Dennis Lee Bieber <[EMAIL PROTECTED]> wrote: > On Sat, 22 Dec 2007 11:36:07 -0800 (PST), cf29 <[EMAIL PROTECTED]> > declaimed the following in comp.lang.python: > > > Greetings, > > > I designed in JavaScript a small program on my website called 5 > > queens. > > Only 5? The classic algorithm is 8-queens on a standard 8x8 board, > as I recall...
The classic *problem* is "8 queens don't attack each other". > > http://en.wikipedia.org/wiki/Eight_queens_puzzle#The_eight_queens_puz... and then type Ctrl-F followed by domination. As the OP says, his "goal is to control all the chess board with five queens that do not attack each other" > > > My problem starts now. How can I find the next solution and append it > > to the list? Has anyone tried to do a such script? If anyone is > > interested to help I can show what I've done so far. > > None of your problems are Python related. This is an exercise in > designing an algorithm -- algorithms are language neutral. Indeed. The Wikipedia article has several clues on how to avoid a brute-force solution to the classic problem -- some of these should be applicable to the OP's problem. -- http://mail.python.org/mailman/listinfo/python-list
