Mathematician answers chess problem about attacking queens
Having done academic research into N-Queens, I&#x27;ll say that this is result is a remarkable step forward and, once vetted, is generations&#x27; worth of advancement in establishing the upper and lower bounds of the problem with remarkable precision.<p>Here&#x27;s to the next few generations taking this technique and not only applying it elsewhere, but also applying it to exactly solving for higher N than 27.<p>It&#x27;ll be fascinating to see if this supersedes symmetry breaking as done with the Q27 project in allowing us to dispatch far more efficiently the reasonable starting configurations to a highly parallelised #SAT solver, and allows us to come up with branching heuristics that are actually viable (as the research I was involved with showed most simply added overhead and little benefit for an overall negative effect).<p>Edit: here&#x27;s the arxiv so you can read the actual results, since Quanta makes it surprisingly awkward to look for. <a href="https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2107.13460" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;2107.13460</a>