2014/04/10 by Michael Krivelevich, Krivelevich, Michael · 10 citations
Computer Science · #05C57 #05C80 #05D05 #05D10 #05D40 #91A46 #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1404.2731
openalex publication_date 2014/04/10 · openalex created_date 2024/04/10 · openalex updated_date 2026/07/28
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs. It is closely connected to many other combinatorial disciplines such as Ramsey theory, extremal graph and set theory, probabilistic combinatorics, and to computer science. We survey the basic notions of the field, its approaches and tools, as well as numerous recent advances, standing open problems and promising research directions.