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.1.tar.gz
(2.9 kB
view hashes)
Built Distribution
Close
Hashes for mcts_solver-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 91846e4261cb7a158423129bea337e13b9c5d3afb85b9e06c70224637a9b977c |
|
MD5 | aa25ecfc662baa1b19cdeecb1e395681 |
|
BLAKE2b-256 | c4d220484c7c5135b1204738923d2b32d7d0a9fd38850635b52e76c870632234 |