mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-29 11:00:29 +00:00
5f13a87ce7
This method temperate the habit of Monte-Carlo based algorithms to repeatedly create new nodes. It was first implemented in `Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search` by Rémi Coulom. |
||
---|---|---|
.. | ||
ChessEngine.cpp | ||
ChessEngine.h | ||
CMakeLists.txt | ||
main.cpp | ||
MCTSTree.cpp | ||
MCTSTree.h |