Dynamic Resource Allocation for Ensemble Determinization MCTS
Simulation-based algorithms are especially suited for high-uncertainty environments such as adversarial board games with significant elements of randomness and hidden information. In particular, several Monte Carlo Tree Search (MCTS) variants are commonly used in such domains. In this paper, we propose a series of enhancements for Ensemble Determinization MCTS, introducing two axes for dynamic resource allocation. First, Dynamic Number of Determinizations, increases or decreases the number of currently used determinization trees depending on the behavior of so-far search. Second, Dynamic Simul
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- PossiblePossibly related (embedding) · 48%kuzmenkoff/exec_magica_engine →
- LinkedLinked via arxiv author · 85%Jakub Kowalski →
“Dynamic Resource Allocation for Ensemble Determinization MCTS”
- LinkedLinked via arxiv author · 85%Adam Ciężkowski →
“Dynamic Resource Allocation for Ensemble Determinization MCTS”
- LinkedLinked via arxiv author · 85%Artur Krzyżyński →
“Dynamic Resource Allocation for Ensemble Determinization MCTS”
- LinkedLinked via arxiv author · 85%Mark H. M. Winands →
“Dynamic Resource Allocation for Ensemble Determinization MCTS”