CS 391 - Selected Topics: Game Artificial Intelligence Syllabus

Games of Tree Search

• Breadth-first search, depth-first search, depth-limited search, iterative-deepening depth-first search (IDDFS)
• Monte Carlo Tree Search (MCTS) (e.g. Flat/Uniform, UCT)
• RAVE Heuristic

Games of Chance

• Reinforcement Learning and the n-Armed Bandit Problem
• Temporal-Difference Learning

Games of Mixed Strategy

• Regret Minimization
• Counterfactual Regret Minimization (CFR)

Note: This syllabus is provided solely for overview purposes and is subject to change. It is not exhaustive and does not constitute a guarantee of what will or will not be covered in exams.