Search Algorithms with AI

Informed (Heuristic) Search

Informed search algorithms utilize problem-specific knowledge to guide the search, making them more efficient than uninformed methods. This knowledge, known as a heuristic, estimates the cost to reach the goal from a given state. While heuristics do not guarantee the best solution, they often provide good solutions within a reasonable timeframe.

Global Search

  • Greedy Search
  • A* Tree Search
  • A* Graph Search
  • Iterative Deepening A* Search
  • Beam Search


  • Local Search

  • Hill Climbing Search
  • Simulated Annealing Search
  • Local Beam Search
  • Genetic Algorithms Search
  • Tabu Search