Search Control

Consider the Z-to-A example below (a reversed mangle of the class example). 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 the indicated estimated costs to the goal.
  4. The A* algorithm with dynamic programming.