<?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=Law_of_Leftovers</id>
	<title>Law of Leftovers - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.sudopedia.org/index.php?action=history&amp;feed=atom&amp;title=Law_of_Leftovers"/>
	<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Law_of_Leftovers&amp;action=history"/>
	<updated>2026-04-29T01:00:33Z</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=Law_of_Leftovers&amp;diff=97&amp;oldid=prev</id>
		<title>Rooted: Created page with &quot;The '''Law of Leftovers''' is a solving technique that operates on Sudoku Variations with irregular regions, such as Jigsaw Sudoku.  The technique was devised...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Law_of_Leftovers&amp;diff=97&amp;oldid=prev"/>
		<updated>2020-05-31T19:06:53Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;The &amp;#039;&amp;#039;&amp;#039;Law of Leftovers&amp;#039;&amp;#039;&amp;#039; is a &lt;a href=&quot;/wiki/Solving_technique&quot; title=&quot;Solving technique&quot;&gt;solving technique&lt;/a&gt; that operates on &lt;a href=&quot;/wiki/Sudoku_Variations&quot; title=&quot;Sudoku Variations&quot;&gt;Sudoku Variations&lt;/a&gt; with irregular &lt;a href=&quot;/wiki/Region&quot; title=&quot;Region&quot;&gt;regions&lt;/a&gt;, such as &lt;a href=&quot;/wiki/Jigsaw&quot; title=&quot;Jigsaw&quot;&gt;Jigsaw&lt;/a&gt; Sudoku.  The technique was devised...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The '''Law of Leftovers''' is a [[solving technique]] that operates on [[Sudoku Variations]] with irregular [[region]]s, such as [[Jigsaw]] Sudoku.  The technique was devised by Bob Harris.&lt;br /&gt;
&lt;br /&gt;
The technique is based on the fact that an equal number of [[house]]s must have an equal number of occurrences for each [[digit]].&lt;br /&gt;
== Selecting Law of Leftovers regions ==&lt;br /&gt;
It may be difficult at first to find the best spots to apply this technique, but there is a method to quickly identify the most promising areas in the grid. Just look for borders between rows or columns which largely coincide with jigsaw borders. In the example, the border between column 6 and 7 has 5 cell borders which are also the border of jigsaw regions.&lt;br /&gt;
&lt;br /&gt;
[[Image:LOL1.png|Law of Leftovers example 1|right]]&lt;br /&gt;
* Draw a line separating a certain number of jigsaw regions.&lt;br /&gt;
: In the example, the red line separates the 3 light green jigsaw regions.&lt;br /&gt;
* Draw a line separating the '''same''' number of rows or columns.&lt;br /&gt;
: In the example, the blue line separates the left 3 columns.&lt;br /&gt;
* Identify the parts of the jigsaw regions '''outside''' the separated rows or columns.&lt;br /&gt;
: The example below has 2 cells sticking out.&lt;br /&gt;
* Identify the parts of the remaining regions '''inside''' the separated rows or columns.&lt;br /&gt;
: In the example, these parts have a light blue color.&lt;br /&gt;
* Verify that the number of ''innies'' and ''outies'' are the same.&lt;br /&gt;
: There are 2 green outies and 2 blue innies in the example.&lt;br /&gt;
* Compare the innies and the outies.&lt;br /&gt;
: See the next section for Law of Leftovers logic.&lt;br /&gt;
&lt;br /&gt;
== Comparing the innies and the outies ==&lt;br /&gt;
In the example, we see that one of the outies ('''r4c6''') contains digit 8. The green cells inside the last 3 columns only have room for 2 more instances of digit 8. The innies must therefore supply the missing digit 8. Fortunately, '''r3c7''' already contains digit 8, so this condition is satisfied.&lt;br /&gt;
&lt;br /&gt;
The other outie contains digit 5. Again, the blue innies must compensate this loss. There is only one innie left, so we can place digit 5 in '''r9c7'''.&lt;br /&gt;
&lt;br /&gt;
The '''Law of Leftovers''' states that '''in the solution, the innies and the outies contain the same digits'''. From this law, we can make the following deductions:&lt;br /&gt;
* A digit placed in an outie must also be placed in one of the innies.&lt;br /&gt;
* A digit placed in an innie must also be placed in one of the outies.&lt;br /&gt;
* A digit for which no outie has any candidates can be eliminated from all innies.&lt;br /&gt;
* A digit for which no innie has any candidates can be eliminated from all outies.&lt;br /&gt;
* When all innies belong to the same [[line]], a digit which must be placed in one of the innies can be eliminated from the other cells on that line.&lt;br /&gt;
* When all outies belong to the same line, a digit which must be placed in one of the outies can be eliminated from the other cells on that line.&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.sudocue.net/forum/viewtopic.php?t=656 Examples of Law of Leftovers]&lt;br /&gt;
* [http://www.bumblebeagle.org/dusumoh/8x8/tutorial/index.html Original Law of Leftovers tutorial]&lt;br /&gt;
* [http://www.djape.net/sudoku/wp/index.php/2007/08/24/the-law-of-leftovers-lol/ Law of Leftovers explanation at Djape.Net]&lt;br /&gt;
[[Category:Solving Techniques]]&lt;/div&gt;</summary>
		<author><name>Rooted</name></author>
		
	</entry>
</feed>