Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing

@article{Mhat2010CombiningUA,
  title={Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing},
  author={Jean M{\'e}hat and Tristan Cazenave},
  journal={IEEE Transactions on Computational Intelligence and AI in Games},
  year={2010},
  volume={2},
  pages={271-277}
}
Monte Carlo tree search (MCTS) has been recently very successful for game playing, particularly for games where the evaluation of a state is difficult to compute, such as Go or General Games. We compare nested Monte Carlo (NMC) search, upper confidence bounds for trees (UCT-T), UCT with transposition tables (UCT+T), and a simple combination of NMC and UCT+T (MAX) on single-player games of the past General Game Playing (GGP) competitions. We show that transposition tables improve UCT and that… CONTINUE READING
Highly Cited
This paper has 64 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

64 Citations

051015'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 24 references

General game playing: Game description language specification

  • N. Love, T. Hinrichs, M. Genesereth
  • Technical report, Stanford University,
  • 2006
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…