1 problem

Let $K_n$ be the complete graph on $n$ vertices. In the $T$-tournament game on $K_n$, Maker and Breaker alternately claim edges, and Maker chooses an orientation for each edge she…