How do greedy descent, simulated annealing, and Tabu Search compare? All three use the same core components: State s Cost E(s) Neighborhood N(s)
