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.3.tar.gz
(15.5 kB
view hashes)
Built Distribution
Close
Hashes for mcts_solver-0.0.3-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 18ad14bb64c1eda33719dca10c04cf11a01426c65ba44e8ff4d2ec0de24752f7 |
|
MD5 | 08dd5bfc763a8333adfa4e125ddc77ae |
|
BLAKE2b-256 | 85c80d55ab1c4a1e61b0ff30cc2ac2d2c147d26b1426d82e815305b7a8a0db59 |