Strategi Pencarian dengan Informasi

(Informed Search Strategy)

Outline

• Best-first search

• Greedy best-first search

• A* search

• Heuristics

• Local search algorithms

• Hill-climbing search

• Local beam search

• Genetic algorithms

Greedy best-first search example

Greedy best-first search example

Greedy best-first search example

Greedy best-first search example

A* search example

A* search example

A* search example

A* search example

A* search example

A* search example

Merancang Heuristik

Stategi Pencarian Lokal (Local Search)

Hill-climbing search

• Local search

Hill-climbing search

• Problem: depending on initial state, can get stuck in local maxima

•

Hill-climbing search: 8-queens problem

• h = number of pairs of queens that are attacking each other, either directly or indirectly • h = 17 for the above state •

Hill-climbing search: 8-queens problem

A local minimum with h = 1

• END OF SLIDE

Tugas

1. Lakukan pencarian dari Oradea ke Bucharest menggunakan Greedy BFS dan A*

A A

B B C C

D D E E

N N

F F G G

H H I I J J K K

L L O O M M

56

43 29

91

92 93

94

37 48 17 21

19 20 30 29

2. Petualangan harta karung Carilah keuntungan maksimum menggunakan algoritma Greedy dengan mengumpulkan poin dari setiap Node yang dilewati!

3. h1(S) = ? h2(S) = ?