1. CSE 4705 Artificial Intelligence
Jinbo Bi
Department of Computer Science & Engineering

2. Informed search strategies

3. Random restart – a remedy to the drawbacks

4. Local beam search

5. Simulated annealing

6. Simulated annealing (SA)

7. Simulated annealing (SA)

8. Simulated annealing algorithm
Example of simulated annealing
Example codes

9. Simulated annealing example
h = 1,
t=1,
T = T0/2 = 50
Because T ~= 0, so
Next = a random move
Δ E = E1 – E0 = 1
If Δ E < 0, Current = Next
Else
compute p = e (- Δ E/T)
=0.98
Generate a random number r
from a uniform [0,1]
Assume r = 0.8
Then, Current = Next
Initial state
T0 = 100
Annealing schedule is
T T/2

10. Simulated annealing example
h = 1,
t=1,
T = T0/2 = 50
Because T ~= 0, so
Next = a random move
Δ E = E1 – E0 = 1
If Δ E < 0, Current = Next
Else
compute p = e (- Δ E/T)
=0.98
Generate a random number r
from a uniform [0,1]
Assume r = 0.8
Then, Current = Next
Initial state
T0 = 100
Annealing schedule is
T T/2

11. Simulated annealing (variant)
Another annealing scheduling

12. Genetic algorithms

13. Genetic algorithms

14. Representation: strings of genes

15. Encoding of a chromosome

16. Example: genetic algorithms for drive train

17. Operations: crossover

18. Operations: mutation

19. The basic genetic algorithm
A short video explains GA in 3 minutes

20. Genetic algorithm: 8-queens

21. Game playing and adversarial search

22. Games
If possible, we can talk about minimax rule and search

23. Motivation

24. The simplest game environment

25. Other properties of the simplest games

26. More complicated games

27. Formalizing the game setup

28. How to play a game by searching

29. Game trees

30. Game trees

31. Hexapawn: three possible first moves

32. Hexapawn: three possible first moves

33. MAX & MIN nodes: an egocentric view

34. Evaluation functions: f(n)

35. A partial game tree for Tic-Tac-Toe

36. The Minimax rule

37. The minimax rule
Don’t play hope chess

38. The minimax procedure

39. 2-ply Minimax example

40. What if MIN does not play optimally?

41. Comments on Minimax search

42. Questions?