Of course, there are many Sudoku solvers already available as open source projects, but I did not want to use any of those, because I was looking for a 'just for fun' project. Some time ago I started to develop a 'Sudoku Solver' using Python. We illustrate encouraging experimental results where our approach noticeably competes with the best approximate methods reported in the literature. This integration leads to a more efficient domain filtering and as a consequence to a faster solving process. The geometric operators allow one to correctly move toward promising regions of the combinatorial space, while the prefiltering phases are able to previously delete from domains the values that do not conduct to any feasible solution. In this paper, we present a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations.
This game is known to be NP-complete, with existing various complete and incomplete search algorithms able to solve different instances of it. The classic Sudoku consists in filling a 9 9 grid, divided into nine 3 3 regions, so that each column, row, and region contains different digits from 1 to 9.
The Sudoku is a famous logic-placement game, originally popularized in Japan and today widely employed as pastime and as testbed for search algorithms.
0 kommentar(er)
