Solving Sudoku Puzzles by using Hopfield Neural Networks

摘要

In this paper two different approaches to solve Sudoku puzzles with neural networks are presented. The first approach is proposed by JJ. Hopfield. He tries to solve the Sudoku puzzle with help of a Hopfield network and treated the problem as an integer optimization problem that is also used for the solution of the well known Traveling Salesmen Problem (TSP). Second solution uses the Hopfield network with an extension, called co-processor. Since neural networks can exactly solve linear programming problems, such a network can be used as co-processor to improve the performance of the Hopfield network. Combination of both networks, where the Hopfield network was used first, was able to solve a lot of puzzles.