At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe

06/03/2020
by   Guillaume Bertholon, et al.
0

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-toe game. Each move determines which field the next player must play in. We show that there exist a winning strategy for the first player, and therefore that there exist an optimal winning strategy taking at most 43 moves; that the second player can hold on at least 29 rounds; and identify any optimal strategy's first two moves.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2022

Move first, and become unbeatable: Strategy study of different Tic-tac-toe

The main challenge of combinatorial game theory is to handle combinatori...
research
08/27/2020

A competitive search game with a moving target

We introduce a discrete-time search game, in which two players compete t...
research
09/02/2021

Rendezvous on the Line with Different Speeds and Markers that can be Dropped at Chosen Time

In this paper we introduce a Linear Program (LP) based formulation of a ...
research
01/25/2013

Identifying Playerś Strategies in No Limit Texas Holdém Poker through the Analysis of Individual Moves

The development of competitive artificial Poker playing agents has prove...
research
12/04/2017

Time-Space Tradeoffs for the Memory Game

A single-player Memory Game is played with n distinct pairs of cards, wi...
research
07/17/2020

Escaping a Polygon

Suppose an "escaping" player moves continuously at maximum speed 1 in th...
research
04/26/2017

A Reverse Hex Solver

We present Solrex,an automated solver for the game of Reverse Hex.Revers...

Please sign up or login with your details

Forgot password? Click here to reset