Tic-Tac-Toe: Understanding the Minimax Algorithm

In this paper we deduce a new mathematical technique to define the winning game Tic-Tac-Toe. The results were placed in a 3x3 matrix and initial conversions were performed on the rows to find all possible win states. Programming languages were used to find the matrix to determine the diagonal wins. 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 by using a Min-max algorithm