<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://sudopedia.sudocue.net/index.php?action=history&amp;feed=atom&amp;title=Tabling</id>
	<title>Tabling - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://sudopedia.sudocue.net/index.php?action=history&amp;feed=atom&amp;title=Tabling"/>
	<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Tabling&amp;action=history"/>
	<updated>2026-04-19T01:12:29Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.36.2</generator>
	<entry>
		<id>http://sudopedia.sudocue.net/index.php?title=Tabling&amp;diff=405&amp;oldid=prev</id>
		<title>127.0.0.1: Created page with &quot;&#039;&#039;&#039;Tabling&#039;&#039;&#039; is a solving technique which is not used by human players but by computer programs. The program builds a table of implications for the &#039;&#039;&#039;true&#039;&#039;&#039; and &#039;&#039;&#039;...&quot;</title>
		<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Tabling&amp;diff=405&amp;oldid=prev"/>
		<updated>2021-10-25T17:54:57Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Tabling&amp;#039;&amp;#039;&amp;#039; is a &lt;a href=&quot;/index.php?title=Solving_technique&quot; title=&quot;Solving technique&quot;&gt;solving technique&lt;/a&gt; which is not used by human players but by computer programs. The program builds a table of &lt;a href=&quot;/index.php?title=Implication&quot; title=&quot;Implication&quot;&gt;implications&lt;/a&gt; for the &amp;#039;&amp;#039;&amp;#039;true&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Tabling&amp;#039;&amp;#039;&amp;#039; is a [[solving technique]] which is not used by human players but by computer programs. The program builds a table of [[implication]]s for the &amp;#039;&amp;#039;&amp;#039;true&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;false&amp;#039;&amp;#039;&amp;#039; states of each remaining [[candidate]] in the [[grid]].&lt;br /&gt;
&lt;br /&gt;
The primary aim of tabling is to find a candidate that causes a [[contradiction]]. The program can then build a [[chain]] that proves this contradiction.&lt;br /&gt;
&lt;br /&gt;
Alternatively, the tables can be used to find [[verity|verities]], which are implications that occur for all alternative candidates in a [[constraint]]. Since multiple chains are required to prove a &amp;#039;&amp;#039;&amp;#039;verity&amp;#039;&amp;#039;&amp;#039;, this aspect of tabling is only used when no contradictions can be found.&lt;br /&gt;
[[Category:Solving Techniques]]&lt;/div&gt;</summary>
		<author><name>127.0.0.1</name></author>
	</entry>
</feed>