![]() ![]() The first thing I did was to run my XSLT 2.0 solution and measure the time: Of course, I cannot seriously claim this statement is correct, because no one can define what a "simple" and "complex" Sudoku-puzzle is.Īnyway, when yesterday Andrew sent me the link to the My own explanation has been that Andrew’s solution is much faster for simple Sudoku-puzzles (usually taking only a fraction of a second), while needing potentially tens of seconds for more complicated Sudoku-puzzles, on which my solution needed not more than two seconds. Thus both of us managed to speed up our initial creations literally hundreds of times.Īt the end we achieved a state of a tie-in, in which each solution was shown to outperform the other for certain classes of Sudoku-puzzles and to lag behind significantly in other cases. ![]() ![]() For a long time we have been rivals each trying to outperform the solution of the other. If you, like me, have missed last November’s story of a a Finnish mathematician claiming to create the most difficult Sudoku-puzzle known so far, you’d probably try to check whether such a claim was likely to be true.īoth I and Andrew Welch are big fans of XSLT programming, putting it to use for solving seemingly strange kinds of problems, Sudoku-puzzles included. Times for solving the "genuine AI Escargot": While this is considered to be a harder puzzle for humans, both our XSLT solvers had less trouble and took less time (Andrew’s did decrease dramatically) on the new AI Escargot. Update: Andrew Welch found out that he had been referring not to the genuine AI Escargot puzzle: ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |