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

• Main Authors: Ismail, Mohd Muzafar, Shair, Ezreen Farina, Mohd Nor, Arfah Syahida, Mohd Shaari Azyze, Nur Latif Azyze, Mohd Karis, Safirin, Jaafar, Hazriq Izzuan, Mohamad, Syahrul Hisham
• Format: Conference or Workshop Item
• Language: English
• Published: 2013
• Subjects: TK Electrical engineering. Electronics Nuclear engineering
• Online Access: http://eprints.utem.edu.my/id/eprint/10658/1/2013_Conf._3July_SETNC2013_%283%29.pdf; http://eprints.utem.edu.my/id/eprint/10658/

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...