Proofs of Existence and Optimality · More Complex Non-constructive Proofs of Existence (Optional)
Lesson 2
The rules of the game are the following. Two players place their colored pieces on a board of hexagons of size \(n \times n\). In the common variant of this game, \(n=11\). The goal of the player is to connect the sides of their color with a path of hexagons of their own color.