Try   HackMD

Artifical Intelligence HW4

tags: AI

Student ID : 410921317
Name : Thanongsak Khumpa

https://hackmd.io/@Lince/rkrJWZt8o

1.) Change the heuristic function for the two search programs, and compare the number of searched nodes and solution depth for one simple case(A* d<20) and one hard case(A* d>25) . Write your discussion.

Simple Case

The case used is as follow.
6
0 5 4 3 2 1
0 1 2 3 4 5

Generated Node

H0 H1 H2
Greedy 1986 429 199
A* 719 648 530

Depth

H0 H1 H2
Greedy 66 54 65
A* 16 16 18

Hard Case

The case used is as follow.
9
8 1 4 0 3 2 7 6 5
0 8 7 6 5 4 3 2 1

Generated

H0 H1 H2
Greedy **** 822 14697
A* 292862 119085 37228

Depth

H0 H1 H2
Greedy ** 72 52
A* 26 26 30

(2) Develop another heuristic H3 for the A* algorithm. Compare with H0, H1, and H2.

9
1 1 1 1 0 2 2 2 2
2 2 1 1 0 1 1 2 2

Generated Node

H0 H1 H2 H3
A* 390 169 196 141

Depth

H0 H1 H2 H3
A* 14 14 15 16