A New Structured Knight Tour Algorithm by Four Knights with Heuristic Preset Rules

Authors

  • Tan Chi Wee Faculty of Computing, Universiti Teknologi Malaysia, 81310 Johor Bahru, Johor, Malaysia.
  • Nur Hafizah Ghazali School of Computer and Communication Engineering, Universiti Malaysia Perlis, 02600 Arau, Perlis, Malaysia.
  • Ghazali Sulong Faculty of Computing, Universiti Teknologi Malaysia, 81310 Johor Bahru, Johor, Malaysia. School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Nerus, Terengganu, Malaysia.

Keywords:

Heuristic, Knight Tour, Preset Rules, Structural,

Abstract

A Knight Tour problem is an ancient puzzle which remains as a focus of current researcher. The objective of a Knight Tour algorithm is to find out a solution with construct a closed moving path by a knight for visiting each square of a chessboard by only once. This paper proposes a new structural Knight Tour algorithm by four knights moving all together with heuristic preset rules. This new proposed method fulfills any board size of 4n+2 where n>1 with lower execution time and without the needs of any brute force method and backtracking method.

Downloads

Download data is not yet available.

Downloads

Published

2017-10-20

How to Cite

Wee, T. C., Ghazali, N. H., & Sulong, G. (2017). A New Structured Knight Tour Algorithm by Four Knights with Heuristic Preset Rules. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(3-3), 171–175. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2897

Issue

Vol. 9 No. 3-3: Special Issue on Software Engineering I

Section

Articles

License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)