Search algorithmSearch algorithms are the techniques used in artificial intelligence (AI) to explore a set of potential solutions, or "search space," in order to identify the best or most suitable answers to issues. By leading AI agents from an initial state to a desired objective state, these algorithms are essential for problem-solving, optimisation, and decision-making.
Informed Search Algorithms Informed search, also known as heuristic search, uses additional information to enhance efficiency. Instead of blindly exploring the state space, it uses a heuristic function h(n) to estimate the cost of reaching the goal from a given state. To determine the best node to visit next, an evaluation function f(n) is used.
A* Search — Uses both path cost and heuristic information (f(n) = g(n) + h(n)) to find an optimal and efficient solution.
-
Greedy Search — Selects the next node based on the lowest heuristic cost h(n), aiming for a fast solution.
Uninformed Search Algorithms Uninformed search algorithms explore the state space systematically without using any additional information (heuristics) to guide the search.
-
-
-
