Contents
This course focuses on the creation of artificial players for computer games. We will focus especially on games for which a forward model can be created and thus a search-based method of artificial intelligence can be used. We will also be dealing with navigation and path-finding (previously covered by NAIL068), though we will not deal with neural networks and evolutionary algorithms (as they are taught elsewhere). We will build on the topics from Artificial Intelligence I (NAIL069) by discussing search-based methods suitable for games, e.g. Monte Carlo Tree Search, plus various suboptimal heuristic approaches for modeling game trees in video games.
News
Follow the appropriate channel at Gamedev Discord!
https://discord.gg/c49DHBJ
Dates
Lectures + Labs: Tuesdays, 9:00 + 12:20, S10 + S11 (we start 1.10.2024)
Course Exam
There will be an oral examination done during the examination period. Find the list of topics for the oral examination in TBA.
Exam dates:
TBA
Schedule
| Week | Date | Topic | Lecturer | Content | Materials |
| 1. | 1.10.2024 9:00 |
AI for StarCraft: Brood War Lecture |
Jakub Gemrot | Introduction lecture about the complexity of creating artificial player for StarCraft: Brood War (non-DNN way). |
|
| 2. | 8.10.2024 9:00 |
Basics of AI player modeling, Forward model, A*-based agent Lecture |
David Šosvald | AI player and its position in the code architecture. Common intelligent agents models (reflex and goal based) and their correspondence to the game’s architecture. Game models for lookahead, their types. Forward model and game simulation. Example of an A*-based agent construction using Super Mario AI framework and agents developed at MFF. Game space pruning tricks. Details on A* algorithm: Artificial Intelligence I (MFF), Wikipedia |
|
| 2. | 8.10.2024 12:20 |
Pac-Man Agent Lab |
David Šosvald | Pac-Man homework TBA Delivery deadline: 22.10.2024 end of day AOE Deliver to: David Šosvald |
TBA |
| 3. | 15.10.2024 9:00 |
Spatial Awareness, Steerings Lecture |
Adam Dingle | TBA |
TBA |
| 4. | 22.10.2024 9:00 |
Path-finding – Part I Lecture |
Adam Dingle | TBA | TBA |
| 4. | 22.10.2024 12:20 |
MetaCentrum Lab |
David Šosvald | MetaCentrum homework Introduction to grid computing and hyperparameter testing. We will use a simple problem to demostrate hyperparameter optimization using the computing infrastructure of MetaCentrum. Jobs submission and tracking, logging, results visualisation. Code from lecture: TBA |
TBA |
| 5. | 29.10.2024 9:00 |
Path-finding – Part II Lecture |
Adam Dingle | TBA | TBA |
| 5.11.2024 | Sport’s day | Cancelled | |||
| 6. | 12.11.2024 9:00 |
Path-finding – Part III Lecture |
Adam Dingle | TBA | TBA |
| 6. | 12.11.2024 12:20 |
Path-finding Lab |
Adam Dingle | Path-finding homework TBA |
TBA |
| 7. | 19.11.2024 9:00 |
F.E.A.R. AI, Classical Planning Lecture |
David Šosvald | Let’s dive deep into the way how AI for the game F.E.A.R. was made and is still deemed to be awesome even in contemporary days (some even says it’s the best FPS AI ever). |
TBA |
| 8. | 26.11.2024 9:00 |
MCTS – Introduction Lecture |
Peter Guba | In this lecture, we introduce the Monte Carlo Tree Search algorithm and look at some of its theoretical foundations, namely the Monte Carlo method and the Multi-armed Bandit problem. | TBA |
| 8. | 26.11.2024 12:20 |
MCTS in Chess Lab |
Peter Guba | TBA | TBA |
| 9. | 3.12.2024 9:00 |
MCTS Enhancements Lecture |
Peter Guba | We will be going through some more MCTS modifications / improvements. | TBA |
| 9. | 3.12.2024 12:20 |
What Game AI development looks like Lab |
Peter Guba | TBA | TBA |
| 10. | 10.12.2024 9:00 |
Game Theory Introuction Lecture |
Adam Dingle | TBA | TBA |
| 11. | 17.12.2024 9:00 |
RTS Combat Lecture |
Peter Guba | TBA | TBA |
| 24.12.2024 | Merry Christmas | Cancelled | |||
| 31.12.2024 | and Happy New Year | Cancelled | |||
| 12. | 7.1.2024 9:00 |
Final Presentations | TBA |
TBA | |
| 12. | 7.1.2024 12:20 |
Final Presentations | TBA |
TBA |
The Credit
In order to gain the Credit you will be required to finish all the assignments handed out during the semester. There are no strict deadlines, however, you need to have the Credit before attending the exam.
Extra Links
Computational Complexity of Games and Puzzles
Acknowledgement
