Skip to Main content Skip to Navigation
Conference papers

Comparative Study of Monte-Carlo Tree Search and Alpha-Beta Pruning in Amazons

Abstract : The game of Amazons is a combinatorial game sharing some properties of both chess and Go.We study programs which play Amazons with strategies based on Monte-Carlo Tree Search and a classical search algorithm, Alpha-Beta pruning.We execute several experiments to investigate the effect of increasing the number of searches in a Monte-Carlo Tree Search program. We show that increasing the number of searches is not an efficient method to strengthen the program for Amazons. On the other hand, augmenting the algorithms with a choice of several evaluation functions fulfills has great influence on playing strength.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01466213
Contributor : Hal Ifip <>
Submitted on : Monday, February 13, 2017 - 2:30:47 PM
Last modification on : Thursday, March 5, 2020 - 4:47:16 PM
Long-term archiving on: : Sunday, May 14, 2017 - 2:08:58 PM

File

978-3-319-24315-3_14_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Hikari Kato, Szilárd Fazekas, Mayumi Takaya, Akihiro Yamamura. Comparative Study of Monte-Carlo Tree Search and Alpha-Beta Pruning in Amazons. 3rd International Conference on Information and Communication Technology-EurAsia (ICT-EURASIA) and 9th International Conference on Research and Practical Issues of Enterprise Information Systems (CONFENIS), Oct 2015, Daejon, South Korea. pp.139-148, ⟨10.1007/978-3-319-24315-3_14⟩. ⟨hal-01466213⟩

Share

Metrics

Record views

382

Files downloads

2858