Visualiser for Solitaire game graphs. You can interact with it online here.
Set the timeout to whatever you wish; the performance of the webpage is proportional to the graph size, so if it's too slow, drop this lower to get a smaller graph.
BFS_TIMEOUT_S=0.1 docker compose upAccess the web app on http://localhost:8080.
By default, the graph will be explored by a breadth-first search (BFS) until the timout. Alternatively, by setting WITH_DFS=true as below, it will first explore down a single path, depth-first, using a simple heuristic for the best move in each state. Once no more moves can be made, the BFS is done from every node in the path. Using this heuristic makes it possible to find the winning state, which will be labelled if found.
WITH_DFS=true BFS_TIMEOUT_S=0.1 docker compose upDepends on:
cmakenpm
$ mkdir build
$ cd build
$ cmake ..
$ cmake --build .cmake --build . --target testscmake --build . --target lint(Requires cpplint and cppcheck.)
cmake --build . --target format(Requires clang-format.)
