almost nice loop – a alternative logic chain closed by one extra wink or slink.
ALS – an almost locked set – a set of cells of the same unit with one extra number, becoming locked if one number is removed.
ALS node – An ALS functioning as an AIC node
AIC – an alternating inference chain – a chain of slinks and winks, with slinks on each end
ANL removal – removal of the candidate between winks in an almost nice loop. The enclosing winks can be omitted, and the removed candidate is said to “see” the toxic slink ends of the remaining AIC.
ANL confirmation – promotion of the candidate between slinks of an almost nice loop to a clue.
BARN – bent almost restricted n-set. n cells containing n numbers in an overlapping box and line, with candidates of all but one of the numbers seeing each other.
BNS-0 – bent naked N-set, n cells containing n numbers in an overlapping box and line, with no common numbers outside the intersection. Candidates of each number form a toxic set.
BNS-1 – same as BNS-0, but with a single common number in remainders outside the intersection. The remainder candidates of the common number are a toxic set.
box/line – box/line restriction or box/line reduction: A removal pattern in which the candidates of a line are confined to a single box.
bv – a binary value cell or a set of binary value cells.
bv slink – the internal slink of a binary value cell.
chute – The intersection of a line and a box.
cluster – a network of slink partners marked by two colors.
coloring – Medusa coloring: the removal method of defining slink clusters supported by bv slinks.
cover – A set of candidates that see each other, and may contain a true candidates.
cover set – A set of covers that include all candidates of a set of truths. See rank theory.
dublex – double line exclusion: Use of markings in two lines for marking the remaining chute of a third box.
dublex bypass – a preliminary scan in box marking to mark clues and naked pairs, reducing the free cells before slink marking.
ER – a form of weak link involving an Empty Rectangle box pattern, not a pattern completed by an ER wink.
ER wink – a wink defined by an ER inference chain, i.e. a forcing chain.
exocet – a pattern of four cells containing the same 3 or 4 candidates, and others to be eliminated by trial.
forcing chain – an alternating inference chain starting with a weak link, it extends “seeing” across the grid in many methods.
hidden dublex – A box/line pattern in which marking of the third box is forced by marks, not clues.
kraken victim – A removal by a finned fish outside of the box containing the fin.
krakening a finned fish – determining a wink path between fin and kraken victim,
allowing the victim to be removed.
line – a row or a column.
LPO – Limited Pattern Overlay: A set of pattern overlay methods reducing possible patterns of a number
mark – A pencil mark. A small number representing the presence of a candidate in a cell.
marking – marks or a clue.
marks – two marks representing a slink in a unit.
Medusa coloring – a method of marking a net of strong links, including internal bv slinks
nice loop – a closed alternating inference chain. End candidates of every link are toxic sets. Alternate node coloring creates a cluster with one color representing clockwise traversal, and the other representing counterclockwise.
pattern slicing – The division of patterns into disjoint sets based on slink partners they include.
pink/olive analysis – The coloring of candidates based on membership in pattern slices.
SLG – a set/link diagram. “Sets” base sets, “links” are cover sets. A set/cover diagram, usually computer generated, showing removals. See Rank’s Little Gotcha.
slink – strong link: a link between candidates in which at least one partner is true. A slink is represented by a solid curve.
slink marking – The sysudoku pencil marking that limits initial candidate marking to slink partners or aligned triple marks filling chutes, and places marks within the cell to distinquish box slinks, line slinks and unslinked candidates.
suset – a pair of numbers in the suset enumeration scratchpad algorithm.
suset enumeration scratchpad – a hand calculation algorithm for enumerating almost locked sets in Sudoku. Developed in Sysudoku and applied to finned and regular fish, ALS and locked sets.
toxic set – a set of candidates determined by a pattern to have at least one true candidate. A candidate seeing the whole set can be removed.
trace – A recording of solving events . See the Sysudoku Trace page.
trial – A true or false test of a set of logically related candidates, trial-and-error – a Sudoku term generally applied to trying out guesses, i.e. assertions not derived logically from existing candidates.
trial trace – A trace for identifying a contradiction in the shortest chains of inferences.
true candidate – A candidate that is in the solution.
truth – a set of candidates seeing each other and known to contain at least one true candidate.
truth net – a network of candidates that are true under a single assumption.
unit – a box, row or column.
wink – weak link: a link between candidates in which both partners cannot be true. When one is proved true, the other is false.
X-chain – a single number chain of alternate weak and strong links.
X-panel – a single value chart for the remaining candidates of each number, without clues.