Maker-Breaker is solved in polynomial time on hypergraphs of rank 3

Florian Galliot, Sylvain Gravier, Isabelle Sivignon

In the Maker-Breaker positional game, Maker and Breaker take turns picking vertices of a hypergraph $H$, and Maker wins if and only if she possesses all the vertices of some edge o…