Arrow Research search
Back to SoCS

SoCS 2012

MCTS Based on Simple Rerget

Conference Paper Extended Abstracts of Papers Presented Elsewhere Algorithms and Complexity · Artificial Intelligence · Automated Planning and Scheduling

Abstract

UCT, a state-of-the art algorithm for Monte Carlo tree search (MCTS), is based on UCB, a policy for the Multi-armed Bandit problem (MAB) thatminimizes the cumulative regret. However, search differs from MAB inthat in MCTS it is usually only the final ``arm pull

Authors

Keywords

  • mcts
  • uct
  • voi
  • metareasoning

Context

Venue
International Symposium on Combinatorial Search
Archive span
2010-2024
Indexed papers
598
Paper id
616583317799351992
v2026.09.27