Syllabus
Environment of strategic video games from the artificial intelligence point of view
Monte-Carlo Tree Search algorithm and its variants and modifications
Search algorithms working with durative actions - Alpha-Beta Considering Durations, Monte-Carlo Tree Search Considering Duration
Script space and scripts exploiotability; Portfolio Greedy Search, Nested Greedy Search
Using artificial evolution algorithms for game tree pruning
Performant implementation of search algorithms
Annotation
Environments of strategic video games are complex and they can be characterized (not only) as non-deterministic, simulated in real-time and having extremely large game trees. This course focuses on problems of using traditional search algorithms in such environments.
A script space will be presented as an alternative to an action space, search algorithms suitable for durative actions are discussed and Monte-Carlo Tree Search family of algorithms will be presented. The possibility of using artificial evolution for game tree pruning.