Imagawa et al., 2015 - Google Patents
Enhancements in monte carlo tree search algorithms for biased game treesImagawa et al., 2015
- Document ID
- 14941388267037188508
- Author
- Imagawa T
- Kaneko T
- Publication year
- Publication venue
- 2015 IEEE Conference on Computational Intelligence and Games (CIG)
External Links
Snippet
Monte Carlo tree search (MCTS) algorithms have been applied to various domains and achieved remarkable success. However, it is relatively unclear what game properties enhance or degrade the performance of MCTS, while the largeness of search space …
- 238000005070 sampling 0 abstract description 20
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ontanón | Combinatorial multi-armed bandits for real-time strategy games | |
| Dereszynski et al. | Learning probabilistic behavior models in real-time strategy games | |
| Gelly et al. | Monte-Carlo tree search and rapid action value estimation in computer Go | |
| Balint et al. | Choosing probability distributions for stochastic local search and the role of make versus break | |
| Cowling et al. | Ensemble determinization in monte carlo tree search for the imperfect information card game magic: The gathering | |
| Perez Liebana et al. | Open loop search for general video game playing | |
| Cazenave | Generalized rapid action value estimation | |
| Imagawa et al. | Enhancements in monte carlo tree search algorithms for biased game trees | |
| US20240160921A1 (en) | System and method for multi-task learning | |
| Fern et al. | Ensemble monte-carlo planning: An empirical study | |
| Ramanujan et al. | Understanding sampling style adversarial search methods | |
| Yang et al. | Guiding Monte Carlo tree search by scripts in real-time strategy games | |
| Lanctot et al. | Monte Carlo*-minimax search | |
| Zhao et al. | Winning tracker: A new model for real-time winning prediction in moba games | |
| Beheshtian-Ardakani et al. | CMPN: Modeling and analysis of soccer teams using Complex Multiplex Passing Network | |
| Wu | Designing a winning Arimaa program | |
| Magnuson | Monte carlo tree search and its applications | |
| Melkó et al. | Optimal strategy in games with chance nodes | |
| Gudmundsson et al. | Sufficiency-based selection strategy for MCTS | |
| Jalovaara | Win probability estimation for strategic decision-making in esports | |
| Godlewski et al. | MCTS based agents for multistage single-player card game | |
| Moraes et al. | Asymmetric Action Abstractions for Planning in Real-Time Strategy Games | |
| Zimmer et al. | Player Behavior Analysis for Predicting Player Identity Within Pairs in Esports Tournaments: A Case Study of Counter-Strike Using Binary Random Forest Classifier | |
| Rutko | Fuzzified tree search in real domain games | |
| Ontanon | Experiments on learning unit-action models from replay data from rts games |