Tabu Search Optimizer: Contour View

Tabu search is a metaheuristic that climbs a rugged optimization landscape using short-term memory instead of randomness: at each step it takes the best legal move in its neighborhood, forbids that move (and its near-reversals) from being repeated for a set number of iterations via a tabu list, and only breaks that rule when an aspiration criterion shows the forbidden move would set a new global best. This 2D version renders the same Rastrigin, Ackley or Schwefel benchmark surface as a pannable, zoomable top-down contour map, coloring tabu neighborhood candidates in red and the best point found so far in green, alongside a live strip chart of f(current) and f(best) so you can watch memory-based search escape local minima that a plain hill-climber gets stuck in — and see the convergence curve, not just the dot.