A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm

Ismail, Mohd Muzafar and Shair, Ezreen Farina and Mohd Nor, Arfah Syahida and Mohd Shaari Azyze, Nur Latif Azyze and Mohd Karis, Safirin and Jaafar, Hazriq Izzuan and Mohamad, Syahrul Hisham (2013) A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm. In: Science & Engineering Technology National Conference 2013, 3-4 July 2013, Kuala Lumpur, Malaysia..

[img] PDF
Restricted to Registered users only

Download (1MB)


The knight’s tour problem is a sub chess puzzle where the objective of the puzzle is to find combination moves made by a knight so that it visits every square of the chessboard exactly once. This paper proposes a model using Binary Magnetic Optimization Algorithm to solve the problem. Each particle represents a possible solution of the problem. A pair of 3 binary bits is used to represent a move made by the knight for each move. The numerical value for each move can be in the range of 0 to 7 according to the 8 possible moves that can be taken by the knight. The fitness of a particle is then calculated based on the number of legal moves it has taken starting from the first move. The proposed model has been tested using the standard 8x8 chessboard setup. A comparative performance study is done based on two updating rules of Binary Magnetic Optimization Algorithm: sigmoid & tanh functions. Results obtained show that the proposed model has a potential for further improvement.

Item Type: Conference or Workshop Item (Paper)
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Electronics and Computer Engineering > Department of Telecommunication Engineering
Date Deposited: 13 Jan 2014 04:27
Last Modified: 28 May 2015 04:12
URI: http://eprints.utem.edu.my/id/eprint/10658
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item