![]() |
|
|
of the company MIBS. The first version was built in 3 days to show the power of this technique. Now a second version has been built in 2 weeks. This article describes which examples this version can solve. SUDOKU game is today a very popular game. The basic rule is that all rows, colons and the 4 3X3 squares must contain the numbers 1, 2, 3, 4, 5, 6, 7, 8 and 9. In my previous article I mentioned 2 rules which are now implemented in this version. Also a third rule has been implanted. This last rule was not mentioned in the previous article and is. None empty cells can not be updated. This rules looks maybe strange but the consequence is that this rule can be combined with rule 2. The elimination rules: this is based on the fact when a digit occurs somewhere than all other cells of the corresponding row, colon or square can not have that value. In some cases you can eliminate all the open cells in a row or colon or square with exception of one. In such a case the value of the cell is the digit. Why is rule 3 important for rule 2? An example will show this. Suppose cell G2 has the value 8. In this case cell G2 can not contain other value, this information is important for rule 2. The last rule completes the second rules and the results are very good. However before evaluating this version, a classification of the complexity of SUDOKU is given hereafter.
I have run this solver with many examples and the results are.
Maybe you can ask what is this manual input ? Because as already mentioned. Im not a SUDOKU player. Well as mentioned in my previous article this solver gives you also the potential cells with their possible values. In all the cases where the square was not completed those cells had 2 possible values. So with 2 tests (with a manual update of this cell) and those squares are solved. You are now able to solve SUDOKU squares without having the solution and saving a lot of effort |


加入最爱