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...
保存先:
主要な著者: | 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, 等
出版事項: (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, 等
出版事項: (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, 等
出版事項: (2013) -
Generating and expanding of an encryption key based on knight tour problem
著者:: Mahmood, A. S., 等
出版事項: (2017) -
Cubic Hamiltonian graphs and generalized knight's tours / Ong Siew Hui
著者:: Ong, Siew Hui
出版事項: (2001)