Recently, a methodology has been proposed for boosting the computational intelligence of randomized game-playing programs. We propose faster variants of these algorithms, namely rectangular algorithms (fully parallel) and bandit algorithms (faster in a sequential setup). We check the performance on several board games and card games. In addition, in the case of Go, we check the methodology when the opponent is completely distinct to the one used in the training.
CITATION STYLE
Liu, J., Teytaud, O., & Cazenave, T. (2016). Fast seed-learning algorithms for games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10068 LNCS, pp. 58–70). Springer Verlag. https://doi.org/10.1007/978-3-319-50935-8_6
Mendeley helps you to discover research relevant for your work.