The game starts with a graph with $n$ vertices and no edges. The players alternately add edges until the graph contains a hamilton-circle. The player who made the last move loses.
Who has a winning strategy in this game depending on the number of vertices ? For $n = 3$, the game is boring because player $2$ always wins, no matter how the play is. For $n=4$, player $2$ has a winning strategy.