Abstract

In this paper, we present the implementation of ta tic-tac toe game using the python environment for any gaming application problem. Two players compete in the game of Tic-Tac-Toe, which is played on a 3 by 3 grid. Each participant is given a unique symbol (X or O) to represent the slot they are responsible for filling. The player who first covers a horizontal, vertical, or diagonal row of the board with solely their symbols wins the game. This work, which was written in Python using Pygame on a Jupyter Notebook, suggests a winning Tic-Tac-Toe strategy. This algorithm is made to act like a player while the computer maximises the odds of success by acting in accordance with the model's intelligence. The purpose of this work is to develop a Tic-Tac-Toe strategy in which the game will continue until one player wins and will conclude in a draw if no player selected the optimal spots that may have increased their chances of winning. The work presented here is the mini-project work of the 2nd sem students of electronics & communication engineering department of dayananda sagar college of engg., bangalore.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call