Optimal Solitaire Game Solutions using A* Search and Deadlock Analysis

Paul, Gerald and Helmert, Malte. (2016) Optimal Solitaire Game Solutions using A* Search and Deadlock Analysis. In: Proceedings of the Ninth Annual Symposium on Combinatorial Search (SoCS 2016). pp. 135-136.

PDF - Published Version

Official URL: http://edoc.unibas.ch/53329/

Downloads: Statistics Overview


We propose an efficient method for determining optimal solutions to such skill-based solitaire card games as Freecell. We use A* search with an admissible heuristic function based on analyzing a directed graph whose cycles represent deadlock situations in the game state. To the best of our knowledge, ours is the first algorithm that efficiently determines optimal solutions for Freecell games. We believe that the underlying ideas should be applicable not only to games but also to other classical planning problems which manifest deadlocks.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Helmert, Malte
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
edoc DOI:
Last Modified:20 Nov 2018 10:33
Deposited On:10 Oct 2017 14:50

Repository Staff Only: item control page