A finite goal set in the plane which is not a winner (Q998393)

In the \(G\)-achievement game on the plane \(\mathbb{R}^2\), two players alternately choose single previously unchosen points with the objective of forming a set congruent to the specified goal set \(G\) of \(\mathbb{R}^2\). A player achieves a \textit{weak win} if she or he constructs such a set, and a \textit{strong win} if she does so before the other player does. It is known that for every \(G\), both players have strategies guaranteeing a weak win in finitely many moves. If \(G\) has at most 3 points, or if \(G\) is the 4-point vertex set of a parallelogram, there is a finite strong winning strategy for Player I. This paper constructs 5-point goal sets for which there is no finite strong winning strategy for Player I.