FreeCell AI implementing BFS/DFS/A*/Iterative Deepening in Python
-
Updated
May 11, 2021 - Python
FreeCell AI implementing BFS/DFS/A*/Iterative Deepening in Python
Freecell solitaire Solver Project for Artificial Intelligence course from University of Macedonia
Solve any FreeCell Solitaire puzzle with 1 of the 4 different path finding algorithms: Breadth 1st Search, Depth 1st Search, Best 1st Search, Astar Search.
Fork with improvements over ncurses freecell implementation by Linus Akesson
This program solves freecell solitaire puzzles using four algorithms: Depth first search, Breadth first search, Best first search and A*
Web-based FreeCell game and solver, supporting Microsoft game numbers up to a billion.
Windows XP FreeCell AI Solver
A comprehensive, feature-rich, open source, and portable, collection of Solitaire games.
Freecell Solver - a C library for automatically solving Freecell and some other variants of card Solitaire
Add a description, image, and links to the freecell-solver topic page so that developers can more easily learn about it.
To associate your repository with the freecell-solver topic, visit your repo's landing page and select "manage topics."