The video shows a simulated annealing algorithm finding the global minimum of a function with many local minima. It takes less than a tenth of a second to do this. Due to the limitation of 999 frames in a Mathcad animation the video only shows about the last third of the minimization (the first two thirds are of course a lot more random, and the candidate solutions are at higher points on the surface). Ten iterations are shown in each frame
See here for the worksheet: Minimizing a Function using Simulated Annealing
and here for another video: Video Link : 6849
