TU Wien:Programmierung von Strategie-Spielen VU (Eidenberger)

From VoWi
Jump to navigation Jump to search
Similarly named LVAs (Resources):


Lecturers Horst Eidenberger
Alias Strategy Game Programming (en)
Department Information Systems Engineering
When winter semester
Last iteration 2021WS
Language "if required in english" was not recognized as a supported language code.
Mattermost programmierung-von-strategie-spielenRegisterMattermost-Infos
Links tiss:188981, Homepage
Katalog Freie Wahlfächer - Wirtschaftsinformatik Wahlmodul Freie Wahlfächer
Katalog Freie Wahlfächer - Informatik Wahlmodul Freie Wahlfächer
Bachelor Medizinische Informatik Wahlmodul Freie Wahlfächer
Master Data Science Wahlmodul Freie Wahlfächer


Basics of programming AIs for round-based strategy games such as Risk, Mancala, or Go.


WS19: Aufgrund des hohen Andranges ist zu Beginn des Semesters ein Einstiegstest zu absolvieren. Er besteht aus 30 Fragen, der Stoff stammt aus drei PDFs (insgesamt 16 Seiten). Die besten 20 Studierenden werden in die LVA eingeschrieben. Die Fragen bleiben für jeden Studierenden gleich, jedoch wird am Ende nicht das Ergebnis und die Lösung bekannt gegeben.

Benötigte/Empfehlenswerte Vorkenntnisse[edit]

Java programming, basic search algorithms


WS2020: Due to distance learning, the lecture consisted of a singel 2h video where Prof. Eidenberger talks about the different types of games, AI approaches, Monte Carlo Tree Search, and further techniques to improve ones AI.


Students have to first hand in a summary of the lecture, which prof Eidenberger has to approve, and afterwards they can sign up for either writing an AI for Mancala or Risk in teams of 2.

There is a midterm hand in, and a final hand in, afterwards prof. Eidenberger will stage a tournament to determine the best AIs.

Prüfung, Benotung[edit]

Scored is the creativity of the approach, the implementation quality, and the documentation of the code.

Dauer der Zeugnisausstellung[edit]

noch offen


Prof. Eidenberger knows that this is an elective course, so he is content if a group manages to implement a basic MCTS for the selected game, but the interesting part of the lecture only really starts after this, when groups try to figure out ways to make the search better and/or more efficient.



Only do this lecture if you are interested in this topic.

Verbesserungsvorschläge / Kritik[edit]

Prof. Eidenberger and the tutor were really quick in replying to forum posts.