Monte-Carlo tree search solver for chess-ant
Project description
mcts-solver
Monte-Carlo tree search solver for chess-ant.
This is a part of Chess-Ant project and based on pseudocode from the following paper: Winands, Mark & Björnsson, Yngvi & Saito, Jahn-Takeshi. (2008). Monte-Carlo Tree Search Solver. 25-36. 10.1007/978-3-540-87608-3_3.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
mcts_solver-0.0.2.tar.gz
(3.2 kB
view hashes)
Built Distribution
Close
Hashes for mcts_solver-0.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 869bc0c7337c6c53e4b71f9e952ec75832ac846405374ff28e4545a2409fd404 |
|
MD5 | 013c9316142214c53dee98f960634d64 |
|
BLAKE2b-256 | 3936da7123df4bfd0774aecb309b3ddfa7acb32a283c62c30c8b67a2d119e2f8 |