Harary's generalized tic-tac-toe

Harary's generalized tic-tac-toe or animal tic-tac-toe is a generalization of the game tic-tac-toe, defining the game as a race to complete a particular polyomino on a square grid of varying size, rather than being limited to "in a row" constructions. It was devised by Frank Harary in March 1977, and is a broader definition than that of an m,n,k-game.

Harary's generalization does not include tic-tac-toe itself, as diagonal constructions are not considered a win.

Like many other two-player games, strategy stealing means that the second player can never win. All that is left to study is to determine whether the first player can win, on what board sizes he may do so, and in how many moves it will take.

Square boards
Let b be the smallest size square board on which the first player can win, and let m be the smallest number of moves in which the first player can force a win, assuming perfect play by both sides.


 * monomino: b = 1, m = 1
 * domino: b = 2, m = 2
 * I-tromino: b = 4, m = 3
 * V-tromino: b = 3, m = 3
 * I-tetromino: b = 7, m = 8
 * L-tetromino: b = 4, m = 4
 * O-tetromino: The first player cannot win
 * T-tetromino: b = 5, m = 4
 * Z-tetromino: b = 3, m = 5
 * F-pentomino: The first player cannot win
 * I-pentomino: The first player cannot win
 * L-pentomino: b = 7, m = 10
 * N-pentomino: b = 6, m = 6
 * P-pentomino: The first player cannot win
 * T-pentomino: The first player cannot win
 * U-pentomino: The first player cannot win
 * V-pentomino: The first player cannot win
 * W-pentomino: The first player cannot win
 * X-pentomino: The first player cannot win
 * Y-pentomino: b = 7, m = 9
 * Z-pentomino: The first player cannot win
 * All hexominoes (with a possible exception of the N-hexomino, which is still currently unsolved, may have b = 15 and m = 13): The first player cannot win
 * All heptominoes and above: The first player cannot win