8 white and 8 black dots are drawn on a piece of paper. Parcly and Tori take turns drawing edges, always between white and black dots not already adjacent (so the graph is always bipartite); the first player to complete a 4-cycle (square) loses.
If Parcly starts first, who has a winning strategy and how is it executed?
This puzzle is an offshoot of my (now deep) research into Zarankiewicz's problem that sprang from my genies' chess puzzles, the results of which (maximal graphs, proofs and supporting code) are being added to my Kyoto repository and the relevant OEIS sequences. My SAT-based approach to the problem is also the subject of my honours project at the National University of Singapore.