On Games with Random-Turn Order and Monte Carlo Perfectness
Ingo Althöfer · ICGA Journal · 2011
In a game, pure Monte Carlo search with parameter T means that for each feasible move T random games are generated. The move with the best average score is played. We call a game “Monte Carlo perfect” when this straightforward procedure converges to