Scribd
Upload
150 views8 pages

Tugas AI Search Algoritm

1. The document represents a problem in tree form with nodes S, A, B, C, D and Z. 2. It asks to solve the problem using different search methods like Breadth First Search, Depth First Search, Best First Search, Hill Climbing, Branch and Bound, and Dynamic Programming. 3. The responses provide the tree representations and solutions of the problem using each of the requested search methods.

Uploaded by

Hadziq Muttaqin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
150 views8 pages

Tugas AI Search Algoritm

1. The document represents a problem in tree form with nodes S, A, B, C, D and Z. 2. It asks to solve the problem using different search methods like Breadth First Search, Depth First Search, Best First Search, Hill Climbing, Branch and Bound, and Dynamic Programming. 3. The responses provide the tree representations and solutions of the problem using each of the requested search methods.

Uploaded by

Hadziq Muttaqin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Nama : KHADZIQ MUTTAQIN

NIM : 18552011061
MAKUL : Artificial Intelligence
7
B C
2 2

S 1 2 Z

4 5

A D
3

Pertanyaan
Representasikan kasus diatas dengan tree
Selesaikan kasus diatas dengan metode
Breadth First Search
Depth First Search
Best First Search
Hill Climbing
Branch and Bound
Dynamic Programming
Breadth First Search

A B

B D A C

C C Z D D Z

D Z Z C Z A Z

Z Z
Depth First Search

A B

B D A C

C C Z D D Z

D Z Z C Z A Z

Z Z
Best First Search

0
4
2
A B

2 7
1
3
B D A C

3 9

6
C C Z D D Z

5
2

D Z Z 8 C Z A Z

Z Z

10
Hill Climbing

4
2
A B

7
1

B D A C

3 9

C C Z D D Z

5
2

D Z Z C Z A Z

Z Z
Branch and Bound

S
4 2

A B
1
4 3 2 7

3 1

B D A C
7
2 5 2 2
5 7 3 9

C C 9 Z D 6 D Z
2 12
2 5 3 11 11
12 2 2 5

14 D Z Z 8 C Z A Z

14 11 2 11 14 16

Z Z

10
Dynamic Programming

S
4 2

A B
1
4 3 2 7

3 1

B D A C
7
2 5 2 2
5 7 3 9

C C 9 Z D 6 D Z
12

12 5 11 11
2

D Z Z 8 C Z A Z

14 2 11

Z Z

10

You might also like