New pages
From Sudopedia
Jump to navigationJump to search(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 20:15, 22 July 2025 Contradiction Net (hist) [25 bytes] Rooted (talk | contribs) (Redirected page to Forcing Net) Tag: New redirect
- 20:11, 22 July 2025 Sudoku Explainer (hist) [937 bytes] Rooted (talk | contribs) (Created page with "'''Sudoku Explainer''' is one of the Sudoku Programs. The solving techniques that are implemented in Sudoku Explainer seem somewhat old-school: the most advanced techn...")
- 20:05, 22 July 2025 Sudoku Assistenten (hist) [782 bytes] Rooted (talk | contribs) (Created page with "'''Sudoku Assistenten''' is one of the most popular downloadable free Sudoku Programs. Its easy-to-use interface allows sudokus of all levels of difficulty to be input or...")
- 20:03, 22 July 2025 Sudoku Susser (hist) [869 bytes] Rooted (talk | contribs) (Created page with "'''Sudoku Susser''' is one of the many available Sudoku Programs. It is a very powerful solver, though its user interface is a tad too technical for the average user. The...")
- 19:58, 22 July 2025 Consecutive Puzzle (hist) [402 bytes] Rooted (talk | contribs) (Created page with "In sudoku puzzles called '''Consecutive Puzzles''', there are some marks on the border between the cells, indicating that the two cells have consecutive digits. T...")
- 19:54, 22 July 2025 NRC-Sudoku (hist) [25 bytes] Rooted (talk | contribs) (Redirected page to Hypersudoku) Tag: New redirect
- 19:48, 22 July 2025 Hypersudoku (hist) [6,965 bytes] Rooted (talk | contribs) (Created page with "==Hypersudoku== '''Hypersudoku''', '''Windoku''', '''NRC-Sudoku''', or '''Four-square Sudoku''' is one of the Sudoku Variations with additional constraints. This f...")
- 19:43, 22 July 2025 Irregular Sudoku (hist) [20 bytes] Rooted (talk | contribs) (Redirected page to Jigsaw) Tag: New redirect
- 19:41, 22 July 2025 Squiggly (hist) [20 bytes] Rooted (talk | contribs) (Redirected page to Jigsaw) Tag: New redirect
- 19:41, 22 July 2025 Nonomino (hist) [20 bytes] Rooted (talk | contribs) (Redirected page to Jigsaw) Tag: New redirect
- 19:36, 22 July 2025 Valid Test Cases (hist) [3,349 bytes] Rooted (talk | contribs) (Created page with "These test cases should result in a valid puzzle, and potentially a unique solution. == Completed Puzzle == A case of ‘more than enough’, this puzzle has already...")
- 19:34, 22 July 2025 Invalid Test Cases (hist) [12,253 bytes] Rooted (talk | contribs) (Created page with "Testing a good Sudoku solver should exercise the error handling as well as the algorithm. These test cases can be divided into to basic categories: puzzles that cannot be par...")
- 19:33, 22 July 2025 Test Cases (hist) [544 bytes] Rooted (talk | contribs) (Created page with "== Sudoku Test Cases == The goal of these test cases are to provide guidance for testing and verifying Sudoku solvers. They are designed for ‘classic Sudoku’, i....")
- 19:30, 22 July 2025 Constraint satisfaction problem (hist) [762 bytes] Rooted (talk | contribs) (Created page with "'''Constraint Satisfaction Problems''' can be solved using Donald Knuth’s Dancing Links algorithm. Another way to program Sudoku as a constraint satisfaction problem i...")
- 19:15, 22 July 2025 Binary Integer Linear Program (hist) [1,399 bytes] Rooted (talk | contribs) (Created page with "A linear program is an algorithm of use when the objective function, or goal, can be expressed as an equation that is linear in the decision variables, and all constraints are...")
- 19:13, 22 July 2025 Generalized Fishy Cycles (hist) [11,484 bytes] Rooted (talk | contribs) (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...")
- 19:12, 22 July 2025 Uniqueness Clue Cover (hist) [8,772 bytes] Rooted (talk | contribs) (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 it makes, indepe...")
- 19:04, 22 July 2025 Franken Swordfish (hist) [4,521 bytes] Rooted (talk | contribs) (Created page with "The '''Franken Swordfish''' is a fish pattern of the Franken Fish type. This type allows either the defining set or the secondary set to contain boxes, as...")
- 18:54, 20 July 2025 Dancing Links (hist) [9,097 bytes] Rooted (talk | contribs) (Created page with "The Dancing Links algorithm has been created by Donald Knuth to solve CSP's (Constraint Satisfaction Problems). It can easily be adapted to function as a Backtracking Algor...")
- 18:52, 20 July 2025 Backtracking Algorithms (hist) [640 bytes] Rooted (talk | contribs) (Created page with "A backtracking algorithm solves a Sudoku by trying to place a digit into a cell, then working out the consequences and placing other digits until the program either hits a...")
- 18:51, 20 July 2025 Constraint Subsets (hist) [2,025 bytes] Rooted (talk | contribs) (Created page with "'''Constraint subsets''' is an abstraction of subsets and fish. By itself, it is not a solving technique that can be employed by human players, but the broad range...")
- 18:39, 20 July 2025 Canonical grid (hist) [369 bytes] Rooted (talk | contribs) (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:38, 20 July 2025 Traveling Pairs (hist) [28 bytes] Rooted (talk | contribs) (Redirected page to Braid Analysis) Tag: New redirect
- 18:36, 20 July 2025 Extended Subset Principle (hist) [4,087 bytes] Rooted (talk | contribs) (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...")
- 18:35, 20 July 2025 Subset Counting (hist) [4,087 bytes] Rooted (talk | contribs) (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...")
- 18:32, 20 July 2025 Sue de Coq (hist) [2,001 bytes] Rooted (talk | contribs) (Created page with "The '''Sue de Coq''' technique uses two intersecting sets '''A''' and '''B''', where '''A''' is a set of N cells with N candidates in a line, '''B''' is a set...")
- 18:31, 20 July 2025 Almost ALS (hist) [476 bytes] Rooted (talk | contribs) (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...")
- 18:29, 20 July 2025 Almost locked set (hist) [1,062 bytes] Rooted (talk | contribs) (Created page with "An '''Almost Locked Set''' is a group of '''N''' cells in a single house with candidates for '''N+1''' digits. In other words, it is one cell short from being...")
- 18:28, 20 July 2025 Naked subset (hist) [1,414 bytes] Rooted (talk | contribs) (Created page with "A '''Naked Subset''' is formed by '''N''' cells in a house with candidates for exactly '''N''' digits. '''N''' is the size of the subset, which must lie betwe...")
- 18:26, 20 July 2025 WXYZ-Wing (hist) [3,216 bytes] Rooted (talk | contribs) (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 t...")
- 18:26, 20 July 2025 XYZ-Wing (hist) [1,645 bytes] Rooted (talk | contribs) (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...")
- 18:25, 20 July 2025 Pincer (hist) [138 bytes] Rooted (talk | contribs) (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.")
- 18:23, 20 July 2025 Oriented 3D chains (hist) [6,824 bytes] Rooted (talk | contribs) (Created page with "'''ORIENTED 3D‑CHAINS: NRC‑, NRCT‑, NRCZ‑ AND NRCZT‑ CHAINS''' <br /> === 1) NRC‑LINKS and GENERAL 3D‑CHAINS === The basic notion underlying all the 3D‑chain...")
- 18:20, 20 July 2025 Oriented Chains (hist) [651 bytes] Rooted (talk | contribs) (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/o...")
- 18:17, 20 July 2025 Solving path (hist) [2,236 bytes] Rooted (talk | contribs) (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...")
- 18:15, 20 July 2025 Remote Pairs (hist) [2,355 bytes] Rooted (talk | contribs) (Created page with "The '''Remote Pairs''' technique uses a XY-Chain involving an even number of bivalue cells, and all the cells have the same two digits as their candidate...")
- 15:49, 20 July 2025 Solved cell (hist) [186 bytes] Rooted (talk | contribs) (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 puz...")
- 15:45, 20 July 2025 Avoidable Rectangle (hist) [5,952 bytes] Rooted (talk | contribs) (Created page with "An '''Unavoidable Rectangle''' is a 4-cell deadly pattern in a Sudoku solution; for example: xy . . | yx . . | . . . yx . . | xy . . | . ....")
- 15:44, 20 July 2025 Deadly pattern (hist) [28 bytes] Rooted (talk | contribs) (Redirected page to Deadly Pattern) Tag: New redirect
- 15:42, 20 July 2025 Supercoloring (hist) [2,933 bytes] Rooted (talk | contribs) (Created page with "'''Supercoloring''' is the precursor to Multi-Colors, which eventually evolved into Ultracoloring and 3D Medusa. This advanced solving technique was originally...")
- 15:40, 20 July 2025 Candidate elimination cell (hist) [363 bytes] Rooted (talk | contribs) (Created page with "'''Candidate elimination cell''' ('''CEC''') is a cell that contains a candidate capable of causing a contradiction in a ([[Fish|fish]...")
- 15:37, 20 July 2025 Kraken Fish (hist) [3,693 bytes] Rooted (talk | contribs) (Created page with "A '''Kraken Fish''' is a fish pattern which is connected to a candidate elimination cell (CEC) in such a way that placing this candidate would reduce the sec...")
- 15:34, 20 July 2025 Mutant Jellyfish (hist) [818 bytes] Rooted (talk | contribs) (Created page with "A '''Mutant Jellyfish''' is a Mutant Fish of size 4. Due to the complexity and the high risk of degeneration when only a few vertices are missing, this fish patter...")
- 15:33, 20 July 2025 Mutant Swordfish (hist) [856 bytes] Rooted (talk | contribs) (Created page with "A '''Mutant Swordfish''' is a Mutant Fish of size 3. Here is an example: Image:mutant swordfish.png All the candidates in rows 1 and 9 and column 7 (the...")
- 15:31, 20 July 2025 Mutant Fish (hist) [3,104 bytes] Rooted (talk | contribs) (Created page with "When fish are no longer restricted to rows and columns, strange varieties emerge. When either the defining set or the secondary set contains a mixture of r...")
- 15:28, 20 July 2025 Claiming (hist) [3,039 bytes] Rooted (talk | contribs) (Created page with "A solving technique that uses the intersections between lines and boxes. Aliases include: '''Intersection Removal''', '''Line-Box Interaction'''. The terms ''...")
- 15:27, 20 July 2025 Franken Fish (hist) [996 bytes] Rooted (talk | contribs) (Created page with "A '''Franken Fish''' is a fish pattern where one or more lines in the defining set or the secondary set has been replaced by an equal number of boxes. The...")
- 15:26, 20 July 2025 Squirmbag (hist) [956 bytes] Rooted (talk | contribs) (Created page with "A '''Squirmbag''' is a fish with 5 rows and 5 columns. ; Squirmbag in the rows : When all candidates for a particular digit in 5 rows are located in only...")
- 15:22, 20 July 2025 Almost Locked Candidates (hist) [2,196 bytes] Rooted (talk | contribs) (Created page with "{{develop}} The '''Almost Locked Candidates''', or '''ALC''', technique refers to a line-box intersection and a set of digits '''S''' such that: * An Almost...")
- 15:21, 20 July 2025 Locked Triple (hist) [466 bytes] Rooted (talk | contribs) (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...")
