Sciweavers

85 search results - page 2 / 17
» Heuristics in Monte Carlo Go
Sort
View
ACG
2006
Springer
13 years 11 months ago
A Phantom-Go Program
Abstract. This paper presents a Phantom Go program. It is based on a MonteCarlo approach. The program plays Phantom Go at an intermediate level.
Tristan Cazenave
ACG
2009
Springer
13 years 12 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
CIG
2006
IEEE
13 years 11 months ago
Monte-Carlo Go Reinforcement Learning Experiments
Abstract— This paper describes experiments using reinforcement learning techniques to compute pattern urgencies used during simulations performed in a Monte-Carlo Go architecture...
Bruno Bouzy, Guillaume Chaslot
CG
2006
Springer
13 years 9 months ago
Monte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
Jahn-Takeshi Saito, Guillaume Chaslot, Jos W. H. M...
CIG
2005
IEEE
13 years 11 months ago
Combining Tactical Search and Monte-Carlo in the Game of Go
We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting go...
Tristan Cazenave, Bernard Helmstetter