Comment Comment by anonetal Actually the queens problem starting with an empty board is not NP-Hard. See: https://cstheory.stackexchange.com/questions/12682/is-the-n-...The "completion" problem is the NP-Hard one. As one of the other comments noted, the paper behind this press release is about the completion problem. parent anonetal 9 years ago
The "completion" problem is the NP-Hard one. As one of the other comments noted, the paper behind this press release is about the completion problem.