Timeline for Minimum number of clues to fully specify any sudoku?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 1, 2017 at 1:10 | comment | added | tomoka kazuki | This information is from Wikipedia's article "Mathematics of Sudoku" section "Maximum number of givens". The cited reference (for discovery of 1st 40 clue minimal Sudoku) is: forum.enjoysudoku.com/high-clue-tamagotchis-t30020-135.html Key information is sheet 10, but related information is both before and after sheet 10. | |
| Sep 30, 2017 at 18:20 | comment | added | David Richerby | Could you add the citations here, please? Or at least a link to the relevant Wikipedia page. | |
| Sep 30, 2017 at 16:08 | comment | added | tomoka kazuki | I have not seen that proven in any paper. Interestingly, nearly all work to find high-clue "h" minimal Sudokus appears to be conducted by a search of known Sudokus, and modifying them to iteratively increase "h". The work to find the minimal 40 clue puzzles produced a database of more than 6,500,000,000 other high-clue minimal puzzles. Except for trivial problems, I have seen almost no rigorous investigation by any means other than "searching". But your proposition is an interesting one. | |
| Sep 30, 2017 at 15:34 | comment | added | rus9384 | I'm interested in whether 41 is a proven upper bound (as $\Big\lceil\frac N 2\Big\rceil$). | |
| Sep 30, 2017 at 15:19 | review | Late answers | |||
| Sep 30, 2017 at 18:20 | |||||
| Sep 30, 2017 at 15:12 | history | edited | tomoka kazuki | CC BY-SA 3.0 |
added 37 characters in body
|
| Sep 30, 2017 at 15:01 | history | answered | tomoka kazuki | CC BY-SA 3.0 |