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...
Saved in:
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 |
---|---|
格式: | Conference or Workshop Item |
语言: | English |
出版: |
2013
|
主题: | |
在线阅读: | http://eprints.utem.edu.my/id/eprint/10658/1/2013_Conf._3July_SETNC2013_%283%29.pdf http://eprints.utem.edu.my/id/eprint/10658/ |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
由: Suzanna, Ridzuan Aw, et al.
出版: (2013) -
Application of Binary Particle Swarm Optimization in Automatic Classification of Wood Species using Gray Level Co-Occurence Matrix and K-Nearest Neighbour
由: Syahrul Hisham , Mohamad, et al.
出版: (2013) -
Application of Binary Particle Swarm Optimization in Automatic Classification of Wood Species using Gray Level Co-Occurence Matrix and K-Nearest Neighbor
由: Syahrul Hisham , Mohamad, et al.
出版: (2013) -
Generating and expanding of an encryption key based on knight tour problem
由: Mahmood, A. S., et al.
出版: (2017) -
Cubic Hamiltonian graphs and generalized knight's tours / Ong Siew Hui
由: Ong, Siew Hui
出版: (2001)