Nested Monte-Carlo Search with simulation reduction

Authors:
Haruhiko Akiyama;Kanako Komiya;Yoshiyuki Kotani
Affiliations:
Department of Computer and Information Sciences, Tokyo University of Agriculture and Technology, Tokyo, Japan;Institute of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;Institute of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
Venue:
Knowledge-Based Systems
Year:
2012

Citing 6
Cited 1

Morpion Solitaire

Theory of Computing Systems
Combining online and offline knowledge in UCT

Proceedings of the 24th international conference on Machine learning
Nested Monte-Carlo search

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Nested Monte-Carlo Expression Discovery

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Bandit based monte-carlo planning

ECML'06 Proceedings of the 17th European conference on Machine Learning
Single-player Monte-Carlo tree search for SameGame

Knowledge-Based Systems

Bitboard knowledge base system and elegant search architectures for Connect6

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The execution time of Nested Monte-Carlo Search for Morpion Solitaire, a single-player game, increases exponentially with the level of the nested search. We investigated the use of two methods for reducing the execution time in order to enable a deeper nested search: simply reducing the number of lower level searches by a constant rate and using All-Moves-As-First heuristic to the reduction in the number of lower level searches. Testing showed the latter is more effective. Using it, we achieved a new world record of 146 moves for a computer search for the touching version of Morpion Solitaire.