Search Control

Consider the A-to-Z example from class (copied below). Imagine the the directions of all transformation are reveresed. Trace the sequence of transformations for the "expanding all ways from a chosen state" approach, to get from Z to A, for a
  1. Consecutively bounded depth first search to find any solution, depth increment 1.
  2. Branch and bound search with dynamic programming.
  3. Best first search, using Euclidean distance as the estimated cost to the goal.
  4. The A* algorithm with dynamic programming.