Harary's Snaky problem: is the Snaky hexomino a winner in the planar Maker-Breaker achievement game?

Theorem 1: one globally legal Maker policy completes Snaky within 21 Maker claims (by the 41st turn) against every legal Breaker play on the empty infinite board, so Snaky is a winner in the planar weak game. It works on a $17\times17$ board, using a fixed 251-cell region; 25- and 35-move constructions are also given. Not shown: optimal move count or board size, or the strong game in which both players seek a copy.

Theorem 1: one globally legal Maker policy completes Snaky within 21 Maker claims (by the 41st turn) against every legal Breaker play on the empty infinite board, so Snaky is a winner in the planar weak game. It works on a $17\times17$ board, using a fixed 251-cell region; 25- and 35-move constructions are also given. Not shown: optimal move count or board size, or the strong game in which both players seek a copy.