Introduction Artificial Intelligence (AI) is getting machines to think and behave smartly, and much of this smartness is all about problem-solving. From finding one’s way around a city to defeating an opponent at chess to solving the Rubik’s Cube, a smart system needs to make choices given a list of options and limitations. Search algorithms enter the picture here. Search in AI is navigating a problem space to reach a goal state. It can be imagined as moving from one node to another within a tree or graph in which the nodes are states and the actions are edges. Selecting the right path is crucial for effective problem-solving, particularly when navigating complex environments, limited resources, or time constraints. Search procedures are generally classed into two categories: Uninformed search: These searches the search space without using any knowledge of the domain regarding how close a node is to the goal. They are straightforward and systematic but usually inef...