Tag Archives: strong links

Hodoku Chain Building


This post endorses Hodoku’s explanation of strong and weak links, regretfully confined to chains. His discussions of grouping and ALS nodes are supplemented for completeness. Hodoku graphic representation of chains by cell shading and candidate coloring is seen to be … Continue reading

Posted in Advanced Solving, Expert Reviews, Hobiger | Tagged , , , , , , | Leave a comment

Building a Cluster in the HM Easter Monster


The solving of HMEM continues, as the two slink loops on numbers 3 and 7are strongly linked to form a Medusa coloring cluster, based on Hanson and Barans’ slink confirming trials. I believe this strategy is flawed, but will follow … Continue reading

Posted in Hanson, Monster | Tagged , , , , | Leave a comment

HM and SK Loops of the HM Easter Monster


Hanson and Marans’ four slink loops were derived by the “double nasty” trial loops of the previous post. Here we follow up on two rounds of removals. The identical “opening volley” is obtained by the corresponding SK loop, also displayed … Continue reading

Posted in Hanson, Monster | Tagged , , , , | Leave a comment

The Hanson Marans Easter Monster


This post begins a review of a web article by Bob Hanson and Dave Marans posted in March of 2008, entitled Solution of the Easter Monster Puzzle: Formal Logic and Number Pair Chains. The puzzle contains an SK loop, but … Continue reading

Posted in Hanson, Monster | Tagged , , , , | 3 Comments

The Pattern Slink


Here I introduce a new form of strong link, the pattern slink.  The letter assignment panel for pattern enumeration in LPO identifies such slinks.  Every unit induced slink between a number’s patterns identifies two mutually exclusive sets of patterns.  This … Continue reading

Posted in Advanced Solving, Extreme Solving | Tagged , , , , | Leave a comment

The Slink Magic of Coloring


Coloring is magic. It invokes the power of the strong link in ways that normally escape our attention. In coloring, we construct networks of slinks, called clusters. Each candidate of a cluster has one of two colors. Each of this … Continue reading

Posted in Advanced Solving, Sudoku Toolware | Tagged , , | 2 Comments