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

• Main Authors: Suzanna, Ridzuan Aw, Mohd Muzafar, Ismail, Amar Faiz, Zainal Abidin, Nur Anis, Nordin, Seri Mastura, Mustaza, Ezreen Farina, Shair, Asrani, Lit, Arfah Syahida, Mohd Noor, Nur Latif Azyze, Mohd Shaari Azyze, Ahmad Rijal, Abdul Rahman, Ili Najaa, Aimi, Safirin, Mohd Karis, Amira Sarayati, Ahmad Dahlan
• Format: Proceeding
• Language: English
• Published: 2013
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://ir.unimas.my/id/eprint/41648/3/A%20Preliminary%20-%20Copy.pdf; http://ir.unimas.my/id/eprint/41648/; https://conferencealerts.com/show-event?id=110402

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.