<?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=Scanning</id>
	<title>Scanning - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.sudopedia.org/index.php?action=history&amp;feed=atom&amp;title=Scanning"/>
	<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Scanning&amp;action=history"/>
	<updated>2026-04-29T04:28:37Z</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=Scanning&amp;diff=55&amp;oldid=prev</id>
		<title>Rooted: Created page with &quot;The most commonly used technique to find Hidden Singles in a Sudoku is scanning, although not everybody may know it by this name, or even realize that it has a name. [...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Scanning&amp;diff=55&amp;oldid=prev"/>
		<updated>2020-05-31T05:11:27Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;The most commonly used technique to find &lt;a href=&quot;/wiki/Hidden_Single&quot; title=&quot;Hidden Single&quot;&gt;Hidden Singles&lt;/a&gt; in a &lt;a href=&quot;/wiki/Sudoku&quot; title=&quot;Sudoku&quot;&gt;Sudoku&lt;/a&gt; is scanning, although not everybody may know it by this name, or even realize that it has a name. [...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;The most commonly used technique to find [[Hidden Single]]s in a [[Sudoku]] is scanning, although not everybody may know it by this name, or even realize that it has a name.&lt;br /&gt;
[[Image:Floor.png|right|A Floor]]&lt;br /&gt;
When we look at a [[floor]], as depictured here, we can see that it is made up of 3 [[row]]s and 3 [[box]]es. &lt;br /&gt;
[[Image:Floor2.png|right|A Simplified Floor]]&lt;br /&gt;
For scanning purposes, we forget about the [[column]]s, so a floor can be depicted in a simplified way.&lt;br /&gt;
&lt;br /&gt;
Now when we look at a single [[digit]], the floor requires exactly 3 placements of it.&lt;br /&gt;
&lt;br /&gt;
[[Image:FloorConfigs.png|right|Floor Digit Configurations]]&lt;br /&gt;
As shown here, these 3 digits can only be placed in 6 different ways in the simplified floor.&lt;br /&gt;
&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
This really simplifies the way we can look at candidates within a floor. With 1 digit placed within the floor, only 2 configurations remain. With 2 digits placed, the [[boxrow]] containing the last digit is known.&lt;br /&gt;
&lt;br /&gt;
To determine the correct minirow for a digit, you can use more information than just the other 2 placements of that digit within the floor. When all 3 cells in a minirow are either filled with another digit or eliminated by another placement of the digit in the column (see: [[Cross-Hatching]]), the complete boxrow is unavailable. A single unavailable boxrow leaves only 4 choices for the floor. In combination with a placed digit, the complete floor configuration for that digit  is known. 2 unavailable boxrows in the same row or box leaves only 2 configurations. &lt;br /&gt;
[[Image:FloorConfigs2.png|right|Floor with Eliminations]]&lt;br /&gt;
The image here shows these situations with unavailable boxrows (red), known placements (blue) and available boxrows (green).&lt;br /&gt;
&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&lt;br /&gt;
[[Image:FloorTower.png|right|Floor with Tower]]&lt;br /&gt;
With the possible digit configuration in a floor known, we can focus our attention on those boxrows that are the only one available in their box. For these boxes, we will perform a similar scanning action on the intersecting [[tower]]. The very colorful picture on the right shows you the result. By analyzing the floor and the intersecting tower, the location of a digit has been determined.&lt;br /&gt;
&lt;br /&gt;
Though this looks a little complicated with all the colors, it is something you can do from memory, because you do not have to remember so many pieces of information. There are, after all, only 6 permutations of the boxrows within a floor.&lt;br /&gt;
&lt;br /&gt;
== Side Effects ==&lt;br /&gt;
When you perform your scanning this way, you can skip the part of this Sudopedia that explains [[Locked Candidates]]. They are already taken into account when you consistently follow this scanning method.&lt;br /&gt;
&lt;br /&gt;
Scanning has the same results as [[Cross-Hatching]], but it is more methodical.&lt;br /&gt;
[[Category:Solving Techniques]]&lt;/div&gt;</summary>
		<author><name>Rooted</name></author>
		
	</entry>
</feed>