Search results

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

Page title matches

• Locked Candidates
  ...de the intersection with another house, we can [[eliminate]] the remaining candidates from the second house outside the intersection. ...''X''' in a box are confined to a single line (row or column). The surplus candidates are eliminated from the part of the line that does not intersect with this
  3 KB (428 words) - 18:59, 31 May 2020

Page text matches

• Locked Pair
  A '''Locked Pair''' is a [[Naked Pair]] where both [[cell]]s are locked in a single [[intersection]]. ...of these houses, the same eliminations can also be made with the [[Locked Candidates]] technique.
  459 bytes (75 words) - 19:15, 3 June 2020
• Pointing Triple
  #REDIRECT [[Locked Candidates]]
  31 bytes (3 words) - 03:00, 20 January 2022
• Almost Locked Set
  ...'''N+1''' [[digit]]s. In other words, it is one cell short from being a [[locked set]]. The simplest '''ALS''' is a single cell with 2 candidates. In a standard Sudoku an ALS can have a maximum size of 8 cells with 9 digi
  1 KB (175 words) - 01:05, 4 June 2020
• Sashimi Swordfish
  ...are located on one of the 3 columns. A Sashimi Swordfish does not have any candidates in the extra box which are located on the intersection of a defining row an Either one of the '''X''' candidates in box 8 can be present. If there were a candidate in '''r8c5''', this woul
  2 KB (388 words) - 04:01, 4 June 2020
• ALS-XZ
  The '''ALS-XZ''' rule is a [[solving technique]] that uses two [[Almost Locked Set]]s. It is the easiest of the ALS techniques, but still a technique that Make sure you understand the concept of [[Almost Locked Set]]s before you proceed.
  3 KB (512 words) - 01:07, 4 June 2020
• Subset
  Alternative terms are '''disjoint subset''', '''locked set''' and '''number chain'''. : N cells with candidates for only N digits.
  1 KB (186 words) - 19:19, 3 June 2020
• Single-digit
  All [[single]]s, [[Locked Candidates]] and [[fish]] belong to this category. ...a computer program is used, it can often highlight the cells which contain candidates for a specific digit. Patterns are much easier to spot in the highlighed ce
  609 bytes (91 words) - 18:56, 31 May 2020
• Naked Subset
  ...s more difficult to recognize, because not all three cells need to contain candidates for all three digits. Subsequently, a naked quad is even more difficult to ...ntersecting houses. A size 2 is called a [[Locked Pair]] and size 3 is a [[Locked Triple]].
  1 KB (229 words) - 19:18, 3 June 2020
• Death Blossom
  ...em'' [[cell]] of N [[candidate]]s that sees N ''petals'', each an [[Almost Locked Set]]. ...s (see [[Subset Exclusion]]), with most of the cells belonging to [[Almost Locked Set]]s.
  3 KB (496 words) - 01:11, 4 June 2020
• Strong link
  ...present in [[bivalue]] [[cell]]s, in [[bilocal]] [[unit]]s and in [[Almost Locked Set]]s. For candidates '''A''' and '''B''' which have a strong link, we can make the following log
  504 bytes (84 words) - 20:14, 31 May 2020
• Pointing Pair
  ...de the intersection with another house, we can [[eliminate]] the remaining candidates from the second house outside the intersection. ...''X''' in a box are confined to a single line (row or column). The surplus candidates are eliminated from the part of the line that does not intersect with this
  3 KB (426 words) - 19:53, 31 May 2020
• Line-Box Interaction
  ...de the intersection with another house, we can [[eliminate]] the remaining candidates from the second house outside the intersection. ...''X''' in a box are confined to a single line (row or column). The surplus candidates are eliminated from the part of the line that does not intersect with this
  3 KB (428 words) - 05:26, 31 May 2020
• Locked Candidates
  ...de the intersection with another house, we can [[eliminate]] the remaining candidates from the second house outside the intersection. ...''X''' in a box are confined to a single line (row or column). The surplus candidates are eliminated from the part of the line that does not intersect with this
  3 KB (428 words) - 18:59, 31 May 2020
• Fish and Subsets
  == Trawling for Fish Using Locked Sets == ...lyfish, Squirmbag) can be made easier by mapping the fish problem onto a [[Locked Set]] problem. Here is the procedure for analyzing a row-based Swordfish:
  6 KB (764 words) - 19:20, 3 June 2020
• X-Wing
  ...rows will also complete these columns. As a result, you may eliminate all candidates for this particular digit from these columns which are not located in the d ...2 rows. In both cases, columns 2 and 8 will each be covered. The remaining candidates in these 2 columns can be eliminated. They have been marked with a red aste
  2 KB (320 words) - 03:31, 4 June 2020
• Common Peer Elimination
  Note: This technique is a superset of the classical technique [[Locked Candidates]]. * [[Locked Candidates]]
  2 KB (293 words) - 02:50, 20 January 2022
• Jellyfish
  ...[digit]] in 4 rows are located in only 4 columns, we can [[eliminate]] all candidates from those 4 columns which are not located on those 4 rows. ...4 candidates for the selected digit. Each row can contain between 2 and 4 candidates.
  2 KB (268 words) - 03:47, 4 June 2020
• Pattern
  * [[Locked Candidates]]
  981 bytes (136 words) - 03:38, 4 June 2020
• SSTS
  * [[Locked Candidates]]
  719 bytes (89 words) - 03:00, 4 June 2020
• ALS-XY-Wing
  ...'''ALS-XY-Wing''' rule is a [[solving technique]] that uses three [[Almost Locked Set]]s. Make sure you understand the concept of [[Almost Locked Set]]s (ALSs) before you proceed.
  3 KB (523 words) - 01:09, 4 June 2020

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