Chapter 25
Monte Carlo Tree Search and Related Algorithms for Games
Nathan R. Sturtevant
25.1 Introduction
This chapter is designed to introduce a number of recent algorithms, developed academically for game AI, primarily in board and card games. However, these algorithms also have significant potential in other video game genres, which we also explore here. This chapter is an expansion of a talk from the GDC 2014 AI Summit. We will introduce four different, but related, algorithms that can be used to create more dynamic and adaptable AI for games. With the description of each algorithm, we will provide examples of contexts where it would be most useful.
25.2 Background
To begin, we introduce a number of classifications between algorithms and ...
Get Game AI Pro 2 now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
