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: | , , , , , , |
|---|---|
| 格式: | 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/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|