30 local searches from random points in [-2, 2] x [-2, 2], 1000 steps each
minimum reached   searches  best value
( 0.000, -1.000)        15      3.0000  global
(-0.600, -0.400)        10      30.000
( 1.800,  0.200)         3      84.000
( 1.200,  0.800)         2      840.00
