Fast winning strategies in positional games
Beverly Sackler, Environmental Protec · 2007
For the unbiased Maker-Breaker game, played on the hypergraph H, let M(H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’s win then set M(H) = 1). Similarly, for the unbiased Avoider-Enforcer game played on H, let E(H) be the smallest integer t such that Enforcer can win the game within t moves (if the game is an Avoider’s win then set E(H) = 1). In this paper, we investigate M and E and determine their value for various positional games.