Knight’s Tours Using a Neural Network | DmitryBrant.com
Menu Knight’s Tours Using a Neural Network There was a paper in an issue of Neurocomputing that got me intrigued: it spoke of a neural network solution to the knight’s tour problem. I decided to write a quick C++ implementation to see for myself, and the results, although limited, were thoroughly fascinating. The neural network is designed such that each legal knight’s move on the chessboard is represented by a neuron. Therefore, the network basically takes the shape of the knight’s graph over an \(n \times n\) chess board. (A knight’s graph is simply the set of all knight moves on the board) Each neuron can be either “active” or “inactive” (output of 1 or 0). If a neuron is active, it is considered part of the solution to the knight’s tour. Once the network is started, each active neuron is configured so that it reaches a “stable” state if and only if it has exactly two neighboring neurons that are also active (otherwise, the state of the neuron changes).Read full article from Knight’s Tours Using a Neural Network | DmitryBrant.com
No comments:
Post a Comment