表紙画像

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
主題:
TK Electrical engineering. Electronics Nuclear engineering
オンライン･アクセス:http://eprints.utem.edu.my/id/eprint/10658/1/2013_Conf._3July_SETNC2013_%283%29.pdf
http://eprints.utem.edu.my/id/eprint/10658/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
id my.utem.eprints.10658
record_format eprints
spelling my.utem.eprints.106582015-05-28T04:12:39Z http://eprints.utem.edu.my/id/eprint/10658/ A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm 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 TK Electrical engineering. Electronics Nuclear engineering 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 represents a possible solution of the problem. A pair of 3 binary bits is used to represent a move made by the knight for each move. The numerical value for each move can be in the range of 0 to 7 according to the 8 possible moves that can be taken by the knight. The fitness of a particle is then calculated based on the number of legal moves it has taken starting from the first move. The proposed model has been tested using the standard 8x8 chessboard setup. A comparative performance study is done based on two updating rules of Binary Magnetic Optimization Algorithm: sigmoid & tanh functions. Results obtained show that the proposed model has a potential for further improvement. 2013-07-03 Conference or Workshop Item PeerReviewed application/pdf en http://eprints.utem.edu.my/id/eprint/10658/1/2013_Conf._3July_SETNC2013_%283%29.pdf Ismail, Mohd Muzafar and Shair, Ezreen Farina and Mohd Nor, Arfah Syahida and Mohd Shaari Azyze, Nur Latif Azyze and Mohd Karis, Safirin and Jaafar, Hazriq Izzuan and Mohamad, Syahrul Hisham (2013) A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm. In: Science & Engineering Technology National Conference 2013, 3-4 July 2013, Kuala Lumpur, Malaysia..
institution Universiti Teknikal Malaysia Melaka
building UTEM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknikal Malaysia Melaka
content_source UTEM Institutional Repository
url_provider http://eprints.utem.edu.my/
language English
topic TK Electrical engineering. Electronics Nuclear engineering
spellingShingle TK Electrical engineering. Electronics Nuclear engineering
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
A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
description 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 represents a possible solution of the problem. A pair of 3 binary bits is used to represent a move made by the knight for each move. The numerical value for each move can be in the range of 0 to 7 according to the 8 possible moves that can be taken by the knight. The fitness of a particle is then calculated based on the number of legal moves it has taken starting from the first move. The proposed model has been tested using the standard 8x8 chessboard setup. A comparative performance study is done based on two updating rules of Binary Magnetic Optimization Algorithm: sigmoid & tanh functions. Results obtained show that the proposed model has a potential for further improvement.
format Conference or Workshop Item
author 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
author_facet 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
author_sort Ismail, Mohd Muzafar
title A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
title_short A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
title_full A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
title_fullStr A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
title_full_unstemmed A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
title_sort preliminary study on solving knight’s tour problem using binary magnetic optimization algorithm
publishDate 2013
url http://eprints.utem.edu.my/id/eprint/10658/1/2013_Conf._3July_SETNC2013_%283%29.pdf
http://eprints.utem.edu.my/id/eprint/10658/
_version_ 1665905430244622336
score 13.251813

類似資料