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

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

Full description

Bibliographic Details

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:	en
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
Tags:	Add Tag No Tags, Be the first to tag this record!