TicTacToe AI Search Algorithms

A Tic Tac Toe game built with Tkinter where the computer player selects moves using the Breadth-First Search (BFS)

.algorithm. It explores all possible future moves level by level to find a winning path efficiently

The Depth-First Search (DFS) algorithm to explore possible game states deeply before backtracking. It’s a recursive AI

.strategy to find the best move in the Tic Tac Toe game

An advanced variant of the game where the computer uses Iterative Deepening Search (IDS) — combining the depth

.efficiency of DFS and the completeness of BFS — by progressively deepening the search until a winning move is found