4 ms·
It's currently solved for up to N=27 Both 26 and 27 solutions came from supercomputers/FPGAs and took months of compute time. http://www.nqueens.de/sub/WorldR
by imaginenore 9y ago
It's currently solved for up to N=27
Both 26 and 27 solutions came from supercomputers/FPGAs and took months of compute time.
http://www.nqueens.de/sub/WorldRecord.en.html http://www.nqueens.de/sub/WorldRecord.en.html
- chengsun 9y agoNo, you're talking about a different problem: that of counting the total number of n-queens solutions. The original article is talking about the problem of deciding, given a partial placement of queens, whether it can be completed by adding further queens to form an n-queen solution.