Skip to main content

1 Result(s)

within Matthieu Coulm Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Scalability and Parallelization of Monte-Carlo Tree Search

    Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations and the implications in terms of parallelization. We focus on our...

    Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean… in Computers and Games (2011)