STRAT

EGI PEN

CARIAN

DENGAN INFO

RMASI

( I NF O

RM

ED

SE

AR

CH

ST

RA

TE

GY

)

OUTLINE

Best-first searchGreedy best-first searchA* searchHeuristicsLocal search algorithmsHill-climbing searchLocal beam searchGenetic 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 maximal

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