<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The number of $n$-queens configurations · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2107.13460/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2107.13460/feed.xml" rel="self" type="application/rss+xml" /><item><title>The number of $n$-queens configurations — mentioned by babel_</title><link>https://news.ycombinator.com/item?id=28606495</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.13460:28606495</guid><pubDate>Tue, 21 Sep 2021 16:06:43 GMT</pubDate><description>&lt;p&gt;Having done academic research into N-Queens, I&amp;#x27;ll say that this is result is a remarkable step forward and, once vetted, is generations&amp;#x27; worth of advancement in establishing the upper and lower bounds of the problem with remarkable precision. Here&amp;#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. It&amp;#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…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.13460/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CO</category></item></channel></rss>
