<?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=Gurth%27s_Symmetrical_Placement</id>
	<title>Gurth&#039;s Symmetrical Placement - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://sudopedia.sudocue.net/index.php?action=history&amp;feed=atom&amp;title=Gurth%27s_Symmetrical_Placement"/>
	<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Gurth%27s_Symmetrical_Placement&amp;action=history"/>
	<updated>2026-06-11T14:06:45Z</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=Gurth%27s_Symmetrical_Placement&amp;diff=404&amp;oldid=prev</id>
		<title>127.0.0.1: Created page with &quot;&#039;&#039;&#039;Gurth&#039;s Symmetrical Placement&#039;&#039;&#039; is a solving technique for solving Sudoku puzzles with 180-degree rotational symmetry in the givens, i.e., the cell &#039;&#039;&#039;r[i]c[j]...&quot;</title>
		<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Gurth%27s_Symmetrical_Placement&amp;diff=404&amp;oldid=prev"/>
		<updated>2021-10-25T17:53:06Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Gurth&amp;#039;s Symmetrical Placement&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; for solving &lt;a href=&quot;/index.php?title=Sudoku&quot; title=&quot;Sudoku&quot;&gt;Sudoku&lt;/a&gt; puzzles with 180-degree rotational symmetry in the &lt;a href=&quot;/index.php?title=Given&quot; title=&quot;Given&quot;&gt;givens&lt;/a&gt;, i.e., the cell &amp;#039;&amp;#039;&amp;#039;r[i]c[j]...&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;Gurth&amp;#039;s Symmetrical Placement&amp;#039;&amp;#039;&amp;#039; is a [[solving technique]] for solving [[Sudoku]] puzzles with 180-degree rotational symmetry in the [[given]]s, i.e., the cell &amp;#039;&amp;#039;&amp;#039;r[i]c[j]&amp;#039;&amp;#039;&amp;#039; contains a given if and only if the cell &amp;#039;&amp;#039;&amp;#039;r[10 - i]c[10 - j]&amp;#039;&amp;#039;&amp;#039; also contains a [[given]].&lt;br /&gt;
&lt;br /&gt;
The technique is applied to a rotational symmetric puzzle as follows. Suppose for every digit &amp;#039;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;#039;, we can find a digit &amp;#039;&amp;#039;&amp;#039;k&amp;#039;&amp;#039;&amp;#039;, such that for every cell in this puzzle that contains the given &amp;#039;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;#039;, its opposite cell (i.e., the cell that is rotated about &amp;#039;&amp;#039;&amp;#039;r5c5&amp;#039;&amp;#039;&amp;#039;) contains the given &amp;#039;&amp;#039;&amp;#039;k&amp;#039;&amp;#039;&amp;#039;. Then all the other cells in this puzzle will also contain this property. Furthermore, if the &amp;#039;&amp;#039;&amp;#039;r5c5&amp;#039;&amp;#039;&amp;#039; cell is empty, then &amp;#039;&amp;#039;&amp;#039;r5c5&amp;#039;&amp;#039;&amp;#039; can be assigned the digit &amp;#039;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;#039; whose opposite digit is also &amp;#039;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;#039;, or the missing digit if the puzzle contains givens for only eight of the nine digits.&lt;br /&gt;
&lt;br /&gt;
Stated another way, let the nine digits of a rotational symmetric puzzle be &amp;#039;&amp;#039;&amp;#039;a1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;a2&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;b1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;b2&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;c1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;c2&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;d1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;d2&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;e&amp;#039;&amp;#039;&amp;#039;. Suppose also that for all &amp;#039;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;j&amp;#039;&amp;#039;&amp;#039; in {1, ..., 9}, whenever the cells &amp;#039;&amp;#039;&amp;#039;r[i]c[j]&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;r[10 - i]c[10 - j]&amp;#039;&amp;#039;&amp;#039; are non-empty, we have both cells containing {&amp;#039;&amp;#039;&amp;#039;a1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;a2&amp;#039;&amp;#039;&amp;#039;}, {&amp;#039;&amp;#039;&amp;#039;b1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;b2&amp;#039;&amp;#039;&amp;#039;}, {&amp;#039;&amp;#039;&amp;#039;c1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;c2&amp;#039;&amp;#039;&amp;#039;}, {&amp;#039;&amp;#039;&amp;#039;d1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;d2&amp;#039;&amp;#039;&amp;#039;} or {&amp;#039;&amp;#039;&amp;#039;e&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;e&amp;#039;&amp;#039;&amp;#039;}. Then the empty cells can be filled up so that the above property is satisfied. Also, if &amp;#039;&amp;#039;&amp;#039;r5c5&amp;#039;&amp;#039;&amp;#039; is empty, then we can assign &amp;#039;&amp;#039;&amp;#039;e&amp;#039;&amp;#039;&amp;#039; to it.&lt;br /&gt;
&lt;br /&gt;
The rationale for &amp;#039;&amp;#039;&amp;#039;Gurth&amp;#039;s Symmetrical Placement&amp;#039;&amp;#039;&amp;#039; is that if we can apply a technique &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; to a group of cells &amp;#039;&amp;#039;&amp;#039;S&amp;#039;&amp;#039;&amp;#039; to assign a digit &amp;#039;&amp;#039;&amp;#039;X&amp;#039;&amp;#039;&amp;#039; to some particular cell &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039;, then we can also apply the same technique &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; to the cells that are opposite to &amp;#039;&amp;#039;&amp;#039;S&amp;#039;&amp;#039;&amp;#039; and assign the digit that is the partner of &amp;#039;&amp;#039;&amp;#039;X&amp;#039;&amp;#039;&amp;#039; to the cell that is opposite to &amp;#039;&amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;#039;. The puzzle is required to contain a unique solution for &amp;#039;&amp;#039;&amp;#039;Gurth&amp;#039;s Symmetrical Placement&amp;#039;&amp;#039;&amp;#039; to be valid. &lt;br /&gt;
&lt;br /&gt;
== Example ==&lt;br /&gt;
&lt;br /&gt;
[[Image:Gurth-example.png]]&lt;br /&gt;
&lt;br /&gt;
The above puzzle is difficult without using &amp;#039;&amp;#039;&amp;#039;Gurth&amp;#039;s Symmetrical Placement&amp;#039;&amp;#039;&amp;#039;. However, once &amp;#039;&amp;#039;&amp;#039;Gurth&amp;#039;s Symmetrical Placement&amp;#039;&amp;#039;&amp;#039; is applied, the remainder of the puzzle can be solved by [[single]]s alone. More specifically, the digit pairs are {&amp;#039;&amp;#039;&amp;#039;1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;2&amp;#039;&amp;#039;&amp;#039;}, {&amp;#039;&amp;#039;&amp;#039;3&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;6&amp;#039;&amp;#039;&amp;#039;}, {&amp;#039;&amp;#039;&amp;#039;4&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;7&amp;#039;&amp;#039;&amp;#039;}, {&amp;#039;&amp;#039;&amp;#039;5&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;8&amp;#039;&amp;#039;&amp;#039;}, and the missing digit &amp;#039;&amp;#039;&amp;#039;9&amp;#039;&amp;#039;&amp;#039;. (For example, &amp;#039;&amp;#039;&amp;#039;r3c4&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;r7c6&amp;#039;&amp;#039;&amp;#039; are opposites and contains &amp;#039;&amp;#039;&amp;#039;1&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;2&amp;#039;&amp;#039;&amp;#039;, and &amp;#039;&amp;#039;&amp;#039;r6c9&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;r4c1&amp;#039;&amp;#039;&amp;#039; are also opposites and also contains {&amp;#039;&amp;#039;&amp;#039;1&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;2&amp;#039;&amp;#039;&amp;#039;}.) So we can place &amp;#039;&amp;#039;&amp;#039;9&amp;#039;&amp;#039;&amp;#039; in &amp;#039;&amp;#039;&amp;#039;r5c5&amp;#039;&amp;#039;&amp;#039;, and the rest is very easy.&lt;br /&gt;
&lt;br /&gt;
[[Category:Solving Techniques]]&lt;br /&gt;
[[Category:Uniqueness]]&lt;/div&gt;</summary>
		<author><name>127.0.0.1</name></author>
	</entry>
</feed>