![]() What I would like to have for the next release, is a generic way to order derived positions, implementing all of the random, mine, and Tom's back-ends, and an ability to implement more in the future. Aside for that, there is also the prioritization Tom Holroyd implemented for Patsolve. Currently there is a code for a state prioritization that is used in the best-first-search code. What can be done, is to order the derived states based on some parameters, other than simply randomizing them. FCS (= Freecell Solver) groups the lists into test groups, and then either try them one by one, or randomizes them. Each one of those functions corresponds to one move type, and they output the derived states in the order they found them. Tasks to be Considered in the Future Derived State Ordering and Incorporating Patsolve's Logicįrom any given position Freecell Solver reaches it uses some move functions to generate a list of subsequent positions that can be reached from it. A Client/Server Multi-tasking Architecture.Converting the Install Procedure to SCons.Generalising Freecell Solver to non-card Games.A provably correct solver for Freecell and similar games (with a verified proof).Derived State Ordering and Incorporating Patsolve's Logic.Note that it is possible to work on Freecell Solver if you would like to give or get academic credit. It is based on the to-do list file, but is more elaborated and detailed. This page hopes to address some of the long-term, primary issues in which I'd like to enhance it in the future. While Freecell Solver is a fairly usable package that satisfies the needs of a large part of the users, it is by no means complete. Use Online Firefox, Chrome, Opera, or IE10+ About
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |