The objective of this lab is to help students understand and visualize the working of fundamental Artificial Intelligence search algorithms. Through interactive simulations, students will learn how algorithms such as Random Search, Depth First Search, Breadth First Search, Best First Search, Heuristic Search, A* Search, and Mini-Max operate in solving complex problems. The lab aims to complement theoretical learning by allowing students to experiment with these algorithms, analyze their performance, and understand their applications in real-world scenarios.