Robin Schmöcker

Grouping Nodes with known Value Differences: A lossless UCT-based Abstraction Algorithm

A core challenge of Monte Carlo Tree Search (MCTS) is its sample efficiency, which can be addressed by building and using state and/or state-action pair abstractions in parallel to the tree search, such that information can be shared among nodes of the same layer. On the Go Abstractions in Upper Con…