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: | Suzanna, Ridzuan Aw, Mohd Muzafar, Ismail, Amar Faiz, Zainal Abidin, Nur Anis, Nordin, Seri Mastura, Mustaza, Ezreen Farina, Shair, Asrani, Lit, Arfah Syahida, Mohd Noor, Nur Latif Azyze, Mohd Shaari Azyze, Ahmad Rijal, Abdul Rahman, Ili Najaa, Aimi, Safirin, Mohd Karis, Amira Sarayati, Ahmad Dahlan |
---|---|
Format: | Proceeding |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://ir.unimas.my/id/eprint/41648/3/A%20Preliminary%20-%20Copy.pdf http://ir.unimas.my/id/eprint/41648/ https://conferencealerts.com/show-event?id=110402 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm
by: Ismail, Mohd Muzafar, et al.
Published: (2013) -
Watermarking scheme using slantlet transform and enhanced knight tour algorithm for medical images
by: Tan, Chi Wee
Published: (2018) -
A new steganography technique using knight’s tour algorithm, affine cipher and huffman coding
by: Mohsin, Alla Talib
Published: (2013) -
Enhanced LSB image steganography method using knight tour algorithm, vigenere encryption and LZW compression
by: Bashardoost, Morteza, et al.
Published: (2013) -
Generating and expanding of an encryption key based on knight tour problem
by: Mahmood, A. S., et al.
Published: (2017)