Algorithms for Computer Games

Short Name
Algorithmen Computerspiel
Module Code
Module Coordinator
  • Prof. Dr. Andreas Gogol-Döring
  • Prof. Dr. Andreas Gogol-Döring
Short Description

The module deals with theoretical, algorithmical, and technical methods that can be used for the analysis, programming, or design of computer games. The focus is on strategy and the modeling of artificial intelligence.

Learning Objectives

The participants know typical algorithms and methods used in the programming of computer games, they can explain them, evaluate their usefulness in the specific application, and modify them if necessary in order to achieve given goals in game design.

  • Theoretical and mathematical principles and methods for the analysis of games and strategies.
  • Typical algorithms and algorithmic methods used in gaming development, e.g., the A* algorithm, or branch-and-bound.
  • Common methods used in computer games for modeling AI such as Behavior trees.
Duration in Semester
Instruction Language
Total Effort
6.0 CrP; an estimated 180 hours, of which approximately 60 are spent in class.
Weekly School Hours
Method of Instruction

Vorlesung 2 SWS; Übung 2 SWS

Requirements for the awarding of Credit Points

Prüfungsvorleistung: keine Übungsaufgaben
Prüfungsleistung: Klausur oder mündliche Prüfung (Art des Leistungsnachweises wird den Teilnehmerinnen und Teilnehmern rechtzeitig und in geeigneter Weise bekannt gegeben)

As Needed
  • Ian Millington, John Funge: ”Artificial Intelligence for Games”
  • Jörg Bewersdorff: ”Glück, Logik und Bluff”
  • Sanjay Madhav: ”Game Programming Algorithms and Techniques”
Prerequisite Modules