It is a two-person game with complete information played on a hypergraph (V,H) where V is an arbitrary set (called the board of the game) and H is a family of subsets of V, called the winning sets. The two players alternately occupy previously unoccupied elements of V.
The ﬁrst player, Maker, has to occupy a winning set to win; and the second player, Breaker, has to stop Maker from doing so; if Breaker successfully prevents maker from occupying a winning set to the end of the game, then Breaker wins. Thus, in a Maker–Breaker positional game, Maker wins if he occupies all elements of some winning set and Breaker wins if he prevents Maker from doing so. There can be no draw in a Maker-Breaker positional game: one player always wins.
The definition of Maker-Breaker game has a subtlety when and . In this case we say that Breaker has a winning strategy if, for all j > 0, Breaker can prevent Maker from completely occupying a winning set by turn j.
Erdős and Selfridge proved that, when the winning sets are large and the number of winning sets is small, Breaker can always win. More precisely, if the winning sets are all of size , and the number of winning sets is less than , then Breaker has a winning strategy. On the other hand, they provide examples of Maker-Breaker games where the number of winning sets is exactly and where Maker can force a win.
When tictactoe is played as a Maker–Breaker positional game, Maker has a winning strategy. This difference from tictactoe arises because, in tictactoe, when the second player (Breaker) takes two squares in a line, the first player (Maker) must respond to the threat by blocking the line. This forced response may be used to divert Maker from getting a winning line. In the corresponding Maker-Breaker game, Maker can ignore these threats, because getting three in a row first is not a winning condition for Breaker.
Maker-Breaker games on graphs
There has been quite some research done on playing Maker-Breaker games when the board of the game is the edge-set of a graph (usually taken as the complete graph) and the family of winning sets is , where is some graph property (usually taken to be monotone increasing) such as connectivity. For instance, the Shannon switching game is a Maker-Breaker game in which the winning sets are the paths between two distinguished vertices.
- J. Beck: Combinatorial Games: Tic-Tac-Toe Theory, Cambridge University Press, 2008.
- D. Hefetz, M. Krivelevich, M. Stojaković and T. Szabó: Positional Games, Oberwolfach Seminars, Vol. 44, Birkhäuser Basel, 2014.
- Erdős, P.; Selfridge, J. L. (1973). "On a combinatorial game" (PDF). Journal of Combinatorial Theory. Series A. 14: 298–301. doi:10.1016/0097-3165(73)90005-8. MR 0327313.
- Kruczek, Klay; Eric Sundberg (2010). "Potential-based strategies for tic-tac-toe on the integer latticed with numerous directions". The Electronic Journal of Combinatorics. 17: R5.
- Chvatal; Erdos (1978). "Biased positional games". Annals of Discrete Mathematics. 2: 221–229.