Sudoku@vtaiwan/en
| For sudoku@vtaiwan, we developed new techniques and used them to modify the program Checker (written by Gary McGuire). We successfully reduced the total expected computation time from 300,000 years per core to 2,417 years per core. This makes it more feasible and reasonable to use BOINC to solve Sudoku.
TO SOLVE 16-CLUE SUDOKU OPEN PROBLEM IN 2417 YEAR-CORE Sudoku is one of the most popular games nowadays. One important question intriguing to scientists is the minimum number of clues in Sudoku puzzles with unique solutions. As of October 2009, Gordon Royle collected 49151 17-clue puzzles, among which none are isomorphic to one another (by isomorphism, we mean to translate the puzzle by simply rotating, mirroring or digits-switching). However, so far, none successfully found 16-clue puzzles or gave a proof that no 16-clue puzzles exist, which most people believe. Gary McGuire, Professor of the National University of Ireland, presented a search approach to solve 16-clue puzzles. He also developed a program, called CHECKER, for trying to solve it. According to our experimental analysis, the program requires about 300,000 years on a one-core computer equipped with CPU, Intel(R) Xeon(R) E5520 @ 2.27GHz. (Note that we will use one core to indicate the computing power.) His final comment was 'We really need a breakthrough in our understanding to make it feasible to search all. We either need to reduce the search space or find a much better algorithm for searching.' (see Scientific American, 2006) In our recent research, we proposed some new algorithm and also fined tune the code to speed up by a factor of 128. Thus, according to our experiments, our new program can solve it with one core in about 2417 years. Thus, it becomes feasible to solve the open problem. For example, if 2417 cores via BOINC are used, the open problem can be solved in one year; and if 24170 cores are used, it can in about 36 days. Hereby, we sincerely thank you for donating your computing resources to sudoku@vtaiwan. Your contribution will greatly help solve this open problem and make the history! Requirement Windows: Microsoft Visual C++ 2008 Redistributable Package |
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
