We describe two Go programs, OLGA and OLEG, developed by a Monte-Carlo approach that is simpler than Bruegmann's (1993) approach. Our method is based on Abramson (1990). We performed experiments, to assess ideas on (1) progressive pruning, (2) all moves as first heuristic, (3) temperature, (4) simulated annealing, and (5) depth-two tree search within the Monte-Carlo framework. Progressive pruning and the all moves as first heuristic are good speed-up enhancements that do not deteriorate the level of the program too much. Then, using a constant temperature is an adequate and simple heuristic that is about as good as simulated annealing. The depth-two heuristic gives deceptive results at the moment. The results of our Monte-Carlo programs against knowledge-based programs on 9×9 boards are promising. Finally, the ever-increasing power ofcomputers lead us to think that Monte-Carlo approaches are worth considering for computer Go in the future. © 2004 by Springer Science+Business Media New York.
CITATION STYLE
Bouzy, B., & Helmstetter, B. (2004). Monte-Carlo go developments. In IFIP Advances in Information and Communication Technology (Vol. 135, pp. 159–174). Springer New York LLC. https://doi.org/10.1007/978-0-387-35706-5_11
Mendeley helps you to discover research relevant for your work.