Positional Games is a rapidly developing field of combinatorics, whose aim is to systematically develop an extensive mathematical basis for a variety of two-player perfect information games. These range from such popular games as Tic-Tac-Toe and Hex to purely abstract games played on graphs and hypergraphs. The subject of positional games is strongly related to several other branches of combinatorics such as Ramsey theory, extremal graph and set theory, and the probabilistic method.
Prerequisite is the succesful completion of the modul Discrete Mathematics I (or equivalent, please contact the instructor).
J. Beck: Combinatorial Games, Tic-Tac-Toe Theory, Cambridge University Press, 2008.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Positional Games, Birküser, 2014.
Basic Bachelor Algebra, Probability, and Disrete Mathematics.
A6/SR 032 Seminarraum
wöchentlich, ab 18.04.2023, 12:00 - 14:00 (14 Termine)