Hello, World!
Hill Climbing: we can just do a lot of random restarts, hill climb until we reach the local peak, and then take the maximum of all iterations.
“Do stupid thing first, and only add intelligence when necessary”
A* algorithm: combines best part of Greedy search, which explores a small number of nodes in many cases, and Uniform Cost Search, which is guaranteed to find the shortest path.
