Consider a 4 by 4 tic tac toe board where 4 X's have already been drawn in some configuration and player X is first to move. The goal of player X is to play optimally such that player O is eventually cornered into losing (player X gets a 4 in a row).
For example, a game might play out like this (Red is X, Blue is O):
Another example could be of a game where you have to systematically prove that every possible Blue move will lead to a Red victory without necessarily forcing Blue to make a defensive play:
Is there any starting configuration of 4 X's on this 4 by 4 board where it is impossible for player X to win (a draw in considered a loss) even when playing optimally?
Bonus: How many starting X's are required for X to always win an by board when playing optimally?
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.
No explanations have been posted yet. Check back later!