Best-first search

Best-first search is a way of finding a path from one point to another. Imagine you are trying to get from one side of a giant field to the other. Best first search would mean that you run to the closest point to the other side of the field, then run to the next closest point, then the next closest, until you reach the other side. It's like taking the quickest route instead of the longer, winding path.