Tag Archives: hidden triple

A Hidden Triple From Hidden Logic

Hidden pairs are rare, but hidden subsets of n > 2 are rarer still. This updated solution of Royle 17-13727, a puzzle from a large collection of puzzles of 17 givens, was an example in The Hidden Logic of Sudoku … Continue reading

Posted in Basic Solving Procedures | Tagged , | 1 Comment

A Pattern Trial Defeats ultrahardcore 135

This post reports on the value pattern trial of the last post, its results, and the relatively easy march to a two cluster coloring solution of Stefan Heines ultrahardcore 135. The trial starts with the three 7 clues and naked … Continue reading

Puzzleproof’s Sudoku Extreme Is Good Basic

Finishing with no advanced moves, the Extreme Sudoku 2 collection proves less than extreme. However, the collection, including the last three selected puzzles, 154, 175 and 196, have many worthwhile examples of basic slink marking in action. In the Pzlpfx2 … Continue reading

Posted in Basic Solving Procedures, Puzzle Reviews | | Leave a comment

Brian Challenger’s Super Fiendish 7

The review of Challenger’s Super Fiendish collection opens with a long post, revisiting some advanced methods not seen here recently. Somewhat fiendish is the stonewalling in basic. The bypass gets nowhere, and the hidden triple alone removes candidates. Here is … Continue reading

Hidden Logic Box/Line Interactions

This post looks at the brief and very late THLS treatment of box/line interactions in rc space. I say late, because box/lines (1/31/12) are essential in basic marking of candidates. But in The Hidden Logic of Sudoku,  box/lines are introduced … Continue reading

Hidden Candidates of Hidden Logic

This post calls out the useless reporting scheme in place throughout The Hidden Logic of Sudoku, with a checkpointed hidden triple example that sysudokies have solved as homework. The Akron Tournament final checkpoint is at the end of this report. … Continue reading

Subsets by Susets

This post explains the concept of locked sets, and the terms associated with them.  It suggests how to find them, and includes  a scratchpad version of a common computer algorithm for detecting them. A locked set is defined with reference … Continue reading

Line Marking Follow Up Actions

This post describes the follow up to the candidate fill of each line in Sysudoku line marking.  This includes the marking of line slinks, checking for X-wings, identification of  naked and hidden singles, and marking of bi-value cells. It also … Continue reading

Posted in Basic Solving Procedures | | Leave a comment