METODE PENCARIAN A *

Disusun Oleh:
NAMA : FUJI RAHAYU S
NIM : 0701171047
PRODI :ILMU KOMPUTER 6

FAKULTAS SAINS DAN TEKNOLOGI

UNIVERSITAS ISLAM NEGERI
SUMATERA UTARA
 Contoh soal:

4 14 11 D H(n)
1 B 5
A C 1 C D 2
4 4 12
2 2
2
D
3 2E 7 A 4
F 2 B 14
1 6 10
8 5 H 6 1 C 11
6 G I 0
7 4 0 12 E 4
1 F 2
J
9 3 1 K 2 3 L G 6
H 5
Selesaikan graf diatas dengan menggunkan salah satu dari
metode pencarian A* atau Greedy Bread First Search ? J 9
Penyelesaian : K 1

A* = F(n) = g(n)+h(n) L 3

Mencari nilai goal terkecil I 0

Penyelesaian:
 F(n)= g(D)+h(D)=(0 + 2) = 2
D

F(n)= g(A)+h(A) F(n)= g(E)+h(E)

=(0 +2) + 4 = 6 =(0 +3) + 4 = 7
A E

F(n)= g(F)+h(F)
F(n)= g(E)+h(E) =(0 + 3 + 7) +
=(0+2+4) + 4 = 10 2=12 ==12

B E F

F(n)= g(F)+h(F)
F(n)= g(B)+h(B)
=(0+2+4+7) + 2
=(0 +2+1) +1 4 =
= 15
17 F(n)= g(G)+h(G) F(n)= g(E)+h(E)
=(0+2+4+6) + 6 =(0+2+4) + 4 = 10
G I
= 18 F
C E
F(n)= g(I)+h(I)
F(n)= g(C)+h(C) =(0 + 3 + 7 + 1) +
=(0 +2+1+5) + 0 = 11
11=19 F(n)= g(H)+h(H)
J =(0+2+4+6+8)
+5 = 25 I
F F(n)= g(J)+h(J)
=(0+2+4+6+7) H F(n)= g(I)+h(I)
F(n)= g(F)+h(F) +9 = 28 =(0+2+4+7+1) +
=(0+2+1+5+2) + 0 = 14
2 = 12 F(n)= g(E)+h(E)
=(0+2+4) + 4 = 10
K F(n)= g(K)+h(K)
=(0+2+4+6+7+3)
+1 = 23 I
I

F(n)= g(I)+h(I) F(n)= g(I)+h(I)

F(n)= g(L)+h(L) =(0+2+4+6+8+6) + 0 =26
=(0+2+1+5+2+1)
L =(0+2+4+6+7+3+2) 14
+ 0 = 11
+3 = 27

F(n)= g(I)+h(I)
I
=(0+2+4+6+7+3+2+1) +0 = 25

Goal = D E F I