数独问题相信大家都知道，(不知道的可以上百度搜索)，数独的求解有多种方法。



本算法采用链表方式实现数独问题的求解。采用试算的方法，理论上可求解所有数独问题。



例如如下数独问题



0 3 0 0 0 0 0 0 1

5 0 0 0 0 0 0 8 0

0 0 0 2 0 0 0 0 9

8 0 0 0 0 7 0 0 0

0 0 0 0 0 0 4 0 0

7 0 9 0 8 1 0 0 0

0 7 0 4 0 0 0 0 0

1 0 0 0 0 0 0 0 0

0 5 0 3 0 0 0 0 6



大家可以挑战一下，多长时间能做出来。



采用本程序，可轻松求解(其中0的位置为需要填数的空格)，并输出详细求解过程。



压缩包内含有源代码、makefile文件、编译好的可执行文件，以及如上算例的数据文件，以及计算结果文件。



本算法可能不是数独求解算法中最高效的，然而通过链表方法为数独问题的求解提供了一种有效的求解方法。-Sudoku is an issue that we all know, (I do not know can Baidu search), Sudoku solving a variety of methods. The algorithm for solving Sudoku way to achieve list problem. Using spreadsheet approach, theoretically all Sudoku solving problems. Example, as follows Sudoku Questions 0 3 0 0 0 0 0 0,150,000,008,000,020,000 9,800,007,000,000,000,400 7 0 9 0 8 1 0 0 0 0 7 0 4 0 0 0 0 0,100,000,000,050,300,006 we can challenge it, how long to do it. Using this program, you can easily solve (where 0 is the need to fill the position of number of spaces), and the output of the solution process in detail. Compression package includes source code, makefile files, compiled executable files, and data files as examples, as well as the results file. The algorithm for solving Sudoku may not be the most efficient algorithm, however, list the method by solving several problems alone provides an effective method for solving.