Answered step by step
Verified Expert Solution
Question
1 Approved Answer
4. (13 points) A*and Heuristics Consider the search state graph shown below, where S is a start state and G1 and G2 are goal
4. (13 points) A*and Heuristics Consider the search state graph shown below, where S is a start state and G1 and G2 are goal states. S 3 G1 SABC G1 G2 0 0 0 0 0 0 h9 6 4 1 h 0 0 0 0 h3 8 5 5 1 B G2 14 (a) (3 pts) Which heuristics are admissible (or write none)? (b) (3 pts) Which heuristics are consistent (or write none)? (c) (3 pts) For heuristic h, what order will nodes (paths) be added to the fringe in A*graph search? Present info as ((S), g+h= f), ((S-A-C), 12+1=13), etc. (d) (2 pts) For heuristic h, what order will states be added to the closed/explored set in A*graph? (e) (2 pts) For heuristic h, what path with A*graph search return?
Step by Step Solution
★★★★★
3.38 Rating (164 Votes )
There are 3 Steps involved in it
Step: 1
The image contains a search state graph with nodes S A B C G1 and G2 along with associated heuristic values h1 h2 and h3 for each node This graph is used to answer questions regarding A heuristics abo...Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started