The game of Nelipe is played on a 16\times16-grid as follows: The two players write in turn numbers 1,2,...,16 in diff erent squares. The numbers on each row, column, and in every one of the 16 smaller squares have to be di fferent. The loser is the one who is not able to write a number. Which one of the players wins, if both play with an optimal strategy? combinatorics unsolvedcombinatorics