Peg Solitaire game solved by genetic algorithm
I’m currently trying to publish some old projects done in my school period. Few days ago I retrieved a paper written in 2002 (in french) about the resolution of the Peg Solitaire game. It’s a NP-complet game. However with the use of genetic algorithm, backtracking technics and the symmetry of the problem, a solution (i.e. a sequence of steps) can be found in few seconds. See the document solitaire.pdf.