prbnmcn-mctsversion
Monte-Carlo tree search based on UCB1 bandits
This library provides a monadic API to describe lazily evaluated, finitely branching trees. It allows to use Monte-Carlo tree search to perform reward-guided exploration of these trees.
| Author | Ilias Garnier |
|---|---|
| License | MIT |
| Published | |
| Homepage | http://github.com/igarnier/prbnmcn-mcts |
| Issue Tracker | http://github.com/igarnier/prbnmcn-mcts |
| Maintainer | igarnier@protonmail.com |
| Dependencies |
|
| Source [http] | https://github.com/igarnier/prbnmcn-mcts/archive/refs/tags/0.0.2.tar.gz md5=bc21c58f681780879d82e783bcd3deba sha512=7be82aff6a4f5db7423e8f986654c338d69eae72a6d2fcd6f9ab4719384ba29b988eb6d5282dea086771bb726170a3a80a15a3c0276aebe84fc003d34c61ded1 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/prbnmcn-mcts/prbnmcn-mcts.0.0.2/opam |
No package is dependent
