DeepAI AI Chat
Log In Sign Up

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

by   Junan Pan, et al.

The main challenge of combinatorial game theory is to handle combinatorial chaos, if one player knows the strategy better than his opponent, he is able to determine the exact results of a game. If both players are qualified competitor, the result usually depends on the order when they take turns, which however, may not be determined by a player casually. So, this research studied different kinds of tic-tac-toe, assuming that a player always moves first, tried to figure out the winning or unbeatable strategy for the first player in different kinds of tic-tac-toe. It is titled "Move first, and become unbeatable", which also reflects the philosophy in life.


page 9

page 11

page 12


The Game of Blocking Pebbles

Graph Pebbling is a well-studied single-player game on graphs. We introd...

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

Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts...

Network Characteristics Control Social Dilemmas in a Public Good Game: A Mechanical Framework

Purpose: We propose a model to present a possible mechanism for obtainin...

A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes

A repairable threshold scheme (which we abbreviate to RTS) is a (τ,n)-th...

A Combinatorial Game and an Efficiently Computable Shift Rule for the Prefer Max De Bruijn Sequence

We present a two-player combinatorial game over a k-ary shift-register a...

On One-Round Discrete Voronoi Games

Let V be a multiset of n points in R^d, which we call voters, and let k≥...

Time-Space Tradeoffs for the Memory Game

A single-player Memory Game is played with n distinct pairs of cards, wi...