| eastie
| Joined: 01 May 2006 | Posts: 2 | : | | Items |
|
Posted: Wed May 03, 2006 8:44 pm Post subject: Locked Candidates ? |
|
|
Hello everyone, I have been playing Sudoku for a few weeks now, I have a lot of Michael Mepham's books, and I have progressed through them fairly well.
I came across this website and I perused around until I found Ruud's post that has websites describing all the different strategies that people use to solve Sudoku puzzles. I recognized many of the patterns I use all the time in solving Sudoku on the website I looked at.
I felt pretty good about myself because I had been reading peoples' posts and seeing suggestions like "hidden singles" and other things with cool names. I realized that I had been using those strategies all along, but I didn't know they had specific names.
So my question came to me when I read the description of locked candidates. The technique reminded me of something I read about on Wikipedia called "contingencies".
Quote: | Wikipedia: Advanced solvers look for "contingencies" while scanning—that is, narrowing a numeral's location within a row, column, or region to two or three cells. When those cells all lie within the same row (or column) and region, they can be used for elimination purposes during cross-hatching and counting |
I guess my question is are these the same thing? Or am I missing something in either definition?
Thanks,
John |
|
| Ruud Site Admin
| Joined: 17 Sep 2005 | Posts: 708 | : | Location: Netherlands | Items |
|
Posted: Wed May 03, 2006 9:39 pm Post subject: |
|
|
Hi eastie,
in Sudoku, the single most reinvented technique is "locked candidates".
The "contingencies" description in Wikipedia is one version.
This technique is known by the following names (and more)
Locked candidates (1 & 2)
Pointing pairs
Line-box interactions
Line-box reductions
Block-block
Rowcol-block
Ruud. _________________ Meet me at sudocue.net |
|