New pages

From Sudopedia, the Free Sudoku Reference Guide

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

• 17:10, 25 October 2021 ‎Solving path (hist | edit) ‎[2,243 bytes] ‎127.0.0.1 (talk) (Created page with "A '''solving path''' or '''walkthrough''' is a list of steps that shows how a particular puzzle is solved. Depending on the writer and the intended audience, some basic sol...")
• 17:05, 25 October 2021 ‎XY-Chain (hist | edit) ‎[2,457 bytes] ‎127.0.0.1 (talk) (Created page with "A '''XY-Chain''' is a chain of cells which each contain only 2 candidates. Because the chain is entirely made up by bivalue cells, the link between the 2...")
• 16:56, 25 October 2021 ‎X-Chain (hist | edit) ‎[2,520 bytes] ‎127.0.0.1 (talk) (Created page with "A '''X-Chain''' is a single-digit solving technique which uses a chain consisting of links that alternate between strong links and weak links, with the...")
• 16:56, 25 October 2021 ‎Bridge (hist | edit) ‎[324 bytes] ‎127.0.0.1 (talk) (Created page with "A '''bridge''' is a weak link that connects 2 clusters in a coloring technique. Bridges are used in Multi-Colors. They cause the opposite parity of both clust...")
• 16:54, 25 October 2021 ‎Nice Loop (hist | edit) ‎[5,375 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Nice Loop''' is a loop that follows a set of rules and notation guidelines. Several types of chains and loops can also be represented as Nice Loops. The basis fo...")
• 16:51, 25 October 2021 ‎Discontinuous (hist | edit) ‎[746 bytes] ‎127.0.0.1 (talk) (Created page with "A loop is '''discontinuous''' when a single node does not comply with the rules defined for that loop. The following image illustrates the concept: Image:discontin...")
• 16:48, 25 October 2021 ‎Double Implication Chain (hist | edit) ‎[651 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Double Implication Chain''' or '''DIC''' is a Forcing Chain with implications in both directions. When it starts and ends with the same cell, it is also a Nice Loop....")
• 16:47, 25 October 2021 ‎Alternating Inference Chain (hist | edit) ‎[7,522 bytes] ‎127.0.0.1 (talk) (Created page with "== Definition == An '''Alternating Inference Chain''', better known by its acronym '''AIC''', is a chain of premises, linked by alternating strong and weak inferences....")
• 16:47, 25 October 2021 ‎Eureka (hist | edit) ‎[1,725 bytes] ‎127.0.0.1 (talk) (Created page with "The '''Eureka''' notation system is a compact method to write Alternating Inference Chains. Cells are mainly written in the rncn notation, but other methods like k9...")
• 16:45, 25 October 2021 ‎Node (hist | edit) ‎[369 bytes] ‎127.0.0.1 (talk) (Created page with "A '''node''' is an item in a chain or loop. It can be a cell, a candidate or a complex structure like an Almost Locked Set. The term '''vertex''' is somet...")
• 16:34, 25 October 2021 ‎Forcing Chain (hist | edit) ‎[3,612 bytes] ‎127.0.0.1 (talk) (Created page with "'''Forcing Chain''' is the generic term for all types of chains and loops which propagate implications from one cell or candidate to another. People who a...")
• 16:34, 25 October 2021 ‎Forcing Net (hist | edit) ‎[2,140 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Forcing Net''' shows a contradiction or a verity which is caused by testing a candidate. Also known as '''Generalized Forcing Chain'''. The term '''Contradict...")
• 16:30, 25 October 2021 ‎B/B Plot (hist | edit) ‎[414 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Bivalue/Bilocal Plot''' is a diagram that shows the strong links between candidates in a Sudoku grid. Such a diagram is a useful tool to identify c...")
• 16:18, 25 October 2021 ‎Uniqueness Clue Cover (hist | edit) ‎[8,766 bytes] ‎127.0.0.1 (talk) (Created page with "A pattern of clues in a designated area of the grid is said to be a '''Uniqueness Clue Cover''' ('''UCC''') when at least one of the eliminations that...")
• 16:17, 25 October 2021 ‎Footprint (hist | edit) ‎[1,693 bytes] ‎127.0.0.1 (talk) (Created page with "== Definitions == The '''footprint''' of a pattern of solved cells is a list of 27 sets, where: * set 1 = values in row 1 of the pattern * set 2 = values in row 2 of the patt...")
• 16:02, 25 October 2021 ‎Reverse BUG Lite (hist | edit) ‎[801 bytes] ‎127.0.0.1 (talk) (Created page with "The '''Reverse BUG Lite''' is a generalization of the Reverse BUG solving technique. It can be stated as follows: : In solving a sudoku with a Uniqueness Controv...")
• 15:34, 25 October 2021 ‎Reverse BUG (hist | edit) ‎[2,517 bytes] ‎127.0.0.1 (talk) (Created page with "In a 9 by 9 sudoku, a '''Reverse BUG''' is a state of the grid where every solved cell of two particular digits form an unavoidable set of less than 18 cel...")
• 15:34, 25 October 2021 ‎Unavoidable set (hist | edit) ‎[560 bytes] ‎127.0.0.1 (talk) (Created page with "An '''unavoidable set''' is a deadly pattern from the point of view of a puzzle maker, or somebody who likes to investigate solution grids. Take the following exa...")
• 15:15, 25 October 2021 ‎Avoidable Rectangle (hist | edit) ‎[5,952 bytes] ‎127.0.0.1 (talk) (Created page with "An '''Unavoidable Rectangle''' is a 4-cell deadly pattern in a Sudoku solution; for example: xy . . | yx . . | . . . yx . . | xy . . | . ....")
• 15:11, 25 October 2021 ‎Solved cell (hist | edit) ‎[169 bytes] ‎127.0.0.1 (talk) (Created page with "A cell in the puzzle whose digit value is known through having been derived by the solver, as opposed to being provided as a given clue by the puzzle author.")
• 15:01, 25 October 2021 ‎Color Wing (hist | edit) ‎[305 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Color Wing''' is a subtype of coloring that eliminates candidates using multiple clusters. The eliminations take place outside these clusters. Further de...")
• 15:00, 25 October 2021 ‎Color Wrap (hist | edit) ‎[5,049 bytes] ‎127.0.0.1 (talk) (Created page with "'''Color Wrap''' is a subtype of coloring that eliminates candidates for one of the parities in a single cluster by exposing a contradiction in...")
• 14:59, 25 October 2021 ‎Color Trap (hist | edit) ‎[1,184 bytes] ‎127.0.0.1 (talk) (Created page with "'''Color Trap''' is a type of coloring that uses a single cluster with only 2 colors to perform eliminations outside this cluster. Together with the Color Wrap, th...")
• 14:56, 25 October 2021 ‎Weak Colors (hist | edit) ‎[3,061 bytes] ‎127.0.0.1 (talk) (Created page with "'''Weak Colors''' (or '''Simple Colors + Hinge''') extends either end of a Simple Colors chain using Hinges or Empty Rectangles considerations. The cells s...")
• 14:53, 25 October 2021 ‎X-Colors (hist | edit) ‎[11,905 bytes] ‎127.0.0.1 (talk) (Created page with "'''X-Colors''', or '''eXtended Colors''', is a coloring technique that uses only 2 colors, even when weak links are bridged. It is a relatively simple method that can...")
• 14:46, 25 October 2021 ‎Bifurcation (hist | edit) ‎[701 bytes] ‎127.0.0.1 (talk) (Created page with "A limited form of Trial & Error where only constraints with 2 remaining candidates are considered. When there are only 2 candidates left for a constraint, one of...")
• 14:41, 25 October 2021 ‎Conjugate (hist | edit) ‎[1,097 bytes] ‎127.0.0.1 (talk) (Created page with "A '''conjugate pair''' is a pair of candidates with a strong link. They are the last 2 candidates for a single digit in a house they share. Different terms we...")
• 14:41, 25 October 2021 ‎Connected pair (hist | edit) ‎[642 bytes] ‎127.0.0.1 (talk) (Created page with "A '''connected pair''' is a pair of candidates for which we have established that they cannot be false at the same time. Connected pairs are formed by solving technique...")
• 14:33, 25 October 2021 ‎Supercoloring (hist | edit) ‎[2,915 bytes] ‎127.0.0.1 (talk) (Created page with "'''Supercoloring''' is the precursor to Multi-Colors, which eventually evolved into Ultracoloring and 3D Medusa. This advanced solving technique was originally...")
• 14:31, 25 October 2021 ‎Parity (hist | edit) ‎[557 bytes] ‎127.0.0.1 (talk) (Created page with "'''Parity''' is a term used in coloring. It represents the state of a candidate in a cluster. Within a color cluster, there can only be 2 parities. Each candidate...")
• 14:31, 25 October 2021 ‎Equivalent (hist | edit) ‎[455 bytes] ‎127.0.0.1 (talk) (Created page with "Candidates are '''equivalent''' when they must both be true or false at the same time. Equivalence is an essential part of coloring. It allows us to use groups of can...")
• 14:29, 25 October 2021 ‎Opposite (hist | edit) ‎[374 bytes] ‎127.0.0.1 (talk) (Created page with "Candidates are '''opposite''' when only one of them must be true, while the other must be false. They have opposite parity within a cluster. In coloring, colo...")
• 14:27, 25 October 2021 ‎Cluster (hist | edit) ‎[259 bytes] ‎127.0.0.1 (talk) (Created page with "A '''cluster''' is a group of candidates which are all connected with strong links. As a result, there can only be 2 ways to solve this cluster. Parity is assigned...")
• 14:26, 25 October 2021 ‎Simple Colors (hist | edit) ‎[1,647 bytes] ‎127.0.0.1 (talk) (Created page with "'''Simple Colors''' is a subtype of coloring which only uses 2 colors. == How it works (1) == The following example demonstrates the principle: Image:Color-trap.png...")
• 14:20, 25 October 2021 ‎Hidden Quad (hist | edit) ‎[394 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Hidden Quad''' is a Hidden Subset of size 4. When all candidates for 4 digits in a house are limited to only 4 cells, these cells must contain these...")
• 14:19, 25 October 2021 ‎Hidden Triple (hist | edit) ‎[504 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Hidden Triple''' is a Hidden Subset of size 3. When all candidates for 3 digits in a house are limited to only 3 cells, these cells must contain thes...")
• 14:08, 25 October 2021 ‎Hidden Pair (hist | edit) ‎[459 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Hidden Pair''' is a Hidden Subset of size 2. When all candidates for 2 digits in a house are limited to only 2 cells, these cells must contain these...")
• 13:51, 25 October 2021 ‎Almost Locked Candidates (hist | edit) ‎[2,227 bytes] ‎127.0.0.1 (talk) (Created page with "{{develop}} The '''Almost Locked Candidates''', or '''ALC''', solving technique refers to a line-box intersection and a set of digits '''S''' such that: * An...")
• 13:25, 25 October 2021 ‎Locked Triple (hist | edit) ‎[466 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Locked Triple''' is a Naked Triple where all 3 cells are locked in a single intersection. Because the intersection is part of 2 houses, the Locked Triple...")
• 13:25, 25 October 2021 ‎Naked Triple (hist | edit) ‎[671 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Naked Triple''' is a Naked Subset of size 3. It is formed by 3 cells that have candidates for only 3 digits and are collocated in the same house. ==...")
• 13:25, 25 October 2021 ‎Naked Quad (hist | edit) ‎[306 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Naked Quad''' is a Naked Subset of size 4. It is formed by 4 cells that have candidates for only 4 digits and are collocated in the same house. == E...")
• 13:21, 25 October 2021 ‎Locked Pair (hist | edit) ‎[459 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Locked Pair''' is a Naked Pair where both cells are locked in a single intersection. Because the intersection is part of 2 houses, the Locked Pair can ca...")
• 13:21, 25 October 2021 ‎Naked Pair (hist | edit) ‎[850 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Naked Pair''' is a Naked Subset of size 2. It is formed by 2 cells that have candidates for only 2 digits and are collocated in the same house. == H...")
• 12:56, 25 October 2021 ‎XY-Wing (hist | edit) ‎[1,980 bytes] ‎127.0.0.1 (talk) (Created page with "An '''XY-Wing''' is a solving technique that uses a short chain of 3 cells. The cell in the center is called the pivot. The other 2 cells are the pincers....")
• 12:17, 25 October 2021 ‎Empty Rectangle (hist | edit) ‎[6,730 bytes] ‎127.0.0.1 (talk) (Created page with "The '''Empty Rectangle''' is a single-digit solving technique which uses the absence of candidates to perform an elimination. An alternative term is '''hinge''',...")
• 12:14, 25 October 2021 ‎Grouped Turbot Fish (hist | edit) ‎[2,478 bytes] ‎127.0.0.1 (talk) (Created page with "The '''Grouped Turbot Fish''' solving technique extends the definition of a regular Turbot Fish, by allowing nodes in the loop which are '''groups''' of cand...")
• 12:07, 25 October 2021 ‎Skyscraper (hist | edit) ‎[1,385 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Skyscraper''' is a single-digit solving technique which uses a particular pattern of Turbot Fish. It has been introduced as a separate technique, because the...")
• 12:06, 25 October 2021 ‎2-String Kite (hist | edit) ‎[4,865 bytes] ‎127.0.0.1 (talk) (Created page with "The '''2-String Kite''' solving technique describes a particular type of Turbot Fish as a pattern. It has been introduced as a separate technique, because the Tur...")
• 12:06, 25 October 2021 ‎Multi-Colors (hist | edit) ‎[3,534 bytes] ‎127.0.0.1 (talk) (Created page with "'''Multi-Colors''' is a subtype of coloring that uses more than 2 colors, as opposed to Simple Colors. This is a single-digit technique. The player first chooses...")
• 11:53, 25 October 2021 ‎Turbot Fish (hist | edit) ‎[1,561 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Turbot Fish''' is a single-digit solving technique that uses a loop of odd length. The minimum length is 5, forming a fish-shaped pattern that gave the techni...")

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)