A New Structured Knight Tour Algorithm by Four Knights with Heuristic Preset Rules
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
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Journal of Telecommunication, Electronic and Computer Engineering
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)