Solve 8-puzzles and travelling salesmen with A* and RBFS

Let's try AIMA 3.22:

Compare the performance of A* and RBFS on a set of randomly generated problems
in the 8-puzzle (with Manhattan distance) and TSP (with MST—see Exercise 3.30) domains.
Discuss your results. What happens to the performance of RBFS when a small random number is added to the heuristic values in the 8-puzzle domain?

3.22 gives us the opportunity to practice problem generation and look at some more sophisticated search: A* and RBFS.