Advanced Search
MyIDEAS: Login to save this article or follow this journal

Progressive Strategies For Monte-Carlo Tree Search

Contents:

Author Info

  • GUILLAUME M. J-B. CHASLOT

    ()
    (MICC-IKAT, Games and AI Group, Faculty of Humanities and Sciences, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands)

  • MARK H. M. WINANDS

    ()
    (MICC-IKAT, Games and AI Group, Faculty of Humanities and Sciences, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands)

  • H. JAAP VAN DEN HERIK

    ()
    (MICC-IKAT, Games and AI Group, Faculty of Humanities and Sciences, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands)

  • JOS W. H. M. UITERWIJK

    ()
    (MICC-IKAT, Games and AI Group, Faculty of Humanities and Sciences, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht, The Netherlands)

  • BRUNO BOUZY

    ()
    (Centre de Recherche en Informatique de Paris 5, Université Paris 5 Descartes, 45, rue des Saints Pères, 75270 Cedex 06, France)

Registered author(s):

    Abstract

    Monte-Carlo Tree Search (MCTS) is a new best-first search guided by the results of Monte-Carlo simulations. In this article, we introduce two progressive strategies for MCTS, called progressive bias and progressive unpruning. They enable the use of relatively time-expensive heuristic knowledge without speed reduction. Progressive bias directs the search according to heuristic knowledge. Progressive unpruning first reduces the branching factor, and then increases it gradually again. Experiments assess that the two progressive strategies significantly improve the level of our Go program Mango. Moreover, we see that the combination of both strategies performs even better on larger board sizes.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S1793005708001094
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S1793005708001094
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by World Scientific Publishing Co. Pte. Ltd. in its journal New Mathematics and Natural Computation.

    Volume (Year): 04 (2008)
    Issue (Month): 03 ()
    Pages: 343-357

    as in new window
    Handle: RePEc:wsi:nmncxx:v:04:y:2008:i:03:p:343-357

    Contact details of provider:
    Web page: http://www.worldscinet.com/nmnc/nmnc.shtml

    Order Information:
    Email:

    Related research

    Keywords: Monte-Carlo Tree Search; heuristic search; Computer Go;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Sébastien Bubeck & Rémi Munos & Gilles Stoltz & Csaba Szepesvari, 2011. "X-Armed Bandits," Post-Print hal-00450235, HAL.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:wsi:nmncxx:v:04:y:2008:i:03:p:343-357. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.