<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1201.0749/</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/1201.0749/feed.xml" rel="self" type="application/rss+xml" /><item><title>There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem — mentioned by eesmith</title><link>https://news.ycombinator.com/item?id=35913753</link><guid isPermaLink="false">urn:hackerpapers:mention:1201.0749:35913753</guid><pubDate>Fri, 12 May 2023 09:10:36 GMT</pubDate><description>&lt;p&gt;Neat! More at https://www.technologyreview.com/2012/01/06/188520/mathemati... from when it was solved 10 years ago: &amp;gt; 7.1 million core-hours of processing time on a machine with 640 Intel Xeon hex-core processors. They started in January 2011 and finished in December. Though the paper at https://arxiv.org/abs/1201.0749 says Sudoku solving is &amp;quot;only&amp;quot; NP-complete, so it&amp;#x27;s not really an example of &amp;quot;harder than NP-Complete&amp;quot;.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1201.0749/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem — mentioned by triska</title><link>https://news.ycombinator.com/item?id=20151938</link><guid isPermaLink="false">urn:hackerpapers:mention:1201.0749:20151938</guid><pubDate>Mon, 10 Jun 2019 23:40:27 GMT</pubDate><description>&lt;p&gt;A valid Sudoku puzzle is such that the given clues admit precisely one solution. Hence, if you somehow manage to take into account all the initially available information, then no search is required, because, in a sense, the given hints already narrow down the entire space of (ostensibly) possible assignments to a single one. There are constraint solvers that do this. For example, with the CLP(B) version based on BDDs that I mentioned, the solver internally constructs a Binary Decision Diagram (BDD) which is like a (ideally: more compact) truth table of all assignments that satisfy the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1201.0749/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem — mentioned by noname120</title><link>https://news.ycombinator.com/item?id=20144807</link><guid isPermaLink="false">urn:hackerpapers:mention:1201.0749:20144807</guid><pubDate>Mon, 10 Jun 2019 08:22:29 GMT</pubDate><description>&lt;p&gt;I believe that there is a misunderstanding regarding the role of academic publishing. Before the Internet era, the only way to make your work known to other scientists was to publish it in a journal—prestigious if possible. Journals were a medium to spread scientific information and make it available. Nowadays the situation is very much different. For example, there are preprint repositories such as arXiv where researchers can publish papers with very little oversight[1]. The journals don&amp;#x27;t serve the role of making information available anymore. Their main role is to act as a filter for…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1201.0749/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem — mentioned by dahart</title><link>https://news.ycombinator.com/item?id=14539724</link><guid isPermaLink="false">urn:hackerpapers:mention:1201.0749:14539724</guid><pubDate>Mon, 12 Jun 2017 18:33:51 GMT</pubDate><description>&lt;p&gt;9! * 9! is not the number of boards, that is a bad estimate. If you don&amp;#x27;t account for symmetries, rotations, re-numberings and other things, the number of boards is 6.7e21. Even if you could check a full board in a nanosecond (which you can&amp;#x27;t) enumerating that number would take more than 200,000 cpu-years. The paper linked to in the OP&amp;#x27;s article says: &amp;quot;Due to the sheer number of sudoku solution grids a brute force search would have been infeasible, but we found a better approach to make this project possible. Our software for exhaustively searching through a completed sudoku grid, named…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1201.0749/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem — HN submission</title><link>https://news.ycombinator.com/item?id=3703311</link><guid isPermaLink="false">urn:hackerpapers:submission:1201.0749:3703311</guid><pubDate>Wed, 14 Mar 2012 14:31:31 GMT</pubDate><description>&lt;p&gt;There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1201.0749/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem — HN submission</title><link>https://news.ycombinator.com/item?id=3433535</link><guid isPermaLink="false">urn:hackerpapers:submission:1201.0749:3433535</guid><pubDate>Fri, 06 Jan 2012 15:07:45 GMT</pubDate><description>&lt;p&gt;Solving the Sudoku Minimum Number of Clues Problem [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1201.0749/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
