New pages

From Sudopedia, the Free Sudoku Reference Guide

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

• 19:40, 25 October 2021 ‎Strand (hist | edit) ‎[1,024 bytes] ‎127.0.0.1 (talk) (Created page with "A '''strand''' is a distribution pattern for a single digit in 3 of the 9 intersections aligned in a chute. This term is used in Braid Analysis. There are 6 d...")
• 19:39, 25 October 2021 ‎Rope (hist | edit) ‎[352 bytes] ‎127.0.0.1 (talk) (Created page with "'''Rope''' is a term that defines a particular type of distribution of digits in a chute. It is used in Braid Analysis. Image:Rope.png In a rope, a group of...")
• 19:37, 25 October 2021 ‎Braid (hist | edit) ‎[422 bytes] ‎127.0.0.1 (talk) (Created page with "'''Braid''' is a term that defines a particular type of distribution of digits in a chute. It is used in Braid Analysis. Image:Braid.png In a braid, there is...")
• 19:19, 25 October 2021 ‎Subset Counting (hist | edit) ‎[4,087 bytes] ‎127.0.0.1 (talk) (Created page with "'''Subset Counting''' is a highly advanced solving technique that requires a lot of searching, counting, testing and calculating. Thus, it is not a technique suitable for...")
• 19:16, 25 October 2021 ‎Sue de Coq (hist | edit) ‎[2,009 bytes] ‎127.0.0.1 (talk) (Created page with "The '''Sue de Coq''' solving technique uses two intersecting sets '''A''' and '''B''', where '''A''' is a set of N cells with N candidates in a line, '''B''' i...")
• 19:13, 25 October 2021 ‎Subset Exclusion (hist | edit) ‎[1,290 bytes] ‎127.0.0.1 (talk) (Created page with "<blockquote>''The name '''Subset Exclusion''' is not commonly used in the Sudoku community. This article is created as a bridge between '''Aligned Pair Exclusion''' and ''...")
• 19:11, 25 October 2021 ‎Aligned Triple Exclusion (hist | edit) ‎[916 bytes] ‎127.0.0.1 (talk) (Created page with "'''Aligned Triple Exclusion''' is a solving technique in which the solver checks combinations of digits in a triple of cells located in an intersection. It is...")
• 19:07, 25 October 2021 ‎Aligned Pair Exclusion (hist | edit) ‎[4,021 bytes] ‎127.0.0.1 (talk) (Created page with "'''Aligned Pair Exclusion''' or '''APE''' is a solving technique in which the solver checks combinations of digits in a pair of cells located in an [[intersection]...")
• 19:01, 25 October 2021 ‎Almost ALS (hist | edit) ‎[476 bytes] ‎127.0.0.1 (talk) (Created page with "An almost ALS, or AALS is an ALS one step further. An AALS has N cells with N+2 candidates between them. The simplest of AALS's is one trivalue cell. The most obvious thing...")
• 19:00, 25 October 2021 ‎Death Blossom (hist | edit) ‎[2,891 bytes] ‎127.0.0.1 (talk) (Created page with "The '''Death Blossom''' solving technique involves a ''stem'' cell of N candidates that sees N ''petals'', each an Almost Locked Set. The technique was invente...")
• 19:00, 25 October 2021 ‎Scramble (hist | edit) ‎[3,347 bytes] ‎127.0.0.1 (talk) (Created page with "When you '''scramble''' a Sudoku puzzle, you change it to a mathematically equivalent puzzle. This '''scrambled''' version requires the same solving techniques, althou...")
• 18:58, 25 October 2021 ‎Mathematically equivalent (hist | edit) ‎[1,228 bytes] ‎127.0.0.1 (talk) (Created page with "Two Sudoku puzzles are '''mathematically equivalent''' if one can transform the first into the second via a series of zero or more operations, where the allowed operations...")
• 18:58, 25 October 2021 ‎Asymmetrical (hist | edit) ‎[249 bytes] ‎127.0.0.1 (talk) (Created page with "A pattern is '''asymmetrical''' when the same pattern cannot be formed by reflection or rotation. A Sudoku is asymmetrical when the pattern formed by the givens is as...")
• 18:55, 25 October 2021 ‎Symmetrical (hist | edit) ‎[427 bytes] ‎127.0.0.1 (talk) (Created page with "A pattern is '''symmetrical''' when the same pattern can be formed by reflection or rotation. A Sudoku is symmetrical when the pattern formed by the givens is symmetr...")
• 18:50, 25 October 2021 ‎Canonical form (hist | edit) ‎[5,623 bytes] ‎127.0.0.1 (talk) (Created page with "<!-- Merged from "Canonicalize" and "Canonical Form" --> <!-- Order modified and terminology (floors & towers) standardised --> The best way to compare two Sudokus is to...")
• 18:50, 25 October 2021 ‎Canonical grid (hist | edit) ‎[516 bytes] ‎127.0.0.1 (talk) (Created page with "The '''canonical grid''' is a solution grid where the same 3 digits repeat 3 times in very chute. In terms of Braid Analysis, there are 18 ropes and no ...")
• 18:37, 25 October 2021 ‎ALS-XY-Chain (hist | edit) ‎[1,931 bytes] ‎127.0.0.1 (talk) (Created page with "An '''ALS-XY-Chain''' is a XY-Chain whose nodes are Almost Locked Sets. It is a generalization of the usual XY-Chain (whose nodes are bivalue cells), s...")
• 18:35, 25 October 2021 ‎ALS-XY-Wing (hist | edit) ‎[5,087 bytes] ‎127.0.0.1 (talk) (Created page with "The '''ALS-XY-Wing''' rule is a solving technique that uses three Almost Locked Sets. Make sure you understand the concept of Almost Locked Sets (ALSs) before you...")
• 18:27, 25 October 2021 ‎ALS-XZ (hist | edit) ‎[5,975 bytes] ‎127.0.0.1 (talk) (Created page with "The '''ALS-XZ''' rule is a solving technique that uses two Almost Locked Sets. It is the easiest of the ALS techniques, but still a technique that is rarely used by th...")
• 17:51, 25 October 2021 ‎W-Wing (hist | edit) ‎[2,708 bytes] ‎127.0.0.1 (talk) (Created page with "A '''W-Wing''' is formed by a chain of four cells: * '''A''': A cell with two candidates '''W''' and '''X'''. * '''B''': A cell with '''X''' as a candidate. * '''C''':...")
• 17:49, 25 October 2021 ‎WXYZ-Wing (hist | edit) ‎[3,242 bytes] ‎127.0.0.1 (talk) (Created page with "The '''WXYZ-Wing''' is an extension of the XYZ-Wing, and is sometimes called '''XYZW-Wing'''. Seeing the extension of XYZ-Wing to WXYZ-Wing, one can further extend the s...")
• 17:48, 25 October 2021 ‎Restricted common (hist | edit) ‎[264 bytes] ‎127.0.0.1 (talk) (Created page with "A digit is '''restricted common''' to 2 Almost Locked Sets when it cannot be present in both sets at the same time. As a result, one of the sets must be locked for th...")
• 17:42, 25 October 2021 ‎XYZ-Wing (hist | edit) ‎[1,645 bytes] ‎127.0.0.1 (talk) (Created page with "The '''XYZ-Wing''' is an extension of the XY-Wing. The pivot cell also carries the '''Z''' candidate. Up to 2 candidates can be eliminated by an XYZ-Wing, bec...")
• 17:39, 25 October 2021 ‎Pincer (hist | edit) ‎[170 bytes] ‎127.0.0.1 (talk) (Created page with "A '''pincer''' is a cell at the start or end of an XY-Chain, XY-Wing or XYZ-Wing. Each of these chains have 2 pincers. A WXYZ-Wing has 3 pincers.")
• 17:37, 25 October 2021 ‎Pivot (hist | edit) ‎[394 bytes] ‎127.0.0.1 (talk) (Created page with "A '''pivot''' or '''pivot cell''' is the central cell in a '''Wing''' pattern. In an XY-Wing, it contains the '''X''' and '''Y''' candidates and has 2 pincers...")
• 17:30, 25 October 2021 ‎Oriented 3D chains (hist | edit) ‎[9,442 bytes] ‎127.0.0.1 (talk) (Created page with "ORIENTED 3D-CHAINS: NRC-, NRCT-, NRCZ- AND NRCZT- CHAINS 1) NRC-LINKS and GENERAL 3D-CHAINS The basic notion underlying all the 3D-chains is that of an nrc-link. Definitio...")
• 17:28, 25 October 2021 ‎Oriented Chains (hist | edit) ‎[582 bytes] ‎127.0.0.1 (talk) (Created page with "'''Oriented Chains''' are generalisations of the basic xy-chains. The central idea is that the information collected from previous candidates in a chain (and/or from the targ...")
• 17:22, 25 October 2021 ‎Verity (hist | edit) ‎[903 bytes] ‎127.0.0.1 (talk) (Created page with "A '''verity''' is a statement which is true for all alternatives in a limited set. Suppose we have a cell '''A''' and a cell '''B'''. Consider the following implication...")
• 17:20, 25 October 2021 ‎Broken Wing (hist | edit) ‎[6,684 bytes] ‎127.0.0.1 (talk) (Created page with "A '''Broken Wing''' is a single-digit pattern similar to a Turbot Fish. It is also a solving technique that uses this pattern. == How it works == A correct Sudok...")
• 17:19, 25 October 2021 ‎Guardian (hist | edit) ‎[224 bytes] ‎127.0.0.1 (talk) (Created page with "A '''guardian''' is a candidate that prevents a '''Broken Wing''' to form a loop with an odd number of strong links. The role of guardians is explained in the Broke...")
• 17:17, 25 October 2021 ‎Generalized Fishy Cycles (hist | edit) ‎[11,484 bytes] ‎127.0.0.1 (talk) (Created page with "(sorry for the dollar signs, I haven't found yet how to do LaTeX on this wiki) ==Preliminaries== In an incomplete sudoku, we construct a graph as follows. Take a fixed symbol...")
• 17:13, 25 October 2021 ‎Remote Pairs (hist | edit) ‎[2,357 bytes] ‎127.0.0.1 (talk) (Created page with "The '''Remote Pairs''' solving technique uses a XY-Chain involving an even number of bivalue cells, and all the cells have the same two digits as their c...")
• 17:12, 25 October 2021 ‎Simple Sudoku (hist | edit) ‎[722 bytes] ‎127.0.0.1 (talk) (Created page with "'''Simple Sudoku''' is one of the many available Sudoku Programs. It justifies its name. The program is very easy to use, making it one of the most popular choices. The s...")
• 17:11, 25 October 2021 ‎SSTS (hist | edit) ‎[719 bytes] ‎127.0.0.1 (talk) (Created page with "'''SSTS''' means '''Simple Sudoku Technique Set''', the set of solving techniques implemented in the Simple Sudoku program. Because this set has not changed since 200...")
• 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...")

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