## Comparison of different selection strategies in Monte-Carlo Tree Search for the game of Tron

- Pierre Perick, David Lupien St-Pierre, Francis Maes, Damien Ernst
- 2012 IEEE Conference on Computational…
- 2012

1 Excerpt

- Published 2012 in FUN

We study the combinatorial two-player game Tron. We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACEcompleteness. We proof this conjecture.

@inproceedings{Miltzow2012TronAC,
title={Tron, a combinatorial Game on abstract Graphs},
author={Tillmann Miltzow},
booktitle={FUN},
year={2012}
}