5-3. Simulated Annealing

Here is the version of the algorithm we’re going to use. Just like hill climbing, we’re going to iterate with simulated annealing, looking for points close to our current position that might have an improved value. However, we’re going to select our next position randomly from the points in the region near us. If a … Read more

We’ve been trying to emphasize algorithms that are of a particular importance. >> A star and alpha-beta pruning on the minimax algorithm are some examples. >> Now we’re going to introduce another key concept, simulated annealing. >> Hold on, simulated annealing? That implies that there’s real annealing too. >> That’s right, we’re going to steal … Read more