2022/08/14 by Pan, Junan
#Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.2208.06795
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.