12

Ultimate Tic Tac Toe is an interesting variant of Tic Tac Toe where in each of the 9 fields, a “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?

  • 2
    There has been a discussion on Hacker News, but nothing definite yet. – Joachim Breitner Jul 15 '13 at 13:48
  • 1
    Great question! I did some searching and found this link from 2014 (redditt) that claims it has been solved. Still trying to run down some corroboration, and will post if I find. – DukeZhou Aug 11 '17 at 19:33
6

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.

  • 1
    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
  • 1
    (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 clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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