1) Describe briefly the concept and methods(functions) involved in designing & implementing a Genetic Algorithm:
2) Briefly describe the difference between informed & uninformed search? What category will A* Search belong to? Hill Climbing? Genetic Algorithm?
3)Describe briefly what ‘Arc Consistency’ form of propagation for enforcing local constraints in CSPs mean and how its help to detect inconsistencies early on:
4) You need to develop a small python code that includes functions , using relevant libraries to solve the below problem:
A graph with 10 nodes and relevant connections between those nodes. Cost to traverse each path is 1
Nodes [A,B,C,D,E,F,G,H,I,J] Connections : A->E ; D->B ; H->I ; A->I; F->G; D->E ; G->H;I->J;B->H;D->F
Use any search technique to find the optimal path ( with least cost) between A & J