GAME OF TIC-TAC-TOE: SIMULATION USING MIN-MAX ALGORITHM

Abstract

Tic Tac Toe is a well-known game played across all age groups. It’s a simple fun game played with two players. There is a 3x3 grid formed by two vertical and two horizontal lines. The user can fill these nine places with either crosses (‘X’) or noughts (‘O’). The aim of the game is to win by placing three similar marks in a horizontal, vertical, or diagonal row.
In this paper, a simulation algorithm is presented to predict the win, or draw of a game by knowing the first move of a player. The game of tic-tac-toe is simulated using Min-max algorithm. The concept of combinational game theory is utilized to implement this game. This algorithm calculates only one step ahead using min-max algorithm. In an ideal scenario, a player must calculate all the possibilities to ensure the success. It’s a small 3x3 game, so the state space tree generated will be short.