Skip to main content
CS Colloquium | November 20, 2003

Solving The Knight's Tour With A Genetic Algorithm

Vahl Scott Gordon, California State University, Sacramento

Stevenson Hall 1300
11:00 AM - 11:50 AM

In this follow-on to last year's presentation, a genetic algorithm is used to to solve the 8x8 knight's tour problem, and its performance is compared against standard depth-first search with backtracking. Depth-first search finds more solutions undercertain conditions, but the genetic algorithm finds solutions more consistently for arbitrary initial conditions.