GA-freecell: Evolving solvers for the game of FreeCell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

We evolve heuristics to guide staged deepening search for the hard game of FreeCell, obtaining top-notch solvers for this NP-Complete, human-challenging puzzle. We first devise several novel heuristic measures and then employ a Hillis-style coevolutionary genetic algorithm to find efficient combinations of these heuristics. Our results significantly surpass the best published solver to date by three distinct measures: 1) Number of search nodes is reduced by 87%; 2) time to solution is reduced by 93%; and 3) average solution length is reduced by 41%. Our top solver is the best published Free-Cell player to date, solving 98% of the standard Microsoft 32K problem set, and also able to beat high-ranking human players.

Original languageEnglish
Title of host publicationGenetic and Evolutionary Computation Conference, GECCO'11
Pages1931-1938
Number of pages8
DOIs
StatePublished - 24 Aug 2011
Event13th Annual Genetic and Evolutionary Computation Conference, GECCO'11 - Dublin, Ireland
Duration: 12 Jul 201116 Jul 2011

Publication series

NameGenetic and Evolutionary Computation Conference, GECCO'11

Conference

Conference13th Annual Genetic and Evolutionary Computation Conference, GECCO'11
Country/TerritoryIreland
CityDublin
Period12/07/1116/07/11

Keywords

  • FreeCell puzzle
  • Genetic algorithms
  • Heuristics
  • Hyper-heuristics
  • Single-agent search

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'GA-freecell: Evolving solvers for the game of FreeCell'. Together they form a unique fingerprint.

Cite this