E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning ways for your mathematical plays, 2003.

J. Bode and H. Harborth, Hexagonal polyomino achievement, Discrete Math, pp.5-18, 1997.
DOI : 10.1016/s0012-365x(99)00204-6
URL : http://doi.org/10.1016/s0012-365x(99)00204-6

M. Csernenszky and A. Pluhár, On the complexity of chooser-picker games

E. Fisher and N. Sieben, Rectangular polyomino set weak (1, 2)-achievement games, Theoretical Computer Science, vol.409, issue.3, pp.333-340, 2008.
DOI : 10.1016/j.tcs.2008.05.024

G. Fülep and N. Sieben, Polyiamonds and polyhexes with minimum site-perimeter and achievement games, Electron. J. Combin, vol.17, issue.1, pp.14-2644851, 2010.

G. Solomon and . Golomb, Polyominoes: Puzzles, patterns, problem and packings, 1965.

F. Harary, Achievement and avoidance games for graphs, Graph theory (Cambridge, Ann. Discrete Math, vol.13, pp.111-119, 1981.

F. Harary, H. Harborth, and M. Seemann, Handicap achievement for polyominoes, Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing, pp.65-80, 2000.

F. Harary and M. Weisbach, Polycube achievement games, J. Recreational Math, vol.15, pp.241-246, 1982.

H. Harborth and M. Seemann, Snaky is an edge-to-edge looser, Geombinatorics, vol.5, issue.4, pp.132-136, 1996.

K. Inagaki and A. Matsuura, Winning strategies for hexagonal polyomino achievement, Proceedings of the 12th WSEAS International Conference on Applied Mathematics (Stevens Point World Scientific and Engineering Academy and Society (WSEAS), pp.252-259, 2007.

H. Ito and H. Miyagawa, Snaky is a winner with one handicap, 8th Hellenic European Conference on Computer Mathematics and its Applications, 2007.

N. Sieben, Hexagonal polyomino weak (1, 2)-achievement games, Acta Cybernet, vol.16, issue.4, pp.579-585, 2004.

N. Sieben and E. Deabay, Polyomino weak achievement games on 3-dimensional rectangular boards, Discrete Mathematics, vol.290, issue.1, pp.61-78, 2005.
DOI : 10.1016/j.disc.2004.11.001