On Erdos-Szekeres Maker-Breaker games

The Erdős-Szekeres Maker-Breaker game is a two-player competitive game where both players alternately place points anywhere in the two dimensional Euclidean plane without overlapping, such that no three points are collinear. The first player (Maker) starts the game by placing her point and wants to obtain an empty convex polygon of a given size k such that the vertices of the polygon are chosen from these points and the second player (Breaker) wants to prevent it. We show that Maker wins the game for k <= 8. We also present a winning strategy for Maker for any k in general when Maker is allowed to place (1 + eps) times more points (each round on average) in comparison to Breaker, for any eps > 0. Further, we address the models of the game for equilateral empty convex polygons in the plane and empty convex polygons in square grids.

Authors

Institutions

Publication Details

Journal
Computing in Geometry and Topology
Published
2024-09-04
DOI
https://doi.org/10.57717/cgt.v5i2.73
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Erdos-Szekeres Maker-Breaker games

Anupam Das, Tomáš Valla
Computing in Geometry and Topology
Computational Geometry and Mesh Generation
article

On Erdos-Szekeres Maker-Breaker games

Anupam Das, Tomáš Valla
article en

Abstract

The Erdős-Szekeres Maker-Breaker game is a two-player competitive game where both players alternately place points anywhere in the two dimensional Euclidean plane without overlapping, such that no three points are collinear. The first player (Maker) starts the game by placing her point and wants to obtain an empty convex polygon of a given size k such that the vertices of the polygon are chosen from these points and the second player (Breaker) wants to prevent it. We show that Maker wins the game for k <= 8. We also present a winning strategy for Maker for any k in general when Maker is allowed to place (1 + eps) times more points (each round on average) in comparison to Breaker, for any eps > 0. Further, we address the models of the game for equilateral empty convex polygons in the plane and empty convex polygons in square grids.

Computing in Geometry and Topology
University of Hyderabad (IN), Czech Technical University in Prague (CZ)
Openalex Percentile: Top 31%
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.