Board & Card Games Stack Exchange is a question and answer site for people who like playing board games, designing board games or modifying the rules of existing board games. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Ultimate Tic Tac Toe is an interesting variant of Tic Tac Toe where in each of the 9 fields, “regular” game of Tic Tac Toe is played; see the link for details.

Has this game been solved already? Would it be possible to solve it using a brute force mini-max strategy?

share|improve this question
There has been a discussion on Hacker News, but nothing definite yet. – Joachim Breitner Jul 15 '13 at 13:48

My co-worker found what I believe is a winning strategy for the first player, but now I find earlier evidence by others as well.

This is for the original version of the game, where you can send your opponent to an already won field and he has to place his mark there. It seems that the question is still open for the updated version where he can then choose freely.

share|improve this answer
It looks like you've missed the clarification in the rules: "What if my opponent sends me to a board that’s already been won? In that case, congratulations – you get to go anywhere you like, on any of the other boards. (This means you should avoid sending your opponent to an already-won board!)" – tttppp Jul 17 '13 at 12:05
(I've just seen that you've actually already fielded this point in the comments on your blog :-) – tttppp Jul 17 '13 at 12:07

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.