Tic-Tac-Win!
Moor and Jing-Jing are playing the familiar game, Tic-Tac-Toe! Jing-Jing is 'X' and Moor is 'O'. In the position below, Moor has messed up, and now Jing-Jing has a winning move. How many squares, out of 7, can she pick so that the game will end up being a win for Jing-Jing assuming perfect play?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
You can go every where and win because they are all forcing moves except one