This document discusses various informed (heuristic) search strategies for solving problems, including greedy best-first search, A* search, and memory-bounded variations. Greedy best-first search uses the heuristic function h(n) alone to select nodes for expansion. A* search combines the path cost g(n) and heuristic estimate h(n) to select nodes, guaranteeing an optimal solution if h is admissible. The document provides examples of applying these searches to route finding between cities in Romania. A* search is identified as finding the optimal solution for this problem if using an admissible heuristic like straight-line distance.