![]() champagne 2017 Supporter Posts: 7289 Joined: 02 August 2007 Location: France BrittanyĪll of the fastest programs use naked/hidden singles, locked candidates, and guessing with backtracking, or a sub-set of those. If you go in that direction, you'll see that the price to pay to detect naked or hidden pairs is already too high.ĪFAIK, none of these programs use more than singles + guesses except for the zhou process using the property of a digit locked in a mini row / mini column.Ĭhoosing the best guess (again, how much do you pay to optimize the guess) is another key parameterīTW, it took me weeks and a deep study of the fss2 code to reach an improvement of the original "Zhou" process. What are the C++ instructions translated nearly instruction for instruction in that native set What are the rules and the grid description that can use in the best way these instructions. What are the things the native set of instructions of a computer can do. To reach the performance of the program listed by dobrichev, you have to look at the problem in a different way. Which combination/order of techniques are required to solve Sudoku puzzle faster than other programs? Rjamil wrote:Is it true that speed depends on algorithms/techniques?
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |