Login / Signup
At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe.
Guillaume Bertholon
Rémi Géraud-Stewart
Axel Kugelmann
Théo Lenoir
David Naccache
Published in:
CoRR (2020)
Keyphrases
</>
optimal strategy
tic tac toe
game playing
decision problems
upper bound
monte carlo
expected cost
lower bound
expected utility
mathematical models
worst case
objective function
e learning
optimal policy
machine learning
video games
bayesian networks