I was surpised to find Bowman's Bingo came up with an incredibly short and simple double implication chain from r5c2:ī) r5c2=9 => r4c19 => r4c1=1 => r2c1 1 => r2c1=8 So I checked it out with Susser to see if that was just me or if all that was left was tabling and Bowman's Bingo (which lets me off the hook). Pathways of the Eppstein variety even after augmenting it with weak links to bivalue cells. I drew the bivalue/bilocation diagram but found no cycles or conflicting The original candidate grid isĬode: Select all Involves a "net" rather than a chain - diagrammatically something likeĪ smaller deductive net with "key" cell (9,7), involving about half as many cells, is as follows. Perhaps I should have posted this under txlefs original topic or even the re-run of the original topic - Big Brother might like to move it to leave Jeff's thesis in splendid isolation. Sorry about the errors transposing - it was getting late - I have edited them on the original (just for the sake of anyone who might try to follow my line of thinking!) The second grid : As r5c3 =3 => r5c3 2 => a triple & a naked pr in box 4 Could you list the two grids at which these chains were forced? How does the chain propagate from r8c8 to r3c2? The grid has a naked pair 17 in row 3 c18 => r3c2=8Ħ. Original grid - (you thought I put txlef's extra 7 in didn't you!)ģ. My sincere gratitude to Angus who has been sharing his excellent Simple Sudoku solver, which has taken a lot of painstaking hard work out of sudoku, enabling me to concentrate in applying more advanced techniques to difficult puzzles.ġ. The node must be bivalue between 2 consecutive broken lines. Solid line on diagram => link with strong inference, also indicated as '=x=' in nice loop notation.īroken line on diagram => link with weak inference, also indicated as '-x-' in nice loop notation. You may like to construct the entire b/b plot and identify it as an exercise. There is one other continuous chain in this grid, which would enable 3 candidates to be removed. This double implication chain is shown as a simple nice loop in the following diagram. You may like to construct the entire b/b plot and identify it as an exercise.Ĭhain 3: =6=5=-5-=5=8=-8- => r3c68 You may like to construct the entire b/b plot and identify them as an exercise.Ĭhain 2: =3=-3-8-=8=2=4=5=-5-8- => r9c28 Using Angus' simple sudoku solver till no more hint is available, the original grid was reduced to:Ĭhain 1: =6=-6-=6=5=-5-=5=-5-7- => r6c87 All other links in the b/b plot were omitted for clarity. The following diagrams only show relevant links related to each simple nice loop being discussed. To solve this grid, a total of 4 simple nice loops are required and they were identified by means of a bilocation/bivalue plot. Need some advice on how to proceed without t&e please:
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |