<?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=Fish_and_Subsets</id>
	<title>Fish and Subsets - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://sudopedia.sudocue.net/index.php?action=history&amp;feed=atom&amp;title=Fish_and_Subsets"/>
	<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Fish_and_Subsets&amp;action=history"/>
	<updated>2026-04-18T19:59:34Z</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=Fish_and_Subsets&amp;diff=229&amp;oldid=prev</id>
		<title>127.0.0.1: Created page with &quot;Fish and Subsets are complementary to each other. One can transform a problem of finding a fish into a problem of finding a subset, and vice versa.  == Trawling for Fi...&quot;</title>
		<link rel="alternate" type="text/html" href="http://sudopedia.sudocue.net/index.php?title=Fish_and_Subsets&amp;diff=229&amp;oldid=prev"/>
		<updated>2021-10-25T09:16:47Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&lt;a href=&quot;/index.php?title=Fish&quot; title=&quot;Fish&quot;&gt;Fish&lt;/a&gt; and &lt;a href=&quot;/index.php?title=Subset&quot; title=&quot;Subset&quot;&gt;Subsets&lt;/a&gt; are complementary to each other. One can transform a problem of finding a fish into a problem of finding a subset, and vice versa.  == Trawling for Fi...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;[[Fish]] and [[Subset]]s are complementary to each other. One can transform a problem of finding a fish into a problem of finding a subset, and vice versa.&lt;br /&gt;
&lt;br /&gt;
== Trawling for Fish Using Locked Sets ==&lt;br /&gt;
&lt;br /&gt;
It may be difficult to spot a [[fish]] in a [[pencilmark]] [[grid]], especially [[Swordfish]], [[Jellyfish]], or [[Squirmbag]]s.  But the analysis and discovery of basic fish ([[X-Wing]], Swordfish, Jellyfish, Squirmbag) can be made easier by mapping the fish problem onto a [[Locked set]] problem.  Here is the procedure for analyzing a row-based Swordfish:&lt;br /&gt;
&lt;br /&gt;
# Make a list of 9 sets, each one corresponding to a row in the Sudoku. Populate each set with the column numbers of each column within that row that has the digit for which we&amp;#039;re searching for a basic fish.&lt;br /&gt;
# Examine the sets, looking for a locked triple--a group of three sets containing only the same three numbers.&lt;br /&gt;
# If you find such a locked triple, you have netted a Swordfish!  The digits in the locked triple are the column numbers in the Swordfish.&lt;br /&gt;
&lt;br /&gt;
For a column-based Swordfish, swap &amp;quot;row&amp;quot; and &amp;quot;column&amp;quot; in the procedure:&lt;br /&gt;
&lt;br /&gt;
# Make a list of 9 sets, each one corresponding to a column in the Sudoku. Populate each set with the row numbers of each row within that column that has the digit for which we&amp;#039;re searching for a basic fish.&lt;br /&gt;
# Examine the sets, looking for a locked triple--a group of three sets containing only the same three numbers.&lt;br /&gt;
# If you find such a locked triple, you have netted a Swordfish!  The digits in the locked triple are the row numbers in the Swordfish.&lt;br /&gt;
&lt;br /&gt;
This technique also applies to the other basic fish:  X-Wing, Jellyfish, and Squirmbag.  In these cases, one looks for a locked pair, locked quadruple, or locked quintuple, respectively.&lt;br /&gt;
&lt;br /&gt;
=== Example ===&lt;br /&gt;
&lt;br /&gt;
Here we apply this technique to the &amp;quot;Swordfish in the Columns&amp;quot; example below to search for a swordfish on digit &amp;#039;&amp;#039;&amp;#039;3&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
[[image:swordfish-crx.png|Swordfish in the columns example]]&lt;br /&gt;
&lt;br /&gt;
The sets of row numbers are:&lt;br /&gt;
&lt;br /&gt;
 1:{57} 2:{} 3:{569} 4:{} 5:{17} 6:{289} 7:{15} 8:{268} 9:{1678}&lt;br /&gt;
&lt;br /&gt;
Sets 1, 5, and 7 form the locked triple {57}, {17}, {15}.  Our Swordfish is thus in columns 1,5,7 and the rows are the members of the locked triple:  rows 1,5,7.  The sets also point out the eliminations--they are any occurrences of the members of the locked triple in sets not part of the triple.  In this case set 3 contains 5, which means digit &amp;#039;&amp;#039;&amp;#039;3&amp;#039;&amp;#039;&amp;#039; can be eliminated from cell &amp;#039;&amp;#039;&amp;#039;r5c3&amp;#039;&amp;#039;&amp;#039;.  Similarly, 1 and 7 occur in set 9, so we can eliminate digit &amp;#039;&amp;#039;&amp;#039;3&amp;#039;&amp;#039;&amp;#039; from cells &amp;#039;&amp;#039;&amp;#039;r1c9&amp;#039;&amp;#039;&amp;#039; and &amp;#039;&amp;#039;&amp;#039;r7c9&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
== Finding a Subset by Fishing ==&lt;br /&gt;
&lt;br /&gt;
Here is a candidate grid:&lt;br /&gt;
 .------------------.------------------.------------------.&lt;br /&gt;
 | 67    469   3    | 4678  5     267  | 1     789   279  |&lt;br /&gt;
 | 57    8     2479 | 147   47    127  | 2347  6     23579|&lt;br /&gt;
 | 1567  146   2467 | 3     4678  9    | 2478  78    257  |&lt;br /&gt;
 :------------------+------------------+------------------:&lt;br /&gt;
 | 4     356   8    | 67    367   3567 | 9     2     1    |&lt;br /&gt;
 | 9     1356  567  | 168   2     1356 | 3678  378   4    |&lt;br /&gt;
 | 1367  2     67   | 14689 34689 136  | 3678  5     367  |&lt;br /&gt;
 :------------------+------------------+------------------:&lt;br /&gt;
 | 8     369   1    | 2     3679  4    | 5     379   3679 |&lt;br /&gt;
 | 36    7     69   | 5     1     8    | 236   4     2369 |&lt;br /&gt;
 | 2     34569 4569 | 679   3679  367  | 367   1     8    |&lt;br /&gt;
 &amp;#039;------------------&amp;#039;------------------&amp;#039;------------------&amp;#039;&lt;br /&gt;
Now let&amp;#039;s focus our attention to row 6:&lt;br /&gt;
 1367 2 67 14689 34689 136 3678 5 367&lt;br /&gt;
We can explode this row into a grid where the X-axis is the digit and the Y-axis is the cell. An X is placed for each candidate:&lt;br /&gt;
    1  2  3  4  5  6  7  8  9&lt;br /&gt;
 1  X     X        X  X&lt;br /&gt;
 2     X&lt;br /&gt;
 3                 X  X&lt;br /&gt;
 4  X        X     X     X  X&lt;br /&gt;
 5        X  X     X     X  X&lt;br /&gt;
 6  X     X        X&lt;br /&gt;
 7        X        X  X  X&lt;br /&gt;
 8              X&lt;br /&gt;
 9        X        X  X&lt;br /&gt;
It is now possible to draw 2 vertical lines which intersect with only 2 horizontal lines:&lt;br /&gt;
    1  2  3  4  5  6  7  8  9&lt;br /&gt;
 1  X     X  |     X  X     |&lt;br /&gt;
 2     X     |              |&lt;br /&gt;
 3           |     X  X     |&lt;br /&gt;
 4  X        X     X     X  X&lt;br /&gt;
 5        X  X     X     X  X&lt;br /&gt;
 6  X     X  |     X        |&lt;br /&gt;
 7        X  |     X  X  X  |&lt;br /&gt;
 8           |  X           |&lt;br /&gt;
 9        X  |     X  X     |&lt;br /&gt;
Since the candidates on these 2 vertical lines fully saturate these 2 horizontal lines, we can remove the remaining candidates from these 2 horizontal lines:&lt;br /&gt;
    1  2  3  4  5  6  7  8  9&lt;br /&gt;
 1  X     X  |     X  X     |&lt;br /&gt;
 2     X     |              |&lt;br /&gt;
 3           |     X  X     |&lt;br /&gt;
 4  -        X     -     -  X&lt;br /&gt;
 5        -  X     -     -  X&lt;br /&gt;
 6  X     X  |     X        |&lt;br /&gt;
 7        X  |     X  X  X  |&lt;br /&gt;
 8           |  X           |&lt;br /&gt;
 9        X  |     X  X     |&lt;br /&gt;
This is the resulting candidate list for row 6:&lt;br /&gt;
 1367 2 67 49 49 136 3678 5 367&lt;br /&gt;
By temporarily transforming the data, we have found a [[Hidden Pair]] using the [[X-Wing]] technique.&lt;br /&gt;
&lt;br /&gt;
== Extended Sudoku Board ==&lt;br /&gt;
&lt;br /&gt;
A fish of any size appears as a naked subset in the rn- or cn- representations. These representations are dual to the usual rc- representation. They are based on the generalised logical symmetries of Sudoku.&lt;br /&gt;
In the book &amp;quot;The Hidden Logic of Sudoku&amp;quot;, an extended Sudoku board has been defined in order to facilitate a wider use of these symmetries (This extended board and the way to use it are available online: see section &amp;quot;External links&amp;quot;). &lt;br /&gt;
&lt;br /&gt;
The rn- and cn- representations are now also available in the Sudocue program.&lt;br /&gt;
&lt;br /&gt;
Moreover, the above logical symmetries can be extended much beyond subsets and fish. For instance, the rn- and cn- representations can also be used for finding hidden chains (hidden xy, xyt, ...)&lt;br /&gt;
&lt;br /&gt;
== External Link ==&lt;br /&gt;
&lt;br /&gt;
* [http://forum.enjoysudoku.com/a-new-view-of-fish-naked-or-hidden-t5017.html A new view of fish]&lt;br /&gt;
&lt;br /&gt;
* Extended Sudoku Board: [http://www.carva.org/denis.berthier/HLS/XtdSudokuBoard.pdf]&lt;br /&gt;
&lt;br /&gt;
== See Also ==&lt;br /&gt;
&lt;br /&gt;
* [[Subset]]&lt;br /&gt;
* [[Fish]]&lt;/div&gt;</summary>
		<author><name>127.0.0.1</name></author>
	</entry>
</feed>