





Arto Inkala SudokuThere's been some buzz in many news outlets this week about a new puzzle by Arto Inkala, a Finish mathematician. (for example The Daily Telegraph, The Sun, Metro et al). You can load Arto Inkala's puzzle from this link or pick it from the end of the example list. But it this the hardest puzzle? See below. We don't have a logical method for solving ALL sudoku puzzles yet so there will be some that defy the pattern based methods used in this solver. Currently, if I produce a large amount of random stock, about 0.1% will still be unsolvable, so it’s possible to produce many of these ‘extremes’. People have posted solutions which combine several strategies to get past bottlenecks and there are great ideas I'd love to include, time permitting. The problem is candidate density. If you look at my solver when it comes to 'Run out of known strategies' you will see most cells contain 3 or more candidates. Most of the advanced strategies and all the chaining ones require bivalue (2 in one cell) or bilocation (2 in one unit) to get anywhere. So there is plenty of room for more thought and ideas, which is the attraction of Sudoku – its very deep. I've been looking at a new idea for measuring the difficulty of very hard puzzles  ones that can't use the standard scoring because they don't complete. The method is simple like all good ideas. One counts the number of unsolved cells that  if magically filled  render the remaining puzzle trivial. Obviously one counts the insertions separately, not several in one go. Trivial is defined as using SIngles, Pairs, Triples, Quads and Intersection Removal, the basic strategies. The ratio of insertions that trivialise a puzzle to those that do not is the score. But there will be some very hard puzzles where no single insertion makes the puzzle easy. For these level2 puzzles two cells will normally do the job. Unlike level1 puzzles where we test 50 to 55 cells the number of combinations of 2 cells is quite high, roughly 1300 to 2100 so it is likely that some or many will trivialize the puzzle. I have yet to find a level3 puzzle but it will be truly awesome puzzle if found. Check out the full article for more. Now, where does Arto Inkala's puzzle fit in in the pantheon of the truly hard? Well, currently third place. David Filmer is the hands down winner with these two puzzles:
For a puzzle to have a mere 9 pairs out of 1711 is very interesting and definitively points to Level3 puzzles. I don't pretend this scoring method is as sophisticated as some more mathematical methods, but as a rough and ready guide, I think it's helpful. So there you have it. Love to hear you comments and your experience of Arto's monster. Andrew stuart 

Comments
Comments TalkMonday 3Sep2012
... by: Traci O
Thank you for a great Arto Inkala's puzzle. I just finished today, Sept 3. I began on July 2. It took me 153 tries before I got it.Monday 27Aug2012
... by: Henry E. Nass (New York City)
Dear Mr. Stuart,I am very curious about the new sort of super difficult Sudoku puzzles. Is it so for the latest one, or some of the earlier ones created by this same Finish mathematician, that there is only one order of filled in squares that will solve it ? I suppose its possible that this could be the case but don't know how one would know. I believe it is the case that it is case that there is only one order which will undo the puzzle, but what would determine that ? Of course by analogy, a combination lock has only one order that will unlock it , even if it opens which just 3 or 4 numbers being necessary. Could such a limitation fit in this case ? I would think it would be quite interesting to know, if the people who are able to solve it, follow the same order of solution, at least for the first dozen fill in or so. It seems that would be easy enough to determine if there was a sight where the solving of the sudoku were done on line, and the order of the answer was kept track of, either in real time or by applet. Might one of your readers be able to set this up ? Please let me know I'd like to follow the result of any such study. Thanks. HN