Snipes - Revision history

Ryokousha: /* Non-Consecutive */ credit SCL for 4-clue NC

2025-05-15T06:51:07Z

Non-Consecutive: credit SCL for 4-clue NC

← Older revision		Revision as of 06:51, 15 May 2025
Line 70:		Line 70:
	=== Non-Consecutive ===		=== Non-Consecutive ===

	* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4~~; it is unknown who~~ first determined ~~this, but an exhaustive list has been produced~~ by Sam Cappleman-Lynes ([https://drive.google.com/file/d/1GVqJnM-YnxxEAVsAepNpH_YCcBNv7qQJ/view?usp=drive_link link]).		* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4, first determined by Sam Cappleman-Lynes ([http://forum.enjoysudoku.com/sudokufp-t35625-60.html#p279972]) who also produced an exhaustive list ([https://drive.google.com/file/d/1GVqJnM-YnxxEAVsAepNpH_YCcBNv7qQJ/view?usp=drive_link link]).
	* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).		* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).

Ryokousha: /* Non-Consecutive */

2025-05-14T21:02:11Z

Non-Consecutive

← Older revision		Revision as of 21:02, 14 May 2025
Line 70:		Line 70:
	=== Non-Consecutive ===		=== Non-Consecutive ===

	* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced ([https://drive.google.com/file/d/1GVqJnM-YnxxEAVsAepNpH_YCcBNv7qQJ/view?usp=drive_link link]).		* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced by Sam Cappleman-Lynes ([https://drive.google.com/file/d/1GVqJnM-YnxxEAVsAepNpH_YCcBNv7qQJ/view?usp=drive_link link]).
	* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).		* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).

Ryokousha: /* Non-Consecutive */ linked list of 4-clue puzzles by SCL

2025-05-14T20:58:59Z

Non-Consecutive: linked list of 4-clue puzzles by SCL

← Older revision		Revision as of 20:58, 14 May 2025
Line 70:		Line 70:
	=== Non-Consecutive ===		=== Non-Consecutive ===

	* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced ~~{{Citation needed}}~~.		* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced ([https://drive.google.com/file/d/1GVqJnM-YnxxEAVsAepNpH_YCcBNv7qQJ/view?usp=drive_link link]).
	* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).		* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).

Ryokousha: /* Classic Sudoku */ new min for 20x20

2024-10-30T22:46:02Z

Classic Sudoku: new min for 20x20

← Older revision		Revision as of 22:46, 30 October 2024
Line 12:		Line 12:
	* For 12x12 (with 4x3 regions), the minimum is 30 givens ([http://forum.enjoysudoku.com/minimum-givens-on-larger-puzzles-t4801.html#p256530 link]), found by ton. It is unknown if this can be improved.		* For 12x12 (with 4x3 regions), the minimum is 30 givens ([http://forum.enjoysudoku.com/minimum-givens-on-larger-puzzles-t4801.html#p256530 link]), found by ton. It is unknown if this can be improved.
	* For 15x15 (with 5x3 regions), the minimum is 48 givens ([http://forum.enjoysudoku.com/minimum-givens-on-larger-puzzles-t4801.html#p256530 link]), found by ton. It is unknown if this can be improved.		* For 15x15 (with 5x3 regions), the minimum is 48 givens ([http://forum.enjoysudoku.com/minimum-givens-on-larger-puzzles-t4801.html#p256530 link]), found by ton. It is unknown if this can be improved.
	* For 20x20 (with 5x4 regions), the minimum is 89 givens ([http://forum.enjoysudoku.com/minimum-givens-on-larger-puzzles-t4801-15.html#~~p302770~~ link]), found by ton. It is unknown if this can be improved.		* For 20x20 (with 5x4 regions), the minimum is 88 givens ([http://forum.enjoysudoku.com/minimum-givens-on-larger-puzzles-t4801-15.html#p345139 link]), found by ton. It is unknown if this can be improved.
	* For 25x25 the minimum is 151 givens {{Citation needed}}. It is unknown if this can be improved.		* For 25x25 the minimum is 151 givens {{Citation needed}}. It is unknown if this can be improved.
	* Every [[Solution Grid\|solution grid]] has at least one [[Minimal Puzzle\|minimal puzzle]] with fewer than 22 givens, as shown by [[Mathemagics]] and [[blue]]. There are exactly four grids which do not have a minimal puzzle with fewer than 21 givens ([http://forum.enjoysudoku.com/low-hi-clue-thresholds-t36214-210.html?sk=a#p284767 link]).		* Every [[Solution Grid\|solution grid]] has at least one [[Minimal Puzzle\|minimal puzzle]] with fewer than 22 givens, as shown by [[Mathemagics]] and [[blue]]. There are exactly four grids which do not have a minimal puzzle with fewer than 21 givens ([http://forum.enjoysudoku.com/low-hi-clue-thresholds-t36214-210.html?sk=a#p284767 link]).

Ryokousha: /* Killer */

2024-10-28T18:28:24Z

Killer

← Older revision		Revision as of 18:28, 28 October 2024
Line 139:		Line 139:
	* The minimum of 18 cells has been proven by [[Scott Bathurst]] and PN ([http://forum.enjoysudoku.com/new-killer-setter-t38092-15.html?hilit=killer#p306957 link]) by filtering known 17 given classics. The existence of a 17-cell killer would imply the existence of a 17-given classic with the killer cells as givens (this is strictly more information than the killer cages give). Only 1 of the 49158 17-given classics passed the first two filters used - requiring the puzzle to be morphable into a form such that every given is adjacent to at least one other given with the property that switching these two givens results in 0 solutions (if swapping the givens results in 1 or more solutions, then replacing them with a killer cage can never disambiguate between these possibilities) - and this cannot be made unique with only killer cages by inspection. It has since been shown that all 49158 17-given classics are known, completing the proof that there is no 17-cell givenless killer.<br clear=all>		* The minimum of 18 cells has been proven by [[Scott Bathurst]] and PN ([http://forum.enjoysudoku.com/new-killer-setter-t38092-15.html?hilit=killer#p306957 link]) by filtering known 17 given classics. The existence of a 17-cell killer would imply the existence of a 17-given classic with the killer cells as givens (this is strictly more information than the killer cages give). Only 1 of the 49158 17-given classics passed the first two filters used - requiring the puzzle to be morphable into a form such that every given is adjacent to at least one other given with the property that switching these two givens results in 0 solutions (if swapping the givens results in 1 or more solutions, then replacing them with a killer cage can never disambiguate between these possibilities) - and this cannot be made unique with only killer cages by inspection. It has since been shown that all 49158 17-given classics are known, completing the proof that there is no 17-cell givenless killer.<br clear=all>
	* If repeated digits are allowed, 1 cage is sufficient ([https://f-puzzles.com/?id=yl93oc22 link]); it is unknown who discovered this originally. The minimum sum is 120, and the maximum sum is 285.		* If repeated digits are allowed, 1 cage is sufficient ([https://f-puzzles.com/?id=yl93oc22 link]); it is unknown who discovered this originally. The minimum sum is 120, and the maximum sum is 285.
	* In a traditional killer sudoku (where every cell must be covered), the fewest number of cages is 10 ([~~https~~://~~media~~.~~discordapp.net/attachments/721090566481510732~~/~~1142285511508111411~~/~~image~~.~~png~~?~~width~~=~~706&height=707~~ link]), found by TopAutism. This is the theoretical minimum.		* In a traditional killer sudoku (where every cell must be covered), the fewest number of cages is 10 ([http://sudokutheory.com/wiki/index.php?title=File:10cages.png link]), found by TopAutism. This is the theoretical minimum.
	* For a latin square, the fewest number of cells covered is 20 ([http://sudokutheory.com/wiki/index.php?title=File:Image_989416eb-82b6-4a84-83e8-9f6b87a9f431.png link]), found by PN.		* For a latin square, the fewest number of cells covered is 20 ([http://sudokutheory.com/wiki/index.php?title=File:Image_989416eb-82b6-4a84-83e8-9f6b87a9f431.png link]), found by PN.
	* The fewest 2-cell cages is 9 ([https://f-puzzles.com/?id=2qg6lu38 link]) found by PN, again covering the theoretical minimum of 18 cells.		* The fewest 2-cell cages is 9 ([https://f-puzzles.com/?id=2qg6lu38 link]) found by PN, again covering the theoretical minimum of 18 cells.

Ryokousha: /* Kropki Pairs */

2024-10-28T12:48:06Z

Kropki Pairs

← Older revision		Revision as of 12:48, 28 October 2024
Line 308:		Line 308:
	* For 3x3, the fewest dots is 3, covering 4 cells, found by Conflux ([http://sudokutheory.com/wiki/index.php?title=File:Image_52eff99b-3eb7-4441-bd8c-333ad0ec653c.png link]). This is the theoretical minimum.		* For 3x3, the fewest dots is 3, covering 4 cells, found by Conflux ([http://sudokutheory.com/wiki/index.php?title=File:Image_52eff99b-3eb7-4441-bd8c-333ad0ec653c.png link]). This is the theoretical minimum.
	* The fewest dots with an equal number of white and black dots and where no dot can be removed and remain unique is 8 of each dot (16 in total), found by PN ([https://f-puzzles.com/?id=yqnesbah link]) based on a setup by TopAutism. It is unknown whether this is minimal.		* The fewest dots with an equal number of white and black dots and where no dot can be removed and remain unique is 8 of each dot (16 in total), found by PN ([https://f-puzzles.com/?id=yqnesbah link]) based on a setup by TopAutism. It is unknown whether this is minimal.
	* The longest possible chain of consecutive pairs is 32, which can also be done in a loop, found by MikoKisai ([http://sudokutheory.com/wiki/index.php?title=File:~~Image_a477f5c8~~-2760-4cc8-96b2-cb5e58756c73.jpg link]).		* The longest possible chain of consecutive pairs is 32, which can also be done in a loop, found by MikoKisai ([http://sudokutheory.com/wiki/index.php?title=File:Image_A477f5c8-2760-4cc8-96b2-cb5e58756c73.jpg link]).
	* The longest possible chain of ratio dots is 15, found by [[armadilloappreciationsocietyzach]] ([http://sudokutheory.com/wiki/index.php?title=File:Image_1a6319da-bdb6-47af-b28b-16f9a61d4aca.png link]).		* The longest possible chain of ratio dots is 15, found by [[armadilloappreciationsocietyzach]] ([http://sudokutheory.com/wiki/index.php?title=File:Image_1a6319da-bdb6-47af-b28b-16f9a61d4aca.png link]).

Ryokousha: fixed image link

2024-10-28T12:47:21Z

fixed image link

← Older revision		Revision as of 12:47, 28 October 2024
Line 308:		Line 308:
	* For 3x3, the fewest dots is 3, covering 4 cells, found by Conflux ([http://sudokutheory.com/wiki/index.php?title=File:Image_52eff99b-3eb7-4441-bd8c-333ad0ec653c.png link]). This is the theoretical minimum.		* For 3x3, the fewest dots is 3, covering 4 cells, found by Conflux ([http://sudokutheory.com/wiki/index.php?title=File:Image_52eff99b-3eb7-4441-bd8c-333ad0ec653c.png link]). This is the theoretical minimum.
	* The fewest dots with an equal number of white and black dots and where no dot can be removed and remain unique is 8 of each dot (16 in total), found by PN ([https://f-puzzles.com/?id=yqnesbah link]) based on a setup by TopAutism. It is unknown whether this is minimal.		* The fewest dots with an equal number of white and black dots and where no dot can be removed and remain unique is 8 of each dot (16 in total), found by PN ([https://f-puzzles.com/?id=yqnesbah link]) based on a setup by TopAutism. It is unknown whether this is minimal.
	* The longest possible chain of consecutive pairs is 32, which can also be done in a loop, found by MikoKisai ([http://sudokutheory.com/wiki/index.php?title=File:Image_a477f5c8-2760-4cc8-96b2-cb5e58756c73.~~png~~ link]).		* The longest possible chain of consecutive pairs is 32, which can also be done in a loop, found by MikoKisai ([http://sudokutheory.com/wiki/index.php?title=File:Image_a477f5c8-2760-4cc8-96b2-cb5e58756c73.jpg link]).
	* The longest possible chain of ratio dots is 15, found by [[armadilloappreciationsocietyzach]] ([http://sudokutheory.com/wiki/index.php?title=File:Image_1a6319da-bdb6-47af-b28b-16f9a61d4aca.png link]).		* The longest possible chain of ratio dots is 15, found by [[armadilloappreciationsocietyzach]] ([http://sudokutheory.com/wiki/index.php?title=File:Image_1a6319da-bdb6-47af-b28b-16f9a61d4aca.png link]).

Ryokousha: /* Non-Consecutive */

2024-10-28T12:45:48Z

Non-Consecutive

← Older revision		Revision as of 12:45, 28 October 2024
Line 71:		Line 71:

	* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced {{Citation needed}}.		* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced {{Citation needed}}.
	* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:~~Image_0fbfa031~~-6e51-43e6-b8a6-1122af9db55b.jpg link]).		* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).

	=== "Miracle" (Non-Consecutive + Anti-Knight + Anti-King) ===		=== "Miracle" (Non-Consecutive + Anti-Knight + Anti-King) ===

Ryokousha: fixed image link

2024-10-28T12:44:59Z

fixed image link

← Older revision		Revision as of 12:44, 28 October 2024
Line 71:		Line 71:

	* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced {{Citation needed}}.		* The fewest givens in a [[Non-Consecutive\|non-consecutive]] sudoku is 4; it is unknown who first determined this, but an exhaustive list has been produced {{Citation needed}}.
	* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:Image_0fbfa031-6e51-43e6-b8a6-1122af9db55b.~~png~~ link]).		* The fewest unique given digits needed for a non-consecutive sudoku is 1, discovered by Freddie Hand ([http://sudokutheory.com/wiki/index.php?title=File:Image_0fbfa031-6e51-43e6-b8a6-1122af9db55b.jpg link]).

	=== "Miracle" (Non-Consecutive + Anti-Knight + Anti-King) ===		=== "Miracle" (Non-Consecutive + Anti-Knight + Anti-King) ===

Ryokousha: /* Classic Sudoku */

2024-10-28T12:40:02Z

Classic Sudoku

← Older revision		Revision as of 12:40, 28 October 2024
Line 18:		Line 18:
	* The most empty [[houses]] in a classic sudoku is 9 (3 boxes, 3 rows, 3 columns). This is the maximum, shown by exhaustive search {{Citation needed}}.		* The most empty [[houses]] in a classic sudoku is 9 (3 boxes, 3 rows, 3 columns). This is the maximum, shown by exhaustive search {{Citation needed}}.
	* For a 6x6 grid, the most empty houses is 6 ([https://f-puzzles.com/?id=2kakz6bp link]), found by randomra.		* For a 6x6 grid, the most empty houses is 6 ([https://f-puzzles.com/?id=2kakz6bp link]), found by randomra.
	* The most empty diagonals in a classic sudoku is 24 ([http://sudokutheory.com/wiki/index.php?title=File:~~Image_6efa7930~~-1780-4bf6-805b-e11fef1919e2.jpg link]) as found by PN.		* The most empty diagonals in a classic sudoku is 24 ([http://sudokutheory.com/wiki/index.php?title=File:6efa7930-1780-4bf6-805b-e11fef1919e2.jpg link]) as found by PN.
	* The largest rectangle of empty cells in a classic sudoku is 32 cells (4x8). This is believed to be the maximum, but it is not proven to be. If the rectangle is allowed to rotate, then an area of 36 is possible, covering 54 cells and enclosing 27 ([http://sudokutheory.com/wiki/index.php?title=File:Image_e7c73459-f4eb-47a3-abf4-70e35f72c834.png link]).		* The largest rectangle of empty cells in a classic sudoku is 32 cells (4x8). This is believed to be the maximum, but it is not proven to be. If the rectangle is allowed to rotate, then an area of 36 is possible, covering 54 cells and enclosing 27 ([http://sudokutheory.com/wiki/index.php?title=File:Image_e7c73459-f4eb-47a3-abf4-70e35f72c834.png link]).
	* The largest number of consecutive blanks in a classic sudoku string is 34 ([http://sudokutheory.com/wiki/index.php?title=File:Image_7058db78-5995-4384-8806-493485b29ecf.png link]). This is the theoretical maximum.		* The largest number of consecutive blanks in a classic sudoku string is 34 ([http://sudokutheory.com/wiki/index.php?title=File:Image_7058db78-5995-4384-8806-493485b29ecf.png link]). This is the theoretical maximum.