Bruno Bouzy: Associating Shallow and Selective Global Tree Search with Monte Carlo for 9*9 Go. Computers and Games Bruno Bouzy of Paris Descartes, CPSC, Paris (Paris 5) with expertise in: Artificial Intelligence. Read 73 publications, and contact Bruno Bouzy on ResearchGate. Bruno Bouzy is a player and programmer from France. Born in , his highest rank was 3 dan. He was vice champion of France, losing in the.

Author: Goltigrel Dik
Country: Jordan
Language: English (Spanish)
Genre: Personal Growth
Published (Last): 5 July 2014
Pages: 385
PDF File Size: 18.41 Mb
ePub File Size: 10.28 Mb
ISBN: 616-4-14811-498-8
Downloads: 91515
Price: Free* [*Free Regsitration Required]
Uploader: Dugar

A match against Oleg playing 1, random games per move and Oleg playing 10, random games per move has resulted in an average 9. For the latter, an gruno possibility can be adopted: Advanced Search Include Citations. Some of our experiments with Oleg constitutes the basis of our discussion. Skip to main content.

Both approaches have the downside of being wrong in some cases. Monte Carlo methods have already been used in computer games.

In Oleg, an eye is an empty intersection surrounded by stones belonging to the same string.

This phenomenon happens when captures have already occurred at the time when the move is played. Damien Pellier 1 AuthorId: This section deals with two previous works [Abramson, ]and [Bruegmann, ]. Playing repeated brunl games RMG while maximizing the cumulative returns is a basic method to evaluate multi-agent learning MAL algorithms.

Progressive pruning does not need transpositions, temperature or simulated annealing. References [Abramson, ] Abramson, B.

Inria – Hedging Algorithms and Repeated Matrix Games

If Go dealt only with connections and not with captures, then perhaps it might be called Hex, and this problem would not arise. How do the uses of transpositions and progressive pruning compare bruon strength? Both the minimal number of random games and the maximal threshold remain constant and 10, respectively.


Our method is based bouyz Abramson Without this rule, the random player would never make living groups and the games would never end.

[] Hedging Algorithms and Repeated Matrix Games

In this context, each module is independent of the other one, and does not use the strength of the other one. When the tactical module selects moves for the random games, brruno would be useful for Monte Carlo to use the already available tactical results. It has already been considered theoretically within the framework of [Rivest, ].

Because strings, liberties and intersection accessibilities are updated incre- mentally during the random games, the number of moves per second is almost constant and the time to play a game is proportional to the board size. In those games, typically Oleg makes a large connected group in the center with just enough territory to live and Gnugo gets the points on the sides.

Olga and Oleg are still inferior to them but we believe that, with the help gouzy the ever-increasing power of computers, this approach is promising for computer go in bluzy future.

This paper underlines the association of two computer go approaches, a domaindependent knowledge approach and Monte Carlo.

The amount of random put in the games was controlled with the temperature; it was set high at the begin- ning and gradually decreased.

Computer Science > Artificial Intelligence

Second, games have been played between Olga with PP without any transpositions, and Oleg with transpositions without PP. Since the beginning of AI, mind games have vouzy studied as relevant application fields. The main weakness of Monte Carlo approach being tactics, it is worth adding some tactical modules to the program. Third, build statistics not only on the global score but on other objects.


Probably the best moves are played early and thus, get a more accurate evaluation. First, the strengthes and weaknesses of the two existing approaches are … More. Create your web page Haltools: Conversely, it looks for weaknesses in the opponent position that do not exist. This is an adaptation of [Abramson, ]. Hence, it is a good testbed for new AI methods. Olga was developed by Bruno Bouzy in the continuation of Indigo development [Bouzy, ]. However, it does have some drawbacks because the evaluation of a move from a random game in which it was played at a late stage is less reliable than when it is played at an early stage.

Bruno Bouzy 1 AuthorId: Moreover, the results of our Monte Carlo programs against knowledge- based programs on 9×9 boards and the ever-increasing power of computers lead us to think brunno Monte Carlo approaches are worth considering for computer go in the future. Then, he evaluated a move by computing the average of the scores of the random games where it had been played.