Pruning Stochastic Game Trees Using Neural Networks for Reduced Action Space Approximation
Monte Carlo Tree Search has proved to be very efficient in the broad domain of Game AI, though it suffers from high dimensionality in cases of large branching factors. Several pruning techniques have been proposed to tackle this problem, most of which require explicit domain knowledge. In this study...
Main Authors: | Tasos Papagiannis, Georgios Alexandridis, Andreas Stafylopatis |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-05-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/9/1509 |
Similar Items
-
<inline-formula><tex-math notation="LaTeX">$\mathsf{HyHooVer}$</tex-math></inline-formula>: Verification and Parameter Synthesis in Stochastic Systems With Hybrid State Space Using Optimistic Optimization
by: Negin Musavi, et al.
Published: (2023-01-01) -
Nonstationary Stochastic Bandits: UCB Policies and Minimax Regret
by: Lai Wei, et al.
Published: (2024-01-01) -
A Fast Algorithm for Estimating Two-Dimensional Sample Entropy Based on an Upper Confidence Bound and Monte Carlo Sampling
by: Zeheng Zhou, et al.
Published: (2024-02-01) -
Pagando para vencer: Cultura, Agência e Bens Virtuais em Video Games
by: Thiago Falcão, et al.
Published: (2017-08-01) -
Transfer restless multi-armed bandit policy for energy-efficient heterogeneous cellular network
by: Navikkumar Modi, et al.
Published: (2019-10-01)