7. Glossary and Abbreviations#
https://www.sudocue.net/glossary.php and http://sudopedia.enjoysudoku.com/Terminology.html
- AI#
Abbreviation for Alternating Inference.
- AIC#
Abbreviation for Alternating Inference Chain.
- AIL#
Abbreviation for Alternating Inference Loop.
- AIN#
Abbreviation for Alternating Inference Net.
- Alternating Inference#
A pattern where adjacent links between nodes alternate strong and weak.
- Alternating Inference Chain#
A Chain linking Nodes with alternating Strong Links and Weak Links.
- Alternating Inference Loop#
An Alternating Inference Chain that loops back on itself.
- Alternating Inference Net#
A network of Nodes where the Links at consecutive net levels alternate.
- Band#
See Chute.
- Base Set#
A Base Set is a Set of one or more Ccells in a Chouse forming a Truth.
- BEQ#
Abbreviation of Bent Exposed Quad
- Bent Exposed Quad#
A pattern comprising four Candidates in four Cells spanning two Intersecting Houses, where only one Unrestricted Candidate exists.
- Bi-value Cell#
A cell on a Sudoku board containing only 2 candidate values. A Strong Link exists between these two candidates in that cell.
- Block#
See Box.
- Board#
A solved, filled or completed puzzle.
- Box#
A 3x3 Grid. A Sudoku Grid is made up of 9 boxes, 3 accross, 3 down. Also known as a Block.
- Buddy#
See Peer.
- Candidate#
A possible solved value for an unsolved cell. This definition is only a reference to the candidate value, not to any Cell location on the Grid.
- Ccell#
A three-dimensional tuple uniquely identifying a candidate element by value, row, and column in a Sudoku Grid.
- Cell#
A location in a Sudoku grid which either contains a :term”Given or into which a Solved Value is placed.
- Chain Patterns#
The collective noun for Chain, Net and Loop patterns, typically referring to Alternating Inference Chains
- Chain#
A shortening of the term Inference Chain, a stream of inference links connecting Ccells to each other.
- Chouse#
- Chute#
A grouping of three Boxes in a row or a column. Three boxes in a row is a Floor. Three boxes in a column is a Tower. Also known as a Band.
- Column#
A vertical line of 9 cells in a Sudoku Grid.
- Conditional Logic#
The process of asserting a Premise and following a sequence of inferences to a possible logical outcome. See Premises and Inferences.
- Conjugate Pair#
The only two same value candidates in a house forming a Strong Link. This is a reference to the candidates not the links between them – a subtle distinction.
- Cover Set#
A Cover Set is a Set of all the Ccells that See each other in the Chouse of a Link Set.
- Eliminations#
Removing Ccells in puzzles that have been determined impossible to be True.
- EMOP#
Abbreviation of Equal Multi Order Pattern.
- End Node#
In an AI-Chain of Nodes, the End Nodes mark the start and end of Chain.
- Equal Multi Order Pattern#
(abr: EMOP) A Pattern with ‘n’ Base Sets and ‘n’ or more Link Sets where one or more groupings of ‘n’ Link Sets intersects as all Base Set Ccells.
- Fin#
- Floor#
A row oriented Chute.
- GMOP#
Abbreviation of Greater Multi Order Pattern.
- Greater Multi Order Pattern#
(abr: GMOP) A pattern with ‘n’ Base Sets and needing ‘n + r’ Link Sets to Intersect all the Base Set Ccells. EMOPs are a special case of GMOPs where ‘r’ = 0.
- Given#
An initially placed value on a Sudoku Puzzle. It is the Given placements that make the puzzle.
- Grid#
9x9 grid, subdivided into 9 – 3x3 Boxes (Blocks) on to which Sudoku puzzles are spatially represented.
- Group#
See House.
- House#
A specific 9 cell of a Row, column or Box. Also known as a Group, Sector or Unit.
- Inference Chain#
A stream of inference links connecting Ccells to each other.
- Interior Node#
In an AI-Chain of Nodes, the Interior Nodes lie between the End Nodes.
- Intersection#
- Line#
- Link#
A logical relationship between two Nodes (Ccells). The logical relationship can be one of a Weak Link, a Strong Link or a Robust Link. See Premises and Inferences
- Link Set#
A Set of one or more Ccells in a non-Base Set Chouse that are in any Base Set.
- MOP#
Abreviation of Multi Order Pattern.
- Multi Order Pattern#
Abr: MOP. A Pattern with multiple Base Sets Intersected by multiple Link Sets. There are Lesser, Equal and Greater MOPS depending on the nature of Link Set intersections. See Multi Order Patterns.
- Loop#
- Node#
A Ccell that is linked by Conditional Logic to other nodes in a pattern.
- Overlap#
- Parity#
The collective pronoun for the terms Odd and Even, which are the parity of the sequence numbers assigned to a SLN or SLC.
In an SLC, applying the premise that one end is True, consecutive nodes will alternate True / False until the chain end is reached. Similarly, applying the premise that that end is False, consecutive nodes will alternate False / True until the chain end is reached.
In an SLN, applying the premise that the root is True, nodes at consecutive node levels will alternate True / False through to all the leaves. Similarly, applying the premise that the root is False, nodes at consecutive node levels will alternate False / True through to all the leaves.
Therefore, in either an SLC or SLN, adjacent Nodes alternate in State. Although the State of a Node may not be known, its neighbours will always have opposing State. Consecutively numbering the Nodes in an SLC or Node levels in an SLN, the numbers, and hence the Nodes will either have Odd or Even parity.
Parity (Odd or Even) is used to represent State where the actual State value (True or False) is not known. All Nodes in an SLN with the same Parity will have the same State, even though the actual value of that State is yet to be determined.
- Pattern#
An arrangement of Ccells that have the potential of yielding eliminations or placements
- Pattern Cell#
Reference to a Cell containing Candidates belonging to a pattern
- PE#
A Abbreviation of Potential Elimination, loosely synonymous with Ccell.
- Peer#
A Ccell that can See other Ccells. Peers are a set of Ccells that see each other.
- Placement#
Placing of a single solved value in a Cell.
- Pincer#
A Cell containing Candidates outside the Intersection of two Lines, a Row, and a Column. Referred to with Pivot.
- Pivot#
A Cell containing Candidates in the Intersection of two Lines, a Row, and a Column. Reffered to with Pincer.
- Potential Elimination#
A reference to a Candidate that is an element of the solution set of Candidates in that Cell. Through the application of Conditional Logic Potential Eliminations are removed from this set until the last value remains as the solution for that Cell.
- Puzzle#
A partially completed Sudoku in a puzzle, it may only be populated with the givens or with givens and some solved values.
- Restricted Candidate#
In a Bent Exposed Subset, a Restricted Candidate is a Candidate that Sees all instances of its value in the Bent Subset grouping. This is a special case of a Restricted Candidate Set (Nearly Locked Sets) with a single member.
- Restricted Candidate Set#
In Nearly Locked Sets, a Restricted Candidate Set is that set of Candidates that can See all instances of its value in the Unlocked Sets pattern.
- Robust Link#
An inference between two Ccells at the ends of a Strongly Ended Alternating Inference Chain. Neither end can be simultaneously False, and at least one end is always True
- Row#
A horizontal line of 9 cells in a Sudoku Grid.
- SE-AIC#
Strong Link Ended Alternating Inference Chain. A chain pattern of even Node count where the end links are both Strong. The ends of a SE-AIC form a Robust Link.
- Sector#
See House.
- See#
Ccells that have an Link between them are said to see each other.
- Set#
- SLC#
Strongly Link Chain. A Chain where all the links between Nodes are strong. An SLC is a special case of an AIC where every alternate link is masquerading as a Weak Link.
- SLN#
Strongly Link Net. A Net where all the links between Nodes are strong.
- Solved Value#
A Ccell that is part of the solution.
- State#
Collective pronoun for the terms True and False, which are the conditions of a :term: Ccell in a :term: Cell. A Ccell can either be True or False in a Cell. Only one Ccell can be True in a cell becoming the placed value.
- Strong Link#
An inference between two Ccells where neither can be simultaneously False, nor simultaneously True. If one Ccell is True, the other is False and vice-versa.
- Sudoku Rule#
A Sudoku Puzzle has a unique solution where each Cell in the 9 x 9 Grid contains a number between 1 and 9 that only occurs once in each of the 9 Rows, 9 Columns, and 9 - 3 x 3 Boxes.
- Super-Node#
The set of ‘same parity/state nodes’ in a Strong Linked Chain, Net or Loop, that is strongly linked to the opposing Super-Nodes.
- Tower#
A Column oriented Chute.
- Truth#
A Set of Ccells that See each other in a Chouse where one of the Ccells is True, that is the Solved Value.
- ULS#
Ulocked Set, see Nearly Locked Sets.
- Union#
All the Cells of two intersecting Houses.
- Unit#
See House.
- Unrestricted Candidate#
In a Bent Exposed Subset, an Unrestricted Candidate is a Candidate that that cannot See all instances of its value in the Bent Subset grouping. This is a special case of an Unrestricted Candidate Set (Nearly Locked Sets) with a single member.
- Unrestricted Candidate Set#
In Nearly Locked Sets, an Unrestricted Candidate Set is that set of Candidates that cannot See all instances of its value in the Unlocked Sets pattern.
- WE-AIC#
Weak Link Ended Alternating Inference Chain. A chain pattern of even Node count where the end links are both Strong.
- Weak Link#
An inference between two Ccells where neither can be simultaneously True, and at least one end is always False. A Weak Link is formed by 3 or more same valued candidates in a house or three or more candidates in a cell.
- YMMV#
“Your milage may vary”. Your opinion or experience may be different to mine.
Intersection/Overlap: Where 2 Groups/Houses share one or more cells. The shared cell(s) where a row and column cross, or when a row or column crosses a block. Conflict/Contradiction/Error: Two or more cells with the same value in a Group/House. Minimal Puzzle: A minimal puzzle is that where no more holes can be dug without the puzzle becoming invalid, that is having multiple solutions. Slink: Strong link in a chain or a loop Wink Weak link in a chain or a loop Ccell Refers to a candidate value in a cell as a unique identifier comprising the candidate, row and column coordinates as a tuple. For example 3r2c8 candidate 3 in row 2, column 8. This reference is useful when referring to specific candidates in specific cells, and is used extensively in the explanation of many logic techniques and their algorithms. In solving puzzles Ccells are whittled away (eliminated) using logic techniques until only one Ccell remains as the solution for that cell. Sudoku Rules The collective term for: * The numbers 1 through 9 only occur once in each row, column and block. * Only one unique solution. Conjugate Pair. The two same value candidates in a house forming a strong link. Bi-Value Cell (BVC) A cell containing only two candidates. AIC Alternating Inference Chain. A chain comprising alternating Weak and Strong links. Linebox The intersection of a line (row or column) and a box comprising only three cells. Rowbox The intersection of row and box comprising only three cells Colbox The intersection of a column and box comprising only three cells.