Problem 1: Suppose there is a maze such as the image shown...

Problem 1: Suppose there is a maze such as the image shown below, where Tom wants to navigate from the entrance to the exit to catch the Jerry. As an Al expert you want to help Tom to catch the Jerry. F A H G Exit J E D B C Entrance S Q1. Formulate the problem in terms of Graph (V,E). Q2. Suggest at least two blind search strategies to Tom to find possible navigation path. Q3. How can Tom navigate from the entrance to the exit with the less possible movements (Explain in detail). Q4. Find the minimum cost path from the entrance to the exit if the cost of movement from one room to another room is given by C= $|X-Y|$, where X and Y represent the numeric equivalent value of room name respectively (A=1,B=2,C=3....Z=26). (For example: Cost of movement from room S to A = $|19-1|=18$)

Thanks for your feedback!

Suppose there is a maze such as the image shown below, where Tom wants toProblem 1: Suppose there is a maze such as the image shown below, where Tom wants to navigate from the entrance to the exit to catch the Jerry. As an AI expert you want to help Tom to catch the Jerry. Q1. Formulate the problem in terms of Graph (V,E). Q2. Suggest at least two blind search strategies to Tom to find possible navigation path. Q3. How can Tom navigate from the entrance to the exit with the less possible movements (Explain in detail). Q4. Find the minimum cost path from the entrance to the exit if the cost of movement from one room to another room is given by C=|x-Y|, where x and Y represent the numeric equivalent value of room name respectively (A=1,B=2,C=3dots.Z=26). (For example: Cost of movement from room S to A=|19-1|=18 ) navigate from the entrance to the exit to catch the Jerry. As an AI expert you want to help Tom to catch the Jerry Problem l: Suppose there is a maze such as the image shown below, where Tom wants to navigate from the entrance to the exit to catch the Jerry. As an AI expert you want to help Tom to catch the Jerry. Exit H Entrance Q1. Formulate the problem in terms of Graph (V,E) . Q2. Suggest at least two blind search strategies to Tom to find possible navigation path. Q3. How can Tom navigate from the entrance to the exit with the less possible movements (Explain in detail). Q4. Find the minimum cost path from the entrance to the exit if the cost of movement from one room to another room is given by C= [X-Y], where X and Y represent the numeric equivalent value of room name respectively (A=1,B=2,C=3....Z=26). (For example: Cost of movement from room S to A = |19-1|=18)

Play audio

Feedback

Question

Please give Ace some feedback