Search results

Create the page "Almost Locked Candidates" on this wiki! See also the search results found.

• Chain
  ...an [[XY-Chain]]. This type of chain is limited to cells which only have 2 candidates left. Although it is customary to name the digits involved, a reader, given ...ell it started with, the chain becomes a [[loop]], even when two different candidates are involved. A loop that operates in both directions is a [[Nice Loop]].
  2 KB (364 words) - 00:19, 1 June 2020
• BUG Lite
  ...the two green candidates must be true. Furthermore, since digit '''6''' is locked in the intersection of column 1 and box 7, we can eliminate digit '''9''' f
  1 KB (161 words) - 03:24, 20 January 2022
• Swordfish
  ...'''X''' in 3 rows are located in only 3 columns, we can [[eliminate]] all candidates for digit '''X''' from those 3 columns except those located on the defining ...must be located in these 3 rows. This allows us to eliminate the remaining candidates in these 3 columns.
  3 KB (421 words) - 19:23, 3 June 2020
• Solving technique
  ; [[Locked Candidates]] | Intersection Removal | Line-Box Interaction | Pointing (Pair, Triple) | : [[Candidate]]s are locked in the [[intersection]] of a [[line]] and a [[box]].
  10 KB (1,408 words) - 04:40, 31 May 2020
• Solving Techniques
  ; [[Locked Candidates]] | Intersection Removal | Line-Box Interaction | Pointing (Pair, Triple) | : [[Candidate]]s are locked in the [[intersection]] of a [[line]] and a [[box]].
  10 KB (1,407 words) - 05:07, 31 May 2020
• Techniques
  ; [[Locked Candidates]] | Intersection Removal | Line-Box Interaction | Pointing (Pair, Triple) | : [[Candidate]]s are locked in the [[intersection]] of a [[line]] and a [[box]].
  10 KB (1,407 words) - 05:23, 31 May 2020
• Solving Technique
  ; [[Locked Candidates]] | Intersection Removal | Line-Box Interaction | Pointing (Pair, Triple) | : [[Candidate]]s are locked in the [[intersection]] of a [[line]] and a [[box]].
  10 KB (1,369 words) - 21:31, 20 August 2022
• Inference
  ...the term '''almost''' in their name. A well known example is the [[Almost Locked Set]]. For two candidates, named '''A''' and '''B''', the following strong inference deductions can b
  3 KB (448 words) - 01:04, 4 June 2020
• Cage combinations
  ...ble to apply the [[Locked Candidates]] technique. Further, if a cell whose candidates are 8 and 9 sees all 4 cells, we may be able to apply the [[Killer Subset]] * Cell A has candidates 3, 4, 5.
  2 KB (378 words) - 19:02, 31 May 2020
• Subset Exclusion
  ...where all but one of the cells to be enumerated falls neatly into [[Almost Locked Set]]s.
  1 KB (190 words) - 01:17, 4 June 2020
• Terminology
  ; [[Almost Locked Set]] : A set of '''N''' cells with candidates for '''N+1''' digits.
  19 KB (2,734 words) - 02:19, 19 December 2022
• Scanning
  This really simplifies the way we can look at candidates within a floor. With 1 digit placed within the floor, only 2 configurations ...g this way, you can skip the part of this Sudopedia that explains [[Locked Candidates]]. They are already taken into account when you consistently follow this sc
  3 KB (441 words) - 05:11, 31 May 2020

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)