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.4.tar.gz
(15.8 kB
view hashes)
Built Distribution
Close
Hashes for mcts_solver-0.0.4-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 6093876c2955fa71561f9975254e6cca026b1ca36b94a0aa08b120038ea33966 |
|
MD5 | dc328a8554084ad406f5fc88924515c9 |
|
BLAKE2b-256 | c0b0d0e7e488e84d795de765add22749320e2a3c013b691233a9f8e2f3e4be4a |