Maastricht University / College Park / California State University / University of Alberta / University of Maryland / /
IndustryTerm
less search effort / classic algorithms / classic stochastic search techniques / online / tree search / tree search methods / depth search / adversarial stochastic game tree search / carlo *-minimax search / classic search heuristics / search procedure / fixed depth search / adaptive sampling algorithm / sparse sampling algorithm / search algorithm / search depths / approximation algorithms / search methods / classic game tree search algorithms / search depth parameter / community site / search enhancements / main search paradigms / deterministic game tree search / search horizon / sparse sampling algorithms / search time limit / montecarlo tree search / be built using fixed depth search / /
Organization
University of Maryland / Department of Knowledge Engineering / University of Alberta / Computational Intelligence / California State University / Northridge / Maastricht University / Organisation for Scientific Research / Department of Computing Science / /
Person
Bill Butler / Todd W. Neller / Clifton G.M. Pressor / /
Position
first player / editor / point player / player / Computer Player for Carcassonnne / game analyst / player / and discarding duplicate states / Forward / Computer Player / /
ProgrammingLanguage
E / V / /
ProvinceOrState
Alberta / Maryland / /
PublishedMedium
ICGA Journal / /
Technology
alpha / Retrograde approximation algorithms / well known EXPECTIMAX algorithm / classic algorithms / base EXPECTIMAX algorithm / classic game tree search algorithms / *-Minimax algorithm / Machine learning / Star1 algorithm / sparse sampling algorithm / AMS algorithm / adaptive sampling algorithm / Progressive Widening algorithm / Star2 algorithm / MCMS algorithms / artificial intelligence / Star1 The algorithm / Monte Carlo search algorithm / classic *-Minimax algorithms / simulation / Star2 algorithms / sparse sampling algorithms / /
Monte Carlo *-Minimax Search Marc Lanctot1 , Abdallah Saffidine2 , Joel Veness3 , Christopher Archibald3 , and Mark H.M. Winands1 1 Department of Knowledge Engineering, Maastricht University, Netherlands, {marc.lanctot,