Here is the thought process: If you are looking at the puzzle, saying 'at least one is true' is more general than 'exactly one is true'. In order to really advance with forbidding chains, the definition I give here for strong links is the only correct one. we are not interested in only native strong links. It may be the case that Native Strong Links are always also weak, but. This is a common misinterpretation, spread all over the web. Puzzle coordinate system used here can be found at theĪbsolutely positively do not, ever, think of a strong link as exactly one is true.Other sudoku sites may needlessly restrict the definition of.In most forbidding matrices, each row is a strong set.
A set that is both strong and weak contains exactly one truth. Strong and weak are not mutually exclusive properties. (A forbids B) is equivalent to (A - B), and therefor also (B forbids A). The operators, = and -, are not dependent on order. Native strong links are dependent upon the possibility matrix. Native weak links are independent of the possibility matrix. More generally, a forbiddingĬhain that uses one or more ntuples as a Boolean variable. Uses a weak linkīetween them (relative location) to deduce strength. Deduces strength of one of those candidates in location Y wing style Looks at 3 native strengths of any type to deduce strength(s) of any type Forbidding Chains Looks at any number of strengths of any type to deduce strength(s) of any type Advanced Forbidding Chains A forbidding chain that uses a technique as a Boolean variable Almost Locked Sets In most locations, considers two sets with 1 degree of freedom each. That candidate in location Y wings Looks at strength of 3 cells containing exactly 2 candidates each. In location to deduce strength of any type Coloring Looks at strength of one type of candidate in location to deduce strength of Of that candidate in N columns(location) OR vice versa Unique Rectangles Looks at potential symmetrical overlapping strength of candidates Xwings, Swordfish, Jellyfish, Squirmbags Looks at strength of one type of candidate in N rows(location) to deduce strength Looks at strength of N candidates in N locations within a large container(s) toĭeduce strength of those N candidates in N cells Looks at strength of N candidates in N cells to deduce strength of those NĬandidates in N locations within a large container(s) To deduce strength of that candidate in location Technique definitions Unique Possibilities Finds singular strengths in any container Locked Candidates Looks at strength in location of one type of candidate in one large container A candidate with 3 or more possible locations within a house. A cell with 3 or more possible canidates. Set (strong inference set) that has more than one possible distinct partition. One native strong set Subscripts Used within forbidding chains to help clarify the partioning of a native strong Usually, Used in forbidding chains to contain a Boolean variable that partitions more than General definitions Almost Locked Set A set in a common large container with 1 degree of freedom Boolean variable Any statement limited to two values. 
This page, like the interstate highway system, is always under construction. This page is nothing but a reference page for the sudoku blog.
0 kommentar(er)
