<?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=Cross-Hatching</id>
	<title>Cross-Hatching - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://www.sudopedia.org/index.php?action=history&amp;feed=atom&amp;title=Cross-Hatching"/>
	<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Cross-Hatching&amp;action=history"/>
	<updated>2026-04-29T04:15:52Z</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=Cross-Hatching&amp;diff=76&amp;oldid=prev</id>
		<title>Rooted: Created page with &quot;'''Cross-Hatching''' is a simple method by which players can find Hidden Singles in a Sudoku puzzle. It is one of the few methods that does not depend on the presence...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.sudopedia.org/index.php?title=Cross-Hatching&amp;diff=76&amp;oldid=prev"/>
		<updated>2020-05-31T05:25:03Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Cross-Hatching&amp;#039;&amp;#039;&amp;#039; is a simple method by which players can 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; puzzle. It is one of the few methods that does not depend on the presence...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Cross-Hatching''' is a simple method by which players can find [[Hidden Single]]s in a [[Sudoku]] puzzle.&lt;br /&gt;
It is one of the few methods that does not depend on the presence of [[pencilmark]]s.&lt;br /&gt;
&lt;br /&gt;
The primary target of Cross-Hatching are the [[box]]es, but the method will also work with [[row]]s and [[column]]s.&lt;br /&gt;
&lt;br /&gt;
== How it Works ==&lt;br /&gt;
The player selects a digit that has already been placed several times in the [[grid]], but not all (9) instances have been placed. The player then focuses on a single box or [[line]], drawing imaginary lines from the cells outside this box or line which contain this digit. The lines mark the invalid positions for this digit. Cells already containing another digit are also excluded. &lt;br /&gt;
&lt;br /&gt;
An example:&lt;br /&gt;
 .-------.-------.-------.&lt;br /&gt;
 | 1-----|-------|-+-----|&lt;br /&gt;
 | . . . | . . . | | 2 3 |&lt;br /&gt;
 | . . . | . . . | | . 4 |&lt;br /&gt;
 :-------+-------+-------:&lt;br /&gt;
 | . . . | . . . | | . . |&lt;br /&gt;
 | . . . | . . . | | . . |&lt;br /&gt;
 | . . . | . . . | 1 . . |&lt;br /&gt;
 '-------'-------'-------'&lt;br /&gt;
We are inspecting digit '''1''', box 3. The placement in '''r1c1''' eliminates the [[candidate]]s from row 1. The placement in '''r6c7''' eliminates the candidates from column 7. Of the remaining 4 cells, 3 already contain another digit. We can now place digit '''1''' in '''r3c8''', because all other candidates in box 3 are [[eliminate]]d.&lt;br /&gt;
[[Category:Solving Techniques]]&lt;/div&gt;</summary>
		<author><name>Rooted</name></author>
		
	</entry>
</feed>