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.5.tar.gz
(15.9 kB
view hashes)
Built Distribution
Close
Hashes for mcts_solver-0.0.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 7519f370c0971def34776db3194223d87586c37a651cd3e3736e1f9af295121f |
|
MD5 | 90eca0695c7d4601d488543e9447c3a4 |
|
BLAKE2b-256 | 0a5195597be69503b1470d27c03da4d011eb04fdb0141c77d8ccba1eb59024cb |