Q14. Find a good heuristic function for following(a)Monkey and Banana problem(b)Travelling Salesman problemQ15. Give an example of an admissible heuristic for the 8-puzzle.Q16.Give a heuristic that a block-stacking program might use to solve problems of theform ‘stack block X on blockY’. Is the heuristic admissible? Is it monotonic?Q17.What is Agenda-Driven Search Algorithm?Q18. Show that worst-case algorithm to solve the travelling salesman problem is of exponential complexity but an algorithm that chooser a tour through the nearestneighbour of each city is of lower order. Give an example to show that the best-first-algorithm is not , in general, optimal, but still often good.Q19. Discuss some of the potential problems of using hill climbing search. Give anexamples of the problems cited.Q20. Prove that implication is transitive in the prepositional calculas, that is, that((P->Q) ^ (Q->R) )-> (P -> R)
Question Bank Unit II :
Q1. Discuss the representational structures and knowledge necessary to understand thefollowing sentences.