Switch to: Citations

References in:

Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information

Edward J. Powley, Peter I. Cowling & Daniel Whitehouse

Artificial Intelligence 217 (C):92-116 (2014)

Add references

You must login to add references.

Multi-player alpha-beta pruning.Richard E. Korf - 1991 - Artificial Intelligence 48 (1):99-111.details Science, Logic, and Mathematics Direct download (2 more) Export citation Bookmark 4 citations
Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.details Science, Logic, and Mathematics Direct download (2 more) Export citation Bookmark 71 citations
An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.details Science, Logic, and Mathematics Direct download (2 more) Export citation Bookmark 53 citations
Monte-Carlo tree search and rapid action value estimation in computer Go.Sylvain Gelly & David Silver - 2011 - Artificial Intelligence 175 (11):1856-1875.details Science, Logic, and Mathematics Direct download (2 more) Export citation Bookmark 6 citations
Search in games with incomplete information: a case study using Bridge card play.Ian Frank & David Basin - 1998 - Artificial Intelligence 100 (1-2):87-123.details Science, Logic, and Mathematics Direct download (2 more) Export citation Bookmark 2 citations
Monte Carlo tree search in Kriegspiel.Paolo Ciancarini & Gian Piero Favini - 2010 - Artificial Intelligence 174 (11):670-684.details Science, Logic, and Mathematics Direct download (2 more) Export citation Bookmark 2 citations
Proof-number search.L. Victor Allis, Maarten van der Meulen & H. Jaap van den Herik - 1994 - Artificial Intelligence 66 (1):91-124.details Science, Logic, and Mathematics Direct download (2 more) Export citation Bookmark 6 citations

1