2 – 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
댓글을 달려면 로그인해야 합니다.