Tic Tac Toe (Minimax) in Python

Hi everyone,

Here is my Tic-Tac-Toe game project! I used Minimax Alpha Beta pruning algorithm to help the AI make decisions. I would really appreciate some feed back on it!

My intention was to help people who are trying to learn how Minimax works by showing them an implementation of it. That and to make a fun little game.

Here is the link to my repo: https://github.com/Pranshu-Bahadur/Tic-Tac-Toe

I am learning how to solve problems using AI and this was a simple problem to get me started.

I would also appreciate any project ideas you have that have to do with Constraint Satisfaction Problems or Probability and decision theory.

Thank you for you time!! :slight_smile:

Here’s two classic constraint satisfaction problems:

  • N-Queens. Given an 8x8 chessboard, place 8 queens on it so that none of them threaten each other. Generalize this to an NxN board with N queens on it.
  • SEND + MORE = MONEY. Replace each letter with a digit such that the equation evaluates properly.
1 Like

Thanks for your reply, I don’t understand the SEND + MORE =MONEY problem. Could you please ellaborate?