M4 Heuristics

This document provides an overview of various informed search algorithms including best-first search, greedy best-first search, A* search, local search algorithms like hill-climbing and simulated annealing, and genetic algorithms. It discusses concepts like heuristics, admissible heuristics, consistent heuristics, and how they relate to the optimality of A* search. Examples are provided for route finding and solving the 8-puzzle and n-queens problems.