iscreate optinizatibr Atgo

?? Heuisie Saseh gnfomed

? Hewristio Amgun of dist Node -qoal
’ Gredy appioach
’ DFS- Unlokormed conbrol
stakegy Temtnat

stategy
Algcitm
1.Pot iniÃal node on ist
a I; CSART-Enpby or (START= yoal), terminate seaeh
Remve gt node from sTART, all this node k
4. It CK= coa),tesmioate with 8JcOeSs
5. Else ik node k has sueceso(s, genesate all of hem. Sort
them ty semaining distance from oaland add'them at the

Seanch Tiee

Goalk
Node
Step 17
from
Starnt
 Step3’

STAKT.

Step 47
from
START

K
Step 5’
START
fom
R

DFC a START

START

DFCA START
fon
RBEG
K

Skep 4Tesminates fom

 aopleme aNo bWed qlobal
maim
Loral
1.Local Maamum minimA

So" BackEacking
&.Plateau

>A state: have

Bame Value
sol> eig Jomp
3.

Algrew-Geated greund
Any point on rtdge can look ike a peak beaaUse movement
fnal possTDle dlisel bons îs dounard : Hene the algo+thm
stops tihen it eaches this state.
same level points ,A0 the
algo gets Con hused (uhere
i glabal mama?

So hybg ditferent paths