By Topic

Solution to the Tic-Tac-Toe Problem Using Hamming Distance Approach in a Neural Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rajani, N.F. ; Dept. of Inf. Syst., BITS Pilani, Pilani, India ; Dar, G. ; Biswas, R. ; Ramesha, C.K.

Paper focuses on developing an algorithm using a Hamming Distance Classifier in Neural Networks to find the most optimal move to be made in the Tic-Tac-Toe problem such that the game always ends in a win or a draw. The basic step involves an eight-class Hamming network which has nine inputs corresponding to each cell of the grid and eight outputs respectively. The algorithm computes the Hamming Distance of the current input configuration as compared to the weight matrix and the maximum of the output corresponds to the minimum distance. The iterative step is carried out to anticipate the next move for every possible current move. The hamming distance of all the iterations is added to basic step and the gross maximum gives the most profitable move. The algorithm proceeds such that the neural network prefers to itself win rather than preventing the opponent from winning in least possible moves.

Published in:

Intelligent Systems, Modelling and Simulation (ISMS), 2011 Second International Conference on

Date of Conference:

25-27 Jan. 2011