Try โ€‚โ€‰HackMD

Artifical Intelligence HW2

tags: AI

Student ID : 410921317
Name : Thanongsak Khumpa

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

1.Give and test five cases for the BFS and IDS program, compare and discuss the results of searched nodes and depth. The five cases should include simple and complex cases: depths of IDS should be: 5, 9, 13, 17, 21

ps. Due to computation recourses, some cases may not be solved in your computer. Then please write "N/A" for those cases.
UNFORTUNATELY MY LAPTOP CAN'T COMPUTE THE TEST CASES OF 12+ DEPTH ๐Ÿ˜”
Prove :

Image Not Showing Possible Reasons
  • The image file may be corrupted
  • The server hosting the image is unavailable
  • The image path is incorrect
  • The image format is not supported
Learn More โ†’

Goal's Depth Start State Goal Stae BFS Depth BFS #node IDS Depth IDS #node
Example 1 0 2 2 0 1 3 17 3 15
#1 5 1 1 0 2 2 0 1 1 5 354 5 224
#2 9 1 1 0 2 3 3 2 0 1 1 9 66342 9 34281
#3 13 N/A N/A N/A N/A N/A N/A
#4 17 N/A N/A N/A N/A N/A N/A
#5 21 N/A N/A N/A N/A N/A N/A

2.Test your five cases for Both of the BFS and JAIDS GRAPH_SEARCH(G.S.) version programs, calculate the decreasing rate of each cases.

decreasing rate = (old #nodes โ€“ new #nodes) / old #nodes

Goal's Depth GS BFS Depth GS BFS #node Decrease Rate GS IDS depth GS IDS #node Decrease Rate
Example 3 11 0.35 3 15 1
#1 5 5 26 0.92 5 80 0.64
#2 9 9 160 0.99 9 968 0.97
#3 13 N/A N/A N/A N/A N/A N/A
#4 17 N/A N/A N/A N/A N/A N/A
#5 21 N/A N/A N/A N/A N/A N/A