Question

SI.No. Question
Explain A* search strategy.
• Prove that:
i) A* using TREE-SEARCH is optimal if h(n) is admissible.
ii) A* using GRAPH-SEARCH is optimal if h(n) is consistent.
​

Answer 1

Answer:

उसे किसी ने भी हो जाता8765324578रहा हूँ और एक और न7432357864179

Explanation:

4565555555555666788GGFSFबBB24व3रघुBGFD