8-puzzle using search algorithms

This project solves the 8-puzzle problem, a 3×3 sliding tile puzzle, using different artificial intelligence search algorithms. The goal is to transform a given initial state into a target goal state by moving tiles into the empty space.

The project implements and compares five search strategies: Breadth-First Search (BFS), Depth-First Search (DFS), Uniform Cost Search (UCS), Greedy Best-First Search, and A* Search. Each algorithm explores the state space differently based on factors like cost, depth, or heuristic estimation.

The main objective is to analyze how each method performs in terms of optimality, time efficiency, and memory usage, and to understand how informed search (A*) improves performance using heuristics compared to uninformed methods.