Freecell Solver: Project Introduction
- A C Library (and some standalone command line programs) for solving Freecell and several similar Solitaire games.
- Aims for:
- Modularity
- Speed
- Reduced memory consumption
- Smart algorithms
- For more information consult the appropriate section of the architecture document.
- Project was started in March 2000, as a way to see if an idea I had for solving Freecell would work. Shortly after, version 0.2.0 was released.
- It evolved through several major versions since then, and is now at stable version 2.8.6 and development version of 2.9.9.
- It was so far integrated into three Freecell implementations: KDE's KPatience, Freecell Pro, and Freecell 3d.
- A collection of the encountered states. (= layouts of the board)
- On one such collection several DFS and Best-First Search scans operate.
- Support for Meta-moves and atomic moves through test functions.
- Several layers (card handling, state handling, scans, instance, front-end).
- A built-in parser for command line arguments that can be used to configure the front-end.