AI - Lecture 24

Fast Recap:

---

Recap:

~Ex.: $n$-Queens

***Hill-Climbing Search***: ![[Pasted image 20220907203900.png]] ![[Pasted image 20220907203915.png]]

For example, in the $n$-Queens puzzle using the hill-climbing algorithm we might find the optimal solution let’s say $n=5$ but if we are unlucky we might remain stuck on a solution $n=4$.

Simulated Annealing Search:

Algorithm:

THEOREM*:

Local Beam Search:

Genetic Algorithms

---

Original Files:

---