<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.sudopedia.org/index.php?action=history&amp;feed=atom&amp;title=Programming_Sudoku</id>
	<title>Programming Sudoku - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.sudopedia.org/index.php?action=history&amp;feed=atom&amp;title=Programming_Sudoku"/>
	<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Programming_Sudoku&amp;action=history"/>
	<updated>2026-04-29T04:15:15Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.34.1</generator>
	<entry>
		<id>https://www.sudopedia.org/index.php?title=Programming_Sudoku&amp;diff=24&amp;oldid=prev</id>
		<title>Rooted: Created page with &quot;A good place to start when you want to write your own Sudoku program is the [http://www.setbb.com/sudoku/ Sudoku Programmers forum].  == Sudoku Algorithms == ; Dancing Links...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Programming_Sudoku&amp;diff=24&amp;oldid=prev"/>
		<updated>2020-05-31T04:38:38Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;A good place to start when you want to write your own Sudoku program is the [http://www.setbb.com/sudoku/ Sudoku Programmers forum].  == Sudoku Algorithms == ; Dancing Links...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;A good place to start when you want to write your own Sudoku program is the [http://www.setbb.com/sudoku/ Sudoku Programmers forum].&lt;br /&gt;
&lt;br /&gt;
== Sudoku Algorithms ==&lt;br /&gt;
; [[Dancing Links]] | DLX&lt;br /&gt;
; [[Binary Integer Linear Program]]&lt;br /&gt;
&lt;br /&gt;
== Testing Sudoku Programs ==&lt;br /&gt;
; [[Test Cases]] &amp;amp;mdash; a set of formal tests for Sudoku software&lt;br /&gt;
&lt;br /&gt;
== General N&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; by N&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; Sudokus ==&lt;br /&gt;
This wiki specializes on the standard 9 by 9 Sudoku, but we can generalize this puzzle game into a N&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; by N&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; one, where every [[row]], every [[column]], and every N by N [[box]] must contain each of the digits 1 to N&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;. The generalized Sudoku is known to be NP-complete, which means that it is very unlikely to have an efficient algorithm that can solve any N&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; by N&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt; Sudoku exactly, with efficient meaning running time polynomial in N.&lt;br /&gt;
&lt;br /&gt;
References:&lt;br /&gt;
* Takayuki Yato and Takahiro Seta. [http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/SIGAL87-2.pdf Complexity and completeness of finding another solution and its application to puzzles.] IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E86-A(5):1052–1060, May 2003.&lt;br /&gt;
&lt;br /&gt;
{{incomplete}}&lt;/div&gt;</summary>
		<author><name>Rooted</name></author>
		
	</entry>
</feed>