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.

References

L. Euler, “Solution d’une question curieuse que ne paroit soumise a aucune analyse,” in Mémoires de l’Academie Royale des Sciences et Belles Lettres, 1759, pp. 310–337.

I. Parberry, “An efficient algorithm for the Knight’s tour problem,” Discret. Appl. Math., vol. 73, no. 3, pp. 251–260, 1997.

S. S. Lin and C. L. Wei, “Optimal algorithms for constructing knight’s tours on arbitrary n×m chessboards,” Discret. Appl. Math., vol. 146, no. 3, pp. 219–232, 2005.

L. Paris, “Heuristic Strategies for the Knight Tour Problem,” in Proc. Int. Conf. Artif. Intell. IC-AI ’04, Vol. 2 Proc. Int. Conf. Mach. Learn. Model. Technol. Appl. MLMTA ’04, June 21-24, 2004, Las Vegas, Nevada, USA, pp. 4–8, 2004.

R. Borrell, “A brute force approach to solving the knight’s tour problem using Prolog,” in Proc. 2009 Int. Conf. Artif. Intell. ICAI 2009, vol. 2, 2009.

M. M. Ismail, A.F. Zainal Abidin, S. Widiyanto, M.H. Misran, M. Alice, N.A. Nordin, E.F. Shair, S.M. Mustaza, M.N. Shah Zainudin, “Solving Knight’s tour problem using firefly algorithm,” in the Proc. 3rd Int. Conf. Eng. ICT, no. April, pp. 5–8, 2012.

W. W. R. Ball, Mathematical Recreations and Essays, 12th ed. New York, USA: MacMillan, 1939.

H. E. Dudeney, Amusements in Mathematics, Thomson Nelson and Sons Ltd. London, 1917.

A. P. Domoryad, Mathematical Games and Pastimes. Oxford, 1964.

S. P. Hurd and D. A. Trautman, “The Knight’s Tour on the 15-puzzle,” Math. Mag., vol. 66, no. 3, p. 159, Jun. 1993.

K. Lim, “The Knight’s tour,” Parabola, no. 1, UNSW Australia, Sydney, 1981.

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

TRANSFER OF COPYRIGHT AGREEMENT

The manuscript is herewith submitted for publication in the Journal of Telecommunication, Electronic and Computer Engineering (JTEC). It has not been published before, and it is not under consideration for publication in any other journals. It contains no material that is scandalous, obscene, libelous or otherwise contrary to law. When the manuscript is accepted for publication, I, as the author, hereby agree to transfer to JTEC, all rights including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the author(s) specifically retain(s):

  1. All proprietary right other than copyright, such as patent rights
  2. The right to make further copies of all or part of the published article for my use in classroom teaching
  3. The right to reuse all or part of this manuscript in a compilation of my own works or in a textbook of which I am the author; and
  4. The right to make copies of the published work for internal distribution within the institution that employs me

I agree that copies made under these circumstances will continue to carry the copyright notice that appears in the original published work. I agree to inform my co-authors, if any, of the above terms. I certify that I have obtained written permission for the use of text, tables, and/or illustrations from any copyrighted source(s), and I agree to supply such written permission(s) to JTEC upon request.