|
|
|
|
A new structured knight tour algorithm by four knights with heuristic preset rules
|
|
|
|
|
|
|
|
نویسنده
|
wee t.c. ,ghazali n.h. ,sulong g.b.
|
|
منبع
|
journal of telecommunication, electronic and computer engineering - 2017 - دوره : 9 - شماره : 3-3 Special Issue - صفحه:171 -175
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Heuristic; Knight tour; Preset rules; Structural
|
|
آدرس
|
faculty of computing,universiti teknologi malaysia,johor bahru,johor, Malaysia, school of computer and communication engineering,universiti malaysia perlis,arau,perlis, Malaysia, faculty of computing,universiti teknologi malaysia,johor bahru,johor,malaysia,school of informatics and applied mathematics,universiti malaysia terengganu,kuala nerus,terengganu, Malaysia
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|