By Topic

The knight's tour - evolutionary vs. depth-first search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gordon, V.S. ; California State Univ., Sacramento, CA, USA ; Slocum, T.J.

A genetic algorithm is used to find solutions to the standard 8×8 knight's tour problem, and its performance is compared against standard depth-first search with backtracking. The binary encoding is described, along with a simple repair technique which can be used to extend tours that have reached impasse. The repair method is powerful enough on its own to find complete tours, given randomly generated bitstrings. But when used in conjunction with a genetic algorithm, considerably more solutions are found. Depth-first search is shown to find more solutions under certain conditions, but the genetic algorithm finds solutions more consistently for arbitrary initial conditions.

Published in:

Evolutionary Computation, 2004. CEC2004. Congress on  (Volume:2 )

Date of Conference:

19-23 June 2004