How many possible ways of placing N queens on the N x N chessboard without allowing them to attack each other? It is the Queens Problem and it is famous for its exceedingly high computational complexity :( . The following is the test for 16 Queens to place on 16 x 16 chess board. It took almost 12 hours to exhaust all the possible solutions on Centrino2 processors with 1GB RAM.
(One guy tested for 26 x 26 chess board!!!) http://www.durangobill.com/N_Queens.html
0 comments:
Post a Comment