Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

This implementation of Ultimate Tic Tac Toe is solved. #4

Open
rlbond86 opened this issue Jan 29, 2016 · 0 comments
Open

This implementation of Ultimate Tic Tac Toe is solved. #4

rlbond86 opened this issue Jan 29, 2016 · 0 comments

Comments

@rlbond86
Copy link

https://www.joachim-breitner.de/blog/604-Ultimate_Tic_Tac_Toe_is_always_won_by_X

With the current rules, it is possible for X to always win. Generally, the accepted rule change to avoid this situation is as follows:

If your opponent's move would force you to move in a board that is full or is already won by either player, then you may move anywhere.

See also http://mathwithbaddrawings.com/2013/06/16/ultimate-tic-tac-toe/ and the original post link at the top.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant