SoSe 23: Discrete Mathematics III: Positional Games
Tibor Szabo
Zusätzl. Angaben / Voraussetzungen
Grundlegende Bachelor-Algebra, Wahrscheinlichkeit und Disrete Mathematik.
Kommentar
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. In the course we also develop its strong connection to random graphs and the theory of algorithms, in particular hypergraph coloring, satisfiability, and the Lovász Local Lemma.
Prerequisite is the succesful completion of the modul Discrete Mathematics I (or equivalent, please contact the instructor).
SchließenLiteraturhinweise
J. Beck: Combinatorial Games, Tic-Tac-Toe Theory, Cambridge University Press, 2008.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Positional Games, Birkhäuser, 2014.
20 Termine
Regelmäßige Termine der Lehrveranstaltung