{ "cells": [ { "cell_type": "markdown", "metadata": {}, "source": [ "# Simulated Annealing\n", "\n", "Let's revisit the shortest path problem discussed previously between the Equestrian Statue and the Bahen Centre, this time using simulated annealing.\n", "\n", "Simulated annealing is a probabilistic method of optimizing functions. Named after the process of [annealing metals](https://en.wikipedia.org/wiki/Annealing_(materials_science)), simulated annealing is able to efficiently find a solution that is **close** to the global maximum. At its most basic level, simulated annealing chooses at each step whether to accept a neighbouring state or maintain the same state. While search algorithms like Hill Climbing and Beam Search always reject a neighbouring state with worse results, simulated annealing accepts those \"worse\" states probabilistically. " ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "\n", "\n", "