The Monte-Carlo Approach in Amazons
by
Julien Kloetzer
,
Hiroyuki Iida
,
Bruno Bouzy
| Citations: | 2 - 1 self |
BibTeX
@MISC{Kloetzer_themonte-carlo,
author = {Julien Kloetzer and Hiroyuki Iida and Bruno Bouzy},
title = {The Monte-Carlo Approach in Amazons},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. The game of the Amazons is a quite new game whose rules stand between the game of Go and Chess. Its main difficulty in terms of game programming is the huge branching factor. Monte-Carlo is a method used in game programming which allows us to overcome easily this problem. This paper presents how the Monte-Carlo method can be best adapted to Amazon programming to obtain a good level program, and improvements that can be added to it. 1
Citations
| 33 | Expected-outcome: a general model of static evaluation - Abramson - 1990 |
| 3 | R.: Selective Search in an Amazons Program - Avetisyan, Lorentz - 2002 |
| 2 | Remi Munos, Olivier Teytaud, Modifications of UCT with Patterns in Monte-Carlo Go - Gelly, Wang |
| 1 | Bouzy (2005), Associating knowledge and Monte Carlo approaches within a go program - Bruno - 2005 |
| 1 | Bouzy (2005), Move Pruning Techniques for Monte-Carlo Go - Bruno - 2005 |
| 1 | Csaba Szepesvari (2006), Bandit based Monte-Carlo planning - Kocsis - 2006 |
| 1 | Lieberum (2005), An evaluation function for the game of Amazons Theoretical computer science 349 - Jens - 2005 |
