https://www.sudopedia.org/index.php?action=history&feed=atom&title=Subset 2026-04-29T02:59:19Z Revision history for this page on the wiki MediaWiki 1.34.1 https://www.sudopedia.org/index.php?title=Subset&diff=194&oldid=prev 2020-06-03T19:19:28Z

<p>Created page with &quot;Complex problems can often be solved by finding ways to split them into several smaller problems. In a Sudoku, each <a href="/wiki/House" title="House">house</a> is a problem that has 362880 possible solutions (...&quot;</p> <p><b>New page</b></p><div>Complex problems can often be solved by finding ways to split them into several smaller problems. In a Sudoku, each [[house]] is a problem that has 362880 possible solutions (the possible permutations for the 9 [[digit]]s). To reduce this number, a player will try to isolate groups of [[cell]]s and digits from the remainder of the house.<br /> <br /> When '''N''' cells and '''N''' digits are isolated, a '''subset''' of size '''N''' is formed.<br /> <br /> Alternative terms are '''disjoint subset''', '''locked set''' and '''number chain'''.<br /> <br /> == Subset Techniques ==<br /> There are 2 solving techniques that are focused on subsets:<br /> <br /> ; [[Naked Subset]]<br /> : N cells with candidates for only N digits.<br /> <br /> ; [[Hidden Subset]]<br /> : N digits that only have candidates in N cells.<br /> <br /> Naked and hidden subsets are complementary. When a house with 7 unsolved cells has a naked subset of size 3, it also contains a complementary hidden subset of size 4.<br /> <br /> == Fish and Subsets ==<br /> [[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. See [[Fish and Subsets]] for more.<br /> <br /> == See Also ==<br /> * [[Almost Locked Set]]<br /> * [[Fish]]<br /> * [[Fish and Subsets]]</div>

Rooted