This reminds me the simulated annealing algorithm programs used to find answers for a problem that can't be perfectly resolved by brute-forcing in constant time

This reminds me the simulated annealing algorithm programs used to find answers for a problem that can't be perfectly resolved by brute-forcing in constant time. By search the easiest way and introduce randomness at same time. You can avoid being trapped into local maximum, just like bees here do.