<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The $n$-queens problem · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2109.08083/</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/2109.08083/feed.xml" rel="self" type="application/rss+xml" /><item><title>The $n$-queens problem — mentioned by mauricioc</title><link>https://news.ycombinator.com/item?id=30072060</link><guid isPermaLink="false">urn:hackerpapers:mention:2109.08083:30072060</guid><pubDate>Tue, 25 Jan 2022 14:22:48 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s worth pointing out that Bowtell and Keevash proved a similarly impressive result for the toroidal case: https://arxiv.org/abs/2109.08083&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2109.08083/"&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>
