To Nishio or Not to Nishio


This post examines Paul  Stephens’ favored form of Nishio, from his two current books on advanced Sudoku solving.  The analysis of the Addicts 140 determines the relationship between Stephens’Nishio and a simple test for grouped almost nice eliminating loops on the Sysudoku X-panel..

In the introduction to his year of instruction in Mastering Sudoku Week by Week, Paul  states his number one golden guideline of Sudoku solving.  It is “1. Never guess.”  Yet, even though standard advanced solving techniques are omitted, he spells out in Weeks a favorite trial and error method, saying that it is the method named after the Japanese puzzle master Tetsuya Nishio.  Paul characterizes his Nishio as “controlled trial and error”, pointing out that it can only prove the guess wrong, never right.  But then he recommends guessing the value of an arbitrarily chosen bi-value  cell, often proving the bv partner right.

Paul’s Nishio procedure is widely known among trial and error methods, but I am reporting here that it has a better use as an X-panel analysis mechanism for finding grouped x-chain ANL removals.

I suggest giving a goal directed name for it in this context,  the ANL Test.  If conducted in the controlled way that Stephens prescribes, the procedure either reaches no conclusion, or it establishes guideposts for an almost nice loop removing the test candidate in the position of the Nishio candidate guessed to be false.   It is a humanly practical way to find very obscure eliminating almost nice loops on the X-panel.  The ones constructed from X-chains with grouped nodes.  The many  options in these constructions  try  human patience.  If used to find such extreme ALN’s after advanced methods are exhausted,  Nishio procedure can be welcomed as a tool for human solving.   Proof by pudding on each individual case.

In Weeks, Paul’s Nishio is demonstrated on a full grid, but we need only the left panels below.  Start by choosing the candidate to be eliminated. In his demonstration, Paul chooses the bv r1c2 with numbers  2 and 7, choosing 7 as the number, to be proved false.

Weeks Nishio demo

The left 7-panel shows Paul’s “red pin” candidate shaded red.  Now mark out all candidates the chosen candidate sees.  These are “x”ed  in the right panel.  If any unit then has only marked out candidates, a contradiction has been found, and the chosen candidate is removed.  If, as in the case here, units remain with a single unmarked candidate, then mark out all remaining candidates these single candidates see.

In the right panel  above the letter “o” marks these.  A unit, r8, is completely marked out.  The test has succeeded in removing the chosen candidate (but not the single remaining candidate in r3c6).  Repeat the marking as long as single candidate units remain each time.  If no units have been emptied, the test has failed, but this does not prove that the chosen candidate is true.  If the process continues isolating single unmarked candidates until every unit has an single unmarked candidate and a pattern has been formed, the Nishio has failed, and no conclusion is made.

Weeks Nishio fwingLooking at the left panel again, did you notice the finned 7-wing that removes Paul’s Nishio victim, but without any guesswork?  The unfortunate red 7 finds itself in the box with the fin. The other would be victims escape.

Inconveniently for Stephens, this example makes a better case for more information about advanced solving methods than it does for his Nishio.

 

A similarly inconvenient truth emerges  in the Week 32 puzzle that is intended for Weeks readers to test their Nishio skills.  In the puzzle notes Paul says, “This one hits a brick wall, with hardly any squares solved by the time you need the Nishio.  If you can solve it, then you’re well on the way to becoming a true Sudoku expert.”

week 32 f1-wingWell, yes and no.  Box marking brings no clues, but 20 slinks.  Line marking is tough, with a naked single, but four 5f lines, four 6f lines and four 7f lines. No bv scan results. Then on the 1-panel, you get this, a finned 1-wing immediately collapsing Week 32.  No brick wall requiring Nishio here.

But wait, there is more to the Nishio demo example.  The demo panel is reproduced below on the left.  On the right is the almost nice loop constructed directly from the demo panel.

Weeks Nishio ANL

Start forcing chains from the chosen candidate to the rejecting unit and to single candidates that the chosen candidate identified.  Each single candidate sees a next single candidate it identifies,  and a slink can be drawn.  The forcing chains arrive in the rejecting unit on a wink, and  there are two of them, so a connecting slink in the rejecting unit can always be drawn.

Did we just prove that every successful  Stephens Nishio creates an x-chain almost nice loop? Almost.   Ironically, Paul Stephens writes elsewhere that a successful Nishio provides an X-chain ANL.  He actually makes this assertion in Addicts in the notes to his most difficult puzzles.  But without showing how it happens, and obscuring it by his interpretation of x-chains as links between “squares” and his inexplicable lumping of almost nice loops(ANL)  into “Nice loops”.

In my post of November 20, 2012, Nishio Forcing Chains?,  I deal with a similar misinterpretation of almost nice loops as Nishio tests by Andrew Stuart.  Andrew turns it around by taking an ordinary ANL, even one formed by an AIC chain, and claims it to be a Nishio on some bv candidate on the chain.  Andrew claims a distinct solving technique called a Nishio forcing chain, consisting of starting at a candidate guessed to be false, and extending two forcing chains from that candidate until they meet.  For X-chains, Paul’s Nishio procedure is perhaps a quick way to determine if the “Nishio forcing chain” is going to work, but my answer to both Stephens and Stuart  is: FIND THE ANL!  In this context, you   may be interested in my answer to a reader who read into that post that my aversion to trial and error is ideological. No, ideology is not logic.

Addicts 140Whew! That felt good.

Along with the finned X-wings, we might well have found the simple ANL in Weeks 32 without recourse to a Nishio on one of its candidates.  A better case for the ANL test is made by puzzle 140 in The Sudoku Addict’s Workbook , for which Paul Stephens strongly recommends the Nishio.

Next post,  we will continue with Addicts 140 and the ANL Test.  If you are extremely ambitious, you might like to do the basic solving on Addicts 140. To participate in the hunt, you can skip the unproductive bv scan and go directly to a full x-panel.

Posted in Advanced Solving Techniques, Reviews | Tagged , , , , , | Leave a comment

Stephens in the Library with a Laptop


This post continues with differences between sysudoku advanced solving and the Paul Stephens “extreme” order of battle.  In particular, the power of full Medusa coloring compared to Stephens’ limited multi-colouring.

Let’s begin with a checkpoint for solve-along sysudokie readers.  In Mastering Sudoku Week by Week, Paul Stevens describes the solving techniques he expects his readers to find in the Week 48 puzzle.  In my previous post, examples from Weeks and The Sudoku Addicts Workbook showed us what Paul means by this description.  After sysudoku basic solving, Week 48 collapsed in the bv scan, before encountering Stephens’ knockout punches.  I suggested that you  restart the puzzle after the two UR eliminations, and attempt to reconstruct Stephens’ results.  Here is my checkpoint report on that.

To bypass the collapse in the bv scan stage, we restart after the two NUR eliminations and resulting 8-wing.  The X-panel at that point is revealing.  I’ve introduced simple coloring to show the connections between methods.

Week 48 xpanel

There were no candidates left for the 5- and 7-panels.  We do have a swordfish in the 2-panel, but it’s a dead one, i.e. no victims.  The 3-panel has two disconnected and dead 3-wings.  Dead jellyfish inhabit the 1- and 9-panels.  In the 8-panel the blue/green cluster  spreads across a dead jellyfish and a dead 8-wing.

It was not a good day for fishing.  Too windy?  No, live fish are somewhat  fished out by effective sysudoku basic solving that has already removed many victims.  But the 6-panel and the 9-panel have more to tell us.

Let’s look at the 6-panel first.  There are two “conjugate pair chains”, i.e. coloring clusters.  One color traps 6 in r2c2. This in itself proves blue, then red.  Alternatively, you can use a bridging wink, with green seeing orange, and thereby proving blue or red.  The r2c2 candidate sees both colors.  Alternatively, there is a skyscraper to do the same elimination.  Another 6-chain removes 6 in r2c6, proving red, then blue.  Simple coloring often duplicates the X-panel analysis of X-chains.

Going beyond Stephens, my readers see something else in the 6-panel, a finned 6-wing on rows 2 and 5, with r2c5 as the fin, marked ‘f’.  The three victims are in the box with the fin.  A finned fish is handicapped, but any would-be victim that sees (is related to) the fin is indeed a victim.  But there is more.  The candidate in r6c2 is a would-be victim that escapes, because it does not see the fin. Instead, if it is true, so is the fin. This is kraken analysis, another productive solving technique that Stephens never mentions, that sysudokies routinely find with finned fish.

Week 48 full clusterThe 9-panel above is probably home to the 6-square conjugate pair chain that Paul was hinting at.  But in this grid, Week 48 demonstrates that Stephens’ multi-colouring enlists only a small fraction of the power of Medusa coloring.  The grid shows  where the blue/green cluster of the 9-panel goes when coloring  includes the slinks in the bv cells, and skips to 1, 2, 3, and 8-candidates. Note how many more squares are immediately solved when blue is proved true!

Bottom line,  these review posts have called attention to many gaps and limits in the Stephens solving repertoire.  In view of these, is “Mastering” the right title word?  We might also wonder what kind of “Addicts” Paul has in mind.  Sysudokies are a type of Sudoku addict, but the reviewed Stephens’ books are not much more than puzzle books for them. Certainly not reliable instruction books on solving.

Next time, I’ll be analyzing a positive contribution to sysudoku from Stephens’ books.  Strangely enough, it’s his procedure for Nishio.

Posted in Advanced Solving Techniques, Reviews | Tagged , , , , , | Leave a comment

Extreme Stephens


This post completes my analysis of Paul Stephens advanced solving instruction in his current books, covering his “extreme” sections. Paul’s descriptions and examples are evaluated from the sysudoku perspective.

Let’s start with another look at Paul’s preview for his Week 48 puzzle, in Mastering Sudoku Week by Week.  Paul said “Gridlock can be broken with a Swordfish, two non-unique rectangles, two XY wings and a forcing chain – or a six-square conjugate pair chain that solves three squares instantly and leaves the rest solvable by simple methods.”

So far, I found the rectangles, and one XY wing, along with much longer XY ANL.  There was a helpful  X-wing uncovered in marking the URs, but the puzzle collapsed before an X-panel was prepared for regular fishing.  There went the  swordfish.

Although I used forcing chains on Week 48 to analyze a Sue de Coq and to implement an ER XYZ-wing,  these could not be the forcing chain of Paul’s preview, because SdC and ER are not covered in the  Stephens books.  So what is a “forcing chain” in Stephens speak?  This question sent us looking in Weeks, where we got a jaw dropping answer.

The long blue XY chain of the previous post, that I identified as an eliminating almost nice loop is Stephens’ “forcing chain”.  Stephens tells us that a nice loop of XY cells that “doesn’t end right” is a forcing chain. To explain this, Paul offers this example:

Stephens forcing chain exPaul attempts a nice loop, which he calls a “forcing loop”, starting with the 5-candidate in r4c6 (A). He gets around to the point of linking the c5 squares (E), and draws the conclusion that the “forcing loop” (what he calls a sysudoku  confirming ANL) is not going to end right. He then “tries” 5 and 9 (A), tracing his way to the conclusion that 9 in r9c6 is removed in either case.  As shown below, these traces are forcing chains, but Stephens has no name for them.

Stephens forcing chains 2

 

Compounding  the confusion,  Stephens points out that the same removal can be done by  tracing both candidates in square C. In fact, he is echoing Andrew Stuart’s digit forcing chain, which I revealed to be a redundant and miseading re-interpretation of the almost nice loop, which Stuart had at least covered.  Why not point out that the forcing chains can be started from squares B, D, and E as well?

 

Stevens forcing chainWhen you display the internal bv links and view the XY chain properly, as we have here, it is clear that Stephens’ example is a quite ordinary almost nice loop, with toxic end candidates eliminating the 9 in r9c6. It is not a forcing chain.

Paul Stephens is confusing many with his muddled definitions of nice loops and forcing chains.  Forcing chains apply to alternate inference chains of all kinds, and to many techniques.  His definitions limit them to bv cells.

OK, getting back to Week 48,  guess I found Paul’s “forcing chain” after all.

Now what is a “six –square conjugate pair chain?  “Conjugate pair “ is another name for a  strong link, a slink.  That makes a conjugate pair chain an X-chain of slinks.  Sysudoku readers are familiar with slink chains in two contexts:  X-chains and coloring.

To review:  Since slinks can be interpreted as winks(weak links), slink chains are alternate inference chains defining toxic pairs. Slink loops make nice loops or almost nice loops, depending on the odd or even number of links.  This creates interesting situations I covered earlier with X-chains.

Slink networks are the basis of coloring, in which we extend a network in every direction and call it a cluster. In the Medusa coloring endorsed in sysudoku, we use bv internal slinks  to extend the cluster over multiple numbers.

These two slink chaining themes are combined in Stephens.   Paul does simple coloring by alternately labeling squares along the chain “A” and “B”.  His conjugate pair chains are simple coloring clusters.  With this mechanism, Paul covers color traps and color wraps.  But of course, Paul has to call them something else.  The color wrap is a “self-solving conjugate pair chain” and the color trap is a “non self-solving conjugate pair chain”.

So now we know what Paul means by a “six-square conjugate pair chain” solving 3 squares. Can we find it? Maybe, but while we’re on the subject of coloring, let’s look into the Stephens multi-colouring,  Types 1 and 2.  Stephens describes “multi-colouring” as an interaction of two unconnected, but related conjugate pair chains.  This would make it the bridging of clusters.

Stevens multicolouring Type 1 is a color trap of one cluster color seeing both colors of another, and therefore promoting every member of its opposing color into a clue. In the left panel extracted from Stephens’ example in The Sudoku Addict’s Workbook, blue candidates see both red and orange candidates, making all green candidates true.  By the way, representing the seeing by winks, we see an almost nice loop confirming the green candidate, with the same result by X-chains

Type 2 occurs when candidates of color A in cluster A/B sees color X in color XY, invoking the logic: not (A and X)=> B or Y, making B and Y a toxic pair of colors for all other candidates.  The X-chain version of this example is a skyscraper, one of the best known of X-chain formations.

In the last paragraphs of Addicts, in a section mistitled “Nice Loops”,  Paul finally acknowledges that weak links exist,.  He calls them  “forcing pattern connections”.

Stevens confirming ANLThen he presents this “discontinuous nice loop”, but omits the three internal slinks, and the internal wink that demonstrate that it is an AIC nice loop.  He thinks of links as being between squares, and attaches a candidate number to each link.  This makes it difficult to see the pattern as an almost nice loop confirming 6 in r1c1. Instead, Paul  starts a forcing loop by saying, “if r1c1 is 1”, and traversing the loop, arrives back in r1c1 saying “then r1c1 is 6”.  The contradiction tells him that r1c1 is not 1. Paul should just learn how a confirming ANL works, and stop traversing loops when he encounters one.

As in basic solving, Paul Stephens’ version of advanced solving has little to offer  sysudokies. The study of his words and his puzzles pays dividends, however,  as my next few posts will show.

Now that we know what to look for, let’s see if we can see what Paul Stephens saw in Week 48. We’ll skip the bv scan techniques, except for the UR eliminations, and their marking, which included the 8-wing. So crank up your X-panel, and cast your line for that swordfish.

 

Posted in Advanced Solving Techniques, Reviews | Tagged , , , , , | Leave a comment

A Bv Scan of Week 48


Here we checkpoint the sysudoku bv scan on the blog homework puzzle, Week 48 in Paul
Stephens’ Mastering Sudoku Week By Week.  The scan includes Sue de Coq and APE, two
techniques ignored by Stephens’ books, and two techniques, XYZ-wings and
XY-chains, which he considers “extreme”.

Week 48 NURsAfter the line marking we traced last post,  there is UR23 in r79c25. It is a Stephens type 1, yielding a 6-clue in the South box.

Remarkably, this clue generates one of Andrew Stuart’s avoidable rectangles  on numbers 2 and 6 in cells r78c48. Avoiding it requires the  8-clue confirmed in SE. Maybe that accounts for Paul’s two NURs, but I find no mention of anything like the Avoidable in the Stephens’ books.

On another front, Stephens’The Sudoku Addicts Workbook endorses the BUG+1 technique of resolving the “almost” Bi-value Universal Grave.  Stephens agrees with Stuart on the resolution by confirming the candidate occurring three times in its row, column and box.

Continuing with Weeks 48,  the two NUR’s  yield:

S6=>(S2=>(S3=>(SW3, SW2), SE6), SE8=>SE2) .

Week 48 8-wingBy keeping the line marks updated through this, we come upon this 8-wing:

Week 48 SdC When we scan the chutes for Sue de Coq and APE, two live SdC turn up. In SdC NWr2 = 2(3+4)(6+8), the ALS 689 of r2c59 forces a 6-candidate from the row remainder, once we confirm the alternatives cannot be missing. Alternative (3+4) is easy, and implies the removal all by itself. The alternative (6+8) is difficult.  We use forcing chains from r2c9 to show that an SdC NWr2 of 342 forces two 8-clues in c4.

In SdC Wr4 = 9(1+8)(4+6), the row remainder ALS 346 locks in both alternatives. The bv 46 in the box remainder pairs with the (4+6) alternative, removing the 4-candidate.

This is as tough as Sue de Coq gets, but each step points the way to the next.  It’s not extreme.  Stephens skips the well known Sue de Coq and APE. Then when gridlock arrives, he turns to Nishio. More on that later.

Cranking up the bv map with two more bv from the SdCs, I am reminded of Stephens’ reluctance to pencil mark, because I’m sure the same reluctance carries over to aids like the bv map and the x-panels.  To each his own, but IMO, many solvers would enjoy expressing themselves sysudokulistically in PowerPoint graphics.  Maybe I should add a “how to” page on that, to show how easy it is.

Week 48 XYZAs an example, take a look at this. An ER aided 468-wing and a 13-link XY-chain bringing two toxic set removals.

In the 468-wing, the victim sees the hinge and the 68 bv easily, but requires an ER periscope, shown as a forcing chain, to see the 46 wing.  This goes way beyond Stephens’ definition of “related to”.  Paul fails to include ER and the forcing chain as a way of being related to, i.e. seeing, i.e. forming a weak link.  This failing is due, in part, to the position that  squares see each other.  Also, Paul’s readers are hindered by his inept definition of forcing chains, which is considered in my next post.

The maroon curve in the grid above may be  one of the XY-wings Paul previewed. It removes the same candidate as the 468-wing. The blue section of the long XY chain removes a 9-candidate to imply N9 and N6. The  green extension removes another to imply NE9 and NE2. The second removals are redundant, but illustrate how multiple toxic sets occur along XY chains.

Stephens readers should take in the sysudoku bv maps  for Week 48 at this point, shown below. The XYZ map is for easy recognition of XYZ-wings, WXYZ-wings, and Death Blossom light formations. The hinges for these formations are placed among bv that potentially support them, for a detailed check. The Week 48 map shows two tests for XYZ-wings, one successful.  As solving continues, the updated map reveals newly generated wings and blossoms.

Week 48 bv maps

The XY track is the path along which all XY chains travel. Notice how the tracks limit the direction of travel .  After drawing these curves, XY road kill are collected systematically along the tracks.

Week 48 collapse trFollowing up on the removals above, Week 48 collapses.  It is mortally wounded where the trace leaves off.

Next we parse Paul’s prognostication for Week 48, which was repeated at the end of my 3/16 post.  We will find out what he means by a “forcing chain”, a “conjugate pair chain”, and “colouring”.  We will also see a zombie version of the recently deceased Week 48.  Interested?

Posted in Advanced Solving Techniques, Reviews, Sudoku Toolware | Tagged , , , , , , | Leave a comment

Advanced Stephens


The review  reports how much of the Sysudoku Order of Battle Paul Stephens covers , and evaluates the explanations of advanced techniques in his two currently available books, Mastering Sudoku Week by Week, and Sudoku Addict’s Workbook.  This post is about his “advanced” techniques.

In Weeks, the school year has three semesters.  The first is about starting basic solving the introduction of candidates.  The second begins with candidate lists completed, and continues with locked sets,  box/line intersections, remote pairs and unique rectangles as “advanced”  techniques.  The wings, fish, “colouring” , and limited inference chains are third semester, “extreme” material.   Stephens’ ”colouring” is not what you might think it is.

In contrast, sysudoku regards locked sets as a basic tool, explicitly using them to filter candidates prior to advanced solving.  Sysudoku advanced solving includes the above and considerably more.  As to extreme,  I’m thinking the sysudoku extreme repertoire begins with Limited Pattern Overlay.   Sue de Coq, APE, and AIC and ALS methods, beyond Stephens’ extreme limits,  are quite reasonably considered to be  simply “advanced”.

As mentioned in the previous post, Stephens’ explanations  of techniques are obscured by a shift in paradigm across the Atlantic.  Sysudokies  think of candidates seeing each other, and links and chains as consisting of candidates.   Paul thinks of candidates as relating to (seeing) squares, and squares relating to (seeing) each other.  Paul defines “relating to” as belonging to the same area(unit).  Sysudokies include ER and forcing chain vision in “seeing”.  It’s hard to visualize squares relating to each other via ER and AIC.

The paradym clash continues into the advanced semester.  Paul considers a remote pair chain to be a series of squares related to each other, each containing only the same two numbers.  Alternating squares on the chain are labeled “A” and “B”.

Weeks remote pairHere is Paul’s example with sysudoku marking.  “A” cells are tinted blue and and “B”cells, green.  The same two numbers are 6 and 8.  A candidate of those two numbers can be eliminated from any square related to (seeing) both an “A” and a “B” square.  Believe it or not, that is Stephens’ full explanation.

Compared to this blog’s remote pair post, this treatment is a magic formula from a sudo-guru on the mountain.  There is no way to explain how it works without alternate inference chains, which Paul describes next semester in the extreme solving course.  Describes, but again, does not explain.

I think that, even to accurately describe the patterns to be recognized in an advanced technique, you need to clearly explain how it works on a candidate by candidate level.  Universal  logic concepts like strong and weak links and inference chains are fundamental to the explanation.   Paul fails to make the necessary investment in these concepts, and it shows.  I don’t believe that anyone should invest their time on hard Sudoku puzzles looking for patterns defined by guru, do you?

Stephens’ second “advanced” technique is the unique rectangle, which he chooses to calls the non unique rectangle, or NUR.  Paul makes a useful distinction between internal and external remedies for the deadly rectangle.  Internal remedies remove rectangle candidates from a rectangle corner, while external ones remove  candidates outside  the rectangle.

Paul recognizes two types of internal NUR.  His Type A (Weeks) or Type 1(Addicts) is the same as Andrew Stuart’s Type 1, having a single extra candidate in one of the corner cells.  Instead of confirming the extra candidate to remove the possibility of a deadly rectangle, Paul interprets the remedy as removing the two rectangle numbered corner candidates from the square of the extra candidate.  It’s the same thing, but I think it is an extra mental step to get to the point from there.

Weeks NUR BStephens’ Type B or Type 2 NUR  can have one or more extra candidates in both corners within a box, but with one of the rectangle numbers having no other candidates within the box.  In this case, number 9.  Since 9 must occupy one of the boxed corners, and an extra number 2 or 8 must occupy the other, 5, the other rectangle number, is removed from both corners.  This turns out to be a form of the unique pair in the Sudocue Guide, or Stuart’s type 4, presented in our UR post.

The only external NUR type presented in Weeks and Addicts removes the external candidate that sees the single extra candidate in the rectangle.  This is Stuart’s Type 2 and Sudocue’s unique side.  More NUR types are promised at Paul’s pages.

Do you get the idea that there are no standard names for unique rectangle formations? Yes, but the important part is recognize the rectangle, and then find the unique means of disturbing one of the bv corners.  In the blog since the Sheldon review, we have presented several external UR examples in which an external candidate is found guilty of forcing multiple extra candidates out of a UR roof, and pays the price.

Week 48 bmNext time, we review Paul Stephen’s “extreme” repertoire, and you can back me up on what I found in Week 48.  Box marking didn’t rate a trace, but here is the grid for line marking.  Two columns are 3f, but they succumb immediately.

My line marking trace reads:

3f: r9=>Sns9=>(SW9, N9m), c3, c7.

4f:r8=>np26, r3, c6, c9.

5f: r1, r2, r4, r6=>np28.   6f: r7=>np14.  7f: r5. Close: c1, c2, c4=>(Nbxl2, np89), c5, c8.

Here’s what Paul says we should find after listing candidates: “Gridlock can be broken with a Swordfish, two non-unique rectangles, two XY wings and a forcing chain – or a six-square conjugate pair chain that solves three squares instantly and leaves the rest solvable by simple methods.”

Oh, I forgot to mention that Paul calls slinks “conjugate pairs”, and his “conjugate pair chain” is a simple coloring cluster,i.e. no bv slinks.  In Stephens speak, a forcing chain is what we would call an X-chain almost nice, eliminating loop, i.e. an X-chain with toxic end candidates, plus a victim. That is a radically  narrow definition of the term.

Perhaps you will find all the above in Week 48. I’m still looking for some of them.

For the next post, let’s go for the bv scan on Week 48.

Posted in Advanced Solving Techniques, Reviews | Tagged , , , , | 2 Comments

Starting With Stephens


This begins a review of Paul Stephens’ solving recommendations and puzzles.  The review is based on Paul’s currently offered books,  Mastering Sudoku Week by Week, subtitled “52 steps to becoming a Sudoku wizard” , and his The Sudoku Addict’s Handbook.  His website is www.sudoku.paulspages.co.uk .

I start with Paul’s basic solving methods.  To his credit Stephens offers humanly practical advice for basic solving , good enough for easy puzzles, and possibly superior for solving contests.  It just does not pick enough of the low hanging fruit for the tough ones.  He searches for clues, rather than following a systematic basic solving process that uncovers them, as sysudokies do.

For comparison, here is the grid of the championship puzzle of the Akron–Summit Library Sudoku Contest, at the end of the Paul Stephens version of basic solving.  The listing of all remaining candidates lies ahead.

champ stephens basic

Paul starts puzzles with the more obvious box marking sweeps and line marking fills. All sweep actions he calls “cross hatches”.  Our double line exclusions  he calls “group hatching”.  He fills lines of one or two free cells only. Paul does include naked and hidden singles and pairs in basic solving, actually using the term “hidden”.  He calls locked sets “multis”. When he can avoid the term no longer, Stephens uses “exposed” in place of that other word.

Stephens’ basic solving, however, is for clues only, not slinks.  He does very little pencil marking until it is time to list all candidates.  He only writes in clues, until there is a two cell fill with two missing numbers,  or when he constructs a “multi” from memory, to fill more cells.  Do you do that?

Foregoing pencil marking is recommended as a healthful exercise for the short term memory.  Slink marking is foreign to Stephens.  Paul never acknowledges there are such things as strong links and weak links. He never explains the remote pair power of a strong link to exclude candidates from other units. Instead, you are to keep the “claim” on cells by a remembered slink in your head and use it in a “virtual cross hatch”.  Perhaps you will recall the slink to pair it with another in a naked pair? Thanks, but I’ll stick with slink marking.

In basic solving,  Paul does not move through the numbers 1 – 9, or try to capture every consequence of a new clue, or apply any other systematic structure in basic solving. Therefore, he is never at any identifiable stage of basic solving until he runs out of sweeps and fills, arriving in a state he calls “gridlock”.  Then, as in the grid above,  it is time for candidate listing, a prolonged interlude of preparation before advanced solving.

Sysudoku readers face other oceanic hurdles in translating Stephens.  Cells are “squares”, units are “areas”, sweeps are “claims”.  Paul has no words for strong links, just the “two candidates in a unit” definition.  The last free cell in an “area” (a unit) is a “free gift”.

Indirectness  also clouds Stephens’ explanations of advanced techniques, as we will see later. Candidates “are related to” squares, rather than seeing other candidates.  The fundamental logical properties of strong and weak links, toxic sets, inference chains  are never explained,  perhaps because the necessary vocabulary is never developed in Stephens’ books.

For all that, Paul Stephens may be worth translating for some.  Stephens’ basic solving can be an alternative way of starting on puzzles expected to be easy.  His basic approach is particularly well suited to timed contests where scoring is based entirely on the number of correct cells, and without penalty for incorrect ones.  In fact, Paul gives expected expert solving times to compare with yours.

Getting down to specifics, let’s first consider how far Paul gets with your sysudokie homework puzzle Week 12.  Here is the checkpoint trace, showing that the puzzle does fall in box marking, but not without considerable resistance. Progress is slowed on this puzzle by the comparatively rigid tracing rules adopted in sysudoku to make checkpoint comparisons possible.

ByWeek 12 sysudoku trace

Now for the Stephens version.  You can try it first, using only clues and two-fill rows and boxes, , or just follow the trace below.  If you already have Mastering Week by Week, the trace follows Paul’s verbal description of page 59.

For Stephens fans who may be visiting the blog for the first time, our trace is read by adding clues to a fresh puzzle as you go.  The trace lists the clues placed by boxes named for compass points.  Your puzzle state tells you the clue number, and you, the reader provide the reason why this clue can be added.  The effects of a clue placement are listed below it on the next line. Post the listed effects first, then treat each effect, left to right as a cause, generating all of its effects below it, before coming back to the next cause on the list.  So you proceed all the way down on a slant, then hop up to the first unfinished list of effects for the next ski run.

ByWeek 12 Stephen trace

Stephens basic carries the day for Week 12. Comparing the two traces, we see a shorter, and what seems to be a more straightforward route to the solution in the Stephens trace.  But if you actually follow the trace, and observe the logic of each step, you realize the economy is in writing, but not in thinking.

champ stephens traceIn timed contests, how typical is it for Stephens basic to go all the way?  Participants in the Akron contest can try it out on the earlier stage puzzles they brought home.  The grid appeared earlier.  Here is the Stephens’basic trace leading up to it.  Paul gridlocks with a lot of puzzle to cover.

To the clues Stephens’ basic solving finds in the Akron championship puzzle, I have added,  in sysudokie pencil marks, the fill strings constructed mentally in the line fills, and the candidate pairs that Stephens would find in basic solving.  This brings the puzzle to the next stage, Stephens’ “candidate listing”, the marking of each unassigned cell with its candidates.

Stephens titles the chapter on candidate listing “Through the Pain Barrier”, and for good reason.  He has not developed box slink candidates and collected the clues they generate in box marking. And not having the efficient and complementary process of line marking to find remaining candidates, Paul must go to number scanning.

Paul writes simple lists in ascending order for pencil marks, crossing out candidates as solving continues.  Two methods of building the lists are suggested.  One is the cell by cell number scan, the inefficient default of most writers.  His box  by box number scanning could save some time as the same list of missing candidates is compared to sweeping rows of each box cell, but Stephens doesn’t recommend jotting the list down.

Paul waits until candidate listing is done before considering “multis”, the locked sets of more than two numbers.  Most advanced writers consider them part of basic solving. In Sysudoku, naked subsets are encountered in box marking, and line marking picks up hidden subsets as candidate sets are completed in boxes and lines.

While writing this post, I’ve been trying out Stephens basic on the early week 1- and 2- star Dave Green puzzles I get in the Akron Beacon Journal.  Beyond that, it just doesn’t work for me.  I keep thinking,  why am I not writing down the slinks I’m uncovering for virtual and group cross hatches?  I get enough mental exercise working on tough and nasty puzzles.

It strikes me also, that another reason why Stephens pervasively jangles my sysudokie nerves is his search for a pattern to derive a particular clue, or solve an “area”.  What does this leave out?  The sysudoku modus operandi is to enumerate all patterns of each type, harvesting all the solving benefits, and returning only as candidate eliminations produce more patterns of this type.

Week 48Next time, we hop over to The Sudoku Addict’s Workbook to analyze Stephens repertoire of advanced techniques.  Addict’s Workbook has a nice summary of these, with interesting examples.  Yes I bought both books, and you should, too. I’ll review Stephen’s “extreme” puzzles from them soon.  Meanwhile, you can back me up by solving an extreme review puzzle, Week 48. Let’s converge on sysudoku box and  line marking for next week. Yes, I said sysudoku BM & LM.

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

KrazyDad Super Coloring


This post follows the systematic dismantling of review puzzle SuperTough volume 5, book 8, #5, as it demonstrates the crushing logical power of Medusa coloring.  This completes the Sysudoku review of the excellent Super Tough collection found on http://krazydad.com.

SupT 5 8 5 LMHere is the checkpoint grid on the line marking. The trace reads:

3f: c7.  4f: r3, r8.  5f: r2, c3, c8.  6f:r9.  7f:r1.

Close: c1, c2, c9.

I found no SdC , APE or XYZ  wings,  but  the XY curve network revealed .  .  .

SupT 5 8 5 XY nice loop

a nice loop XY-chain (blue). Every pair of adjacent candidates in a nice loop is a toxic set, and six 3-candidates left for the coast at the very sight of this one.  Another small XY ANL in red removes a  6-candidate.

The new bv bring no bonus profits, and the X-panel comes up dry, so its on to coloring.

The nice loop also makes up the base for a large blue/green SupT 5 8 5 color trapcluster, and we get the first color trap right away. It’s a not so obvious trap in r1.  The victim 1-candidate is so unfortunate as to be seen by a green 1-candidate, while in the same cell with a blue candidate. Blue or green, it has to clean out its desk and leave the premises.

SupT 5 8 5 2nd clusterThis departure only extends the blue/green cluster by one cell, but there are plenty of slinks and bv left for another cluster.  I can even start one which shares numbers with the first cluster. I’m immediately rewarded with  some decisive bridging logic.

Cell r9c8 and the c8 1-candidates assert  A: not (blue and orange) => green or red.

Four candidates see both green and red, and resign immediately. And there is more.

In c1 green and red 1-candidates see each other, invoking another toxic color pairing. The logic is:

B: not(green and red) => blue or orange.

No candidates fall into this trap, but combining this with assertion A brings about a merger of the clusters, because

by A:    orange => not red => green    and   by B:    red =>not orange =>blue.

Similarly,  by B:     green => not blue => orange   and   by A:    blue => not green =>red,

so    orange is green    and    red is blue.    Mergeration!

SupT 5 8 5 mergedRecoloring the merged clusters, we can start another, tan / aqua, on the 5/7/8 bv in the west grid. Two color conflicts emerge.  The 9-candidates in r8 produce

not (blue and aqua) =  green or tan.

Cell r1c3 shows

not (green and aqua) = blue or tan.

This is a color wrap, because, distributively speaking,

(green or tan) and (blue or tan) => (green or blue) and tan => (absolute certainty) and tan => tan already!

Green and tan forces multiple 2’s in c9 and the SE box, so the true colors must be tan and blue, with very little marking left to reach a color coded solution.

SupT 5 8 5 solutionTo conclude, I can say that I am amazed at the logical trophies of advanced solving in this very small sample of the Super Tough collection.  The puzzles are wonderful  for  sysudokie sleuthing.  Based on my review sample , the Super Toughs grade a notch more advanced than Longo’s  Absolutely Nasty Level 4 on the Systematic Sudoku Order of Battle.  Both are great collections.

ByWeek 12Next we look at the current books of the very popular Paul Stephens.

The sysudokie homework is the box marking of puzzle 12 from Paul’s Mastering Sudoku Week by Week.  This puzzle provides insight into Paul’s approach to basic solving.

Posted in Advanced Solving Techniques, Reviews | Tagged , , , , , , | 2 Comments