/noughts_and_crosses

Noughts and Crosses Game Application with MinMax Algorithm and Alpha-Beta Pruning Implementation.

Primary LanguagePythonMIT LicenseMIT

Noughts and Crosses

Code developed for the 'Tic-Tac-Toe' Activity | CS50’s Introduction to Artificial Intelligence with Python.

The Noughts and Crosses game has been implemented in accordance with the activity's requirements, incorporating the Min-Max algorithm. The implementation also includes the Alpha-Beta Pruning.

Demonstration

Installation

Simply install the dependencies using pip:

  pip install -r requirements.txt

Execution

To run the application, simply execute the runner.py file.