<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Unbiased Statistics of a CSP - A Controlled-Bias Generator · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1111.4083/</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/1111.4083/feed.xml" rel="self" type="application/rss+xml" /><item><title>Unbiased Statistics of a CSP - A Controlled-Bias Generator — mentioned by 53x15</title><link>https://news.ycombinator.com/item?id=33126227</link><guid isPermaLink="false">urn:hackerpapers:mention:1111.4083:33126227</guid><pubDate>Fri, 07 Oct 2022 20:01:30 GMT</pubDate><description>&lt;p&gt;&amp;gt; A more reasonable question would be, how many partially completed sudoku grids are there which have a unique solution. We don&amp;#x27;t know the answer to that. The number of minimal Sudoku puzzles is estimated (with 0.065% relative error) to be 3.1055e+37 (or 2.5477e+25 for non-isomorphic minimal puzzles). See Bethier https://arxiv.org/pdf/1111.4083.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1111.4083/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
