11/8/2023 0 Comments Hardest sudoku ever![]() ![]() Since you did ask for a solution to the puzzle, however, I can provide it (mouseover the spoiler block): I'm afraid I think this is the best answer you can get to this question. This only happens when the solver must use brute-force branching guessing to find the solution.Īs a result, there is no way I myself could reasonably provide a "how to solve this puzzle" answer, since doing so would involve finding these specific chains and explaining why the other vast quantity of chains don't work.īut that's how you do it: assume a square is a number, then another, then another, and keep checking until you've come to a sequence that still makes sense and allows you to solve the puzzle, or you've come to a contradiction and need to back up and try again. This solver could not solve the puzzle completely by logic, this does not mean there is not a logical solution.Īnd then promptly fails to list any of the steps it used to solve it. The solver on sudoku-solutions does come up with the solution to this puzzle, but when asked to provide the steps, declares: It is a depth-first-search of the possible solutions, in essence. The solution requires one to assume the values of squares, and then reduce the puzzle to see if you need more assumptions - if you do, make another one and continue. The solver on SudokuWiki can't get it because it would simply take too long to do in Javascript, and it's not programmed to guess numbers. The number of steps one has to look ahead in order to reduce away clues is the metric here, and this puzzle needs nine sequential guesses to reach a solvable state. In fact, I have not yet found a sudoku that requires more than 2 levels of hypotheses + one lookahead (= 3 levels of hypotheses).įor this puzzle, while it has one and only one solution, no known patterns work on it, other than a slightly more intelligent guess-and-check. Since I am only interested in solving hard puzzles by "educated guessing", I found that this sudoku is actually not so hard as advertised (1 level of hypothesis + 1 lookahead = 2 levels of hypotheses). I have put up screen shots of the steps and a quick explanation of the method at World's Hardest Sudoku. The notation follows spreadsheet conventions (column = letter, row = number) (or chess if you will). (I use my own home grown unoptimized python program, so there is no real computing power involved either). However, it does not require any fancy algorithms to follow it. Just following the chain including contradictions requires to solve 23 variants of the sudoku, so it's best used with a computer aided solver. ![]() So, here is a reasoning chain based on a breadth-first hypothesis/disproof method (which my stepson reluctantly calls "educated guessing"). ![]() There is one new puzzle per level per grid size each day.Guessing single values in a depth-first search is sub-optimal. A "Solve One Cell" option with a walkthrough is available if you get The more logic steps are required to solve the puzzle. Within the Hard and Tough levels, the puzzle difficultyĬan vary substantially - we have attempted to put a rating on each puzzle. Grids can be of any size - initially there are puzzles of sizes 5x5, 6圆, 7x7 and 8x8. The only other rule is that no two adjacent cells - including diagonal ones - can contain the same number.ĭespite these two rules, some puzzles can be incredibly challenging to solve. So a group that has 5 cells will contain the numbers 1 to 5. The cells in each puzzle grid are divided into groups (or clusters/containers) and each group contains the numbers 1 to n, where n is the number of cells in the group. Suguru is a great new Japanese logic number puzzle with only two very simple rules. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |