Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy some transversal (i.e., a set of n cells having no two cells in the same row or column) is the winner. What is the outcome of the game given best possible play by both players?
|
3 | added 22 characters in body; edited title | ||
A Permutation Transversal Achievement Game on a Grid |
||||
|
|
2 | added 14 characters in body | ||
|
Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy some set of n cells with having no two cells in the same row or column is the winner. What is the outcome of the game given best possible play by both players? |
||||
|
|
1 |
|
||
A Permutation Achievement Game on a GridTwo players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy n cells with no two cells in the same row or column is the winner. What is the outcome of the game given best possible play by both players?
|
||||
