News for hackers. Stuff that matters.
Re:The N-Queens completion problem is NP-hard by imaginenore on Monday September 04, 2017 @12:59PM (#15169427)
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

Re:The N-Queens completion problem is NP-hard by chengsun on Monday September 04, 2017 @03:19PM (#15170284)
No, 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.