[TU Dresden]


Technische Universität Dresden
Institut für Theoretische Informatik
Lehrstuhl für Automatentheorie

Hauptseminar Theoretische Informatik: "Complexity of Board Games"

Topic of seminar
Classical board games such as Chess, Checkers or Go are not only popular among players, but they were also studied with respect to their computational complexity. In this seminar we will take a look at several board games and see how they differ in computational complexity.

Preliminary schedule
The seminar starts on Friday, April 12, at 3:00pm in room 3027 of the computer science building with an introductory meeting. In this meeting all students will be assigned a research paper and a tutor.
Students who would still like to join the seminar, write an email Anni-Yasmin Turhan. We accept students for the seminar until 30th of April.

Presentations will take place during the last weeks of the teaching period (i.e. in July) .

Position in --> Curriculum

Basic knowledge in computational complexity is helpful.
For computer science students: “Grundlagen der Theoretischen Informatik” or “Formale Systeme”

The language of the seminar is English — unless attended by native German speakers only.

Goal of the Hauptseminar
Apart from learning about the main topic, students should learn how to get acquainted with a relevant body of literature, how to produce a well-structured paper, and how to give an understandable scientific talk.

Duties of Participants

Additionally, students must meet the following requirements.

Pool of papers
Participants are welcome to add papers to the pool of papers!
The seminar is coordinated by Anni-Yasmin Turhan.

Last modified: Fri Apr 12 16:35:42 CEST 2013