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/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料