Search results
From Sudopedia
Jump to navigationJump to searchCreate the page "Almost Locked Candidates" on this wiki! See also the search results found.
Page title matches
- ...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 this3 KB (428 words) - 18:59, 31 May 2020
Page text matches
- 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
- #REDIRECT [[Locked Candidates]]31 bytes (3 words) - 03:00, 20 January 2022
- ...'''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 digi1 KB (175 words) - 01:05, 4 June 2020
- ...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 woul2 KB (388 words) - 04:01, 4 June 2020
- 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
- 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
- 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 ce609 bytes (91 words) - 18:56, 31 May 2020
- ...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
- ...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
- ...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 log504 bytes (84 words) - 20:14, 31 May 2020
- ...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 this3 KB (426 words) - 19:53, 31 May 2020
- ...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 this3 KB (428 words) - 05:26, 31 May 2020
- ...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 this3 KB (428 words) - 18:59, 31 May 2020
- == 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
- ...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 aste2 KB (320 words) - 03:31, 4 June 2020
- Note: This technique is a superset of the classical technique [[Locked Candidates]]. * [[Locked Candidates]]2 KB (293 words) - 02:50, 20 January 2022
- ...[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
- * [[Locked Candidates]]981 bytes (136 words) - 03:38, 4 June 2020
- * [[Locked Candidates]]719 bytes (89 words) - 03:00, 4 June 2020
- ...'''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
- ...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
- ...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''' f1 KB (161 words) - 03:24, 20 January 2022
- ...'''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
- ; [[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
- ; [[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
- ; [[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
- ; [[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
- ...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 b3 KB (448 words) - 01:04, 4 June 2020
- ...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
- ...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
- ; [[Almost Locked Set]] : A set of '''N''' cells with candidates for '''N+1''' digits.19 KB (2,734 words) - 02:19, 19 December 2022
- 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 sc3 KB (441 words) - 05:11, 31 May 2020
