<?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=Aligned_Triple_Exclusion</id>
	<title>Aligned Triple Exclusion - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://sudopedia.sudocue.net/index.php?action=history&amp;feed=atom&amp;title=Aligned_Triple_Exclusion"/>
	<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Aligned_Triple_Exclusion&amp;action=history"/>
	<updated>2026-04-18T21:37:31Z</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=Aligned_Triple_Exclusion&amp;diff=376&amp;oldid=prev</id>
		<title>127.0.0.1: Created page with &quot;&#039;&#039;&#039;Aligned Triple Exclusion&#039;&#039;&#039; is a solving technique in which the solver checks combinations of digits in a triple of cells located in an intersection. It is...&quot;</title>
		<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Aligned_Triple_Exclusion&amp;diff=376&amp;oldid=prev"/>
		<updated>2021-10-25T17:11:13Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Aligned Triple Exclusion&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; in which the solver checks combinations of &lt;a href=&quot;/index.php?title=Digit&quot; title=&quot;Digit&quot;&gt;digits&lt;/a&gt; in a triple of &lt;a href=&quot;/index.php?title=Cell&quot; title=&quot;Cell&quot;&gt;cells&lt;/a&gt; located in an &lt;a href=&quot;/index.php?title=Intersection&quot; title=&quot;Intersection&quot;&gt;intersection&lt;/a&gt;. It is...&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;Aligned Triple Exclusion&amp;#039;&amp;#039;&amp;#039; is a [[solving technique]] in which the solver checks combinations of [[digit]]s in a triple of [[cell]]s located in an [[intersection]]. It is an extension of &amp;#039;&amp;#039;&amp;#039;[[Aligned Pair Exclusion]]&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Example ==&lt;br /&gt;
An example of Aligned Triple Exclusion is shown below, taken from &amp;#039;&amp;#039;Ruud&amp;#039;s Daily Nightmare&amp;#039;&amp;#039; for [http://www.sudocue.net/olddaily.php?id=348&amp;amp;sol=0 2006 November 25].&lt;br /&gt;
&lt;br /&gt;
[[Image:AlignedTripleExclusion.png]]&lt;br /&gt;
&lt;br /&gt;
By enumerating the possible combinations of the blue cells, and striking off those combinations that conflicts with any of the yellow cells, we find that the [[digit]] 2 can be [[eliminate]]d from &amp;#039;&amp;#039;&amp;#039;r2c6&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Non-alignment ==&lt;br /&gt;
The enumeration technique does not require that the cells be aligned within an intersection. See [[Subset Exclusion]].&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Aligned Pair Exclusion]]&lt;br /&gt;
* [[Subset Exclusion]]&lt;br /&gt;
* [[Subset Counting]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Solving Techniques]]&lt;/div&gt;</summary>
		<author><name>127.0.0.1</name></author>
	</entry>
</feed>