Tic Tac Toe AI

This project is a nostalgic throwback to my early days in computer science, specifically a project for the CS50 AI course. It's an unbeatable Tic-Tac-Toe AI that is guaranteed to never lose. I poured my all into creating this project, and it holds a special place in my heart as a testament to my early passion for programming.

The AI's formidable strength comes from its use of a sophisticated search algorithm known as Minimax. To make its decisions incredibly fast, I implemented Alpha-Beta pruning, which efficiently cuts down on the number of moves the AI needs to consider. The result is a lightning-fast and flawless opponent that will challenge even the most strategic human players.

Key Highlights:

• An unbeatable Tic-Tac-Toe AI developed for the CS50 AI course.
• Uses Minimax search algorithm for optimal gameplay.
• Optimized for speed with Alpha-Beta pruning.
• A perfect example of foundational AI and search concepts.

Technologies Used:

• Python
• Pygame
• Search Algorithms (Minimax, Alpha-Beta Pruning)