Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 435

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH

CHASLOT, GUILLAUME M. J-B., WINANDS, MARK H. M., HERIK, H. JAAP VAN DEN, UITERWIJK, JOS W. H. M., BOUZY, BRUNO·2008·New Mathematics and Natural Computation

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1142/s1793005708001094

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 19 references

Cited by

See all 435

Metadata

Authors
CHASLOT, G. M. J.-B., WINANDS, M. H. M., HERIK, H. J. V. D., UITERWIJK, J. W. H. M., & BOUZY, B.
Venue
New Mathematics and Natural Computation
Published
2008-11
Volume
04
Issue
03
Pages
343-357
ISSN
  • 1793-0057 (ISSN-L)
  • 1793-7027
OpenAlex
W2075848246
Cited by
435
References
19
FWCI
49.82
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH. https://app.cochat.ai/papers/10.1142/s1793005708001094
The paper
CHASLOT, G. M. J.-B., WINANDS, M. H. M., HERIK, H. J. V. D., UITERWIJK, J. W. H. M., & BOUZY, B. (2008). PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH. New Mathematics and Natural Computation. https://doi.org/10.1142/s1793005708001094

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.