NDLI: Beam Monte-Carlo Tree Search

Content Provider	IEEE Xplore Digital Library
Author	Baier, H. Winands, M.H.M.
Copyright Year	2012
Description	Author affiliation: Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands (Baier, H.; Winands, M.H.M.)
Abstract	Monte-Carlo Tree Search (MCTS) is a state-of-the-art stochastic search algorithm that has successfully been applied to various multi- and one-player games (puzzles). Beam search is a search method that only expands a limited number of promising nodes per tree level, thus restricting the space complexity of the underlying search algorithm to linear in the tree depth. This paper presents Beam Monte-Carlo Tree Search (BMCTS), combining the ideas of MCTS and beam search. Like MCTS, BMCTS builds a search tree using Monte-Carlo simulations as state evaluations. When a predetermined number of simulations has traversed the nodes of a given tree depth, these nodes are sorted by their estimated value, and only a fixed number of them is selected for further exploration. In our experiments with the puzzles SameGame, Clickomania and Bubble Breaker, BMCTS significantly outperforms MCTS at equal time controls. We show that the improvement is equivalent to an up to four-fold increase in computing time for MCTS.
Starting Page	227
Ending Page	233
File Size	388047
Page Count	7
File Format	PDF
ISBN	9781467311939
e-ISBN	9781467311946
e-ISBN	9781467311922
DOI	10.1109/CIG.2012.6374160
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-09-11
Publisher Place	Spain
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Monte Carlo methods Tiles Computational modeling Conferences Games Color Convergence
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Monte-Carlo tree search in Ms. Pac-Man

Enhancements for Monte-Carlo Tree Search in Ms Pac-Man

αβ-based play-outs in Monte-Carlo Tree Search

Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess

Knowledge Complement for Monte Carlo Tree Search: An Application to Combinatorial Games

Using Local Regression in Monte Carlo Tree Search

Monte Carlo Tree Search applied to co-operative problems

Parallel Monte Carlo Search for Imperfect Information Game Daihinmin

Monte-Carlo Tree Search and minimax hybrids

Beam Monte-Carlo Tree Search

Similar Documents

Monte-Carlo tree search in Ms. Pac-Man

Enhancements for Monte-Carlo Tree Search in Ms Pac-Man

αβ-based play-outs in Monte-Carlo Tree Search

Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess

Knowledge Complement for Monte Carlo Tree Search: An Application to Combinatorial Games

Using Local Regression in Monte Carlo Tree Search

Monte Carlo Tree Search applied to co-operative problems

Parallel Monte Carlo Search for Imperfect Information Game Daihinmin

Monte-Carlo Tree Search and minimax hybrids

Beam Monte-Carlo Tree Search