I liken it to a global search algorithm, such as simulated annealing. At a certain point the search entropy should be high, so as to avoid getting stuck in a local minima. However, at other times the search entropy should be low so the actual optimum can be found.

Yes, most of life can be explained with computer science analogies. There should be a book about this.