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!!