Given a 3x3 tic-tac-toe grid.
If you are allowed to place just one X in each of the small squares, what is the greatest number of Xs that can be put without getting "three in a row" in any of the 8 directions?

How many distinct solutions are there?

Asilius' solution is the same as the one I found. And I agree that the only different solutions are one of rotation. Yet, given that the question asked for distinct solutions, it may be correct to identify that there are two solutions due to rotation.

 X | X |         | X | X
---+---+---   ---+---+---
 X |   | X     X |   | X
---+---+---   ---+---+---
   | X | X     X | X |

Posted by Dej Mar on 2014-12-12 10:25:34