You must write the program of an agent allowing to play the game of the Wumpus you have to consider the following informations: - Performance : — Exit with gold: +1000 — Fall or be eaten: −∞ — Execute an action: −1 - Environment : — n × n square map — Probability of wells on a space: 0.2 — A “Gold” space and a “Wumpus” space — Actions / Effectors: 1: up, 2: right, 3: down, 4: left, 5: grab, 6: climb Given a completely visible map, find the best sequence of actions. ´ The world map is represented in a textual file. The vacuum is represented by "", the wells by "P", the gold by "O" and finally the Wumpus by "W". You always start in the box (1,1) and will have to exit through this same box. This is how looks the map : ...P WOP. .... ..P. You must get it from a text file. Your program always returns valid paths — Your program always returns an optimal sequence of actions. — Your program has good algorithmic complexity. Use the A star algorithm. PLEASE IMPLEMENT EVERYTHING ACCORDING THE INFORMATION GIVEN PLZ, EVEN THE THE ALGORITHM A*. Please make sure to add the whole code you made... If needed, add it on multiple comments... Also show me the output of the optimal path cuz the last person send a code which doesn't work . Don't forget this is the map to get from the file and the optimal path for this card is: ”12153436”.
Hi , please help me by writing me the code for all this in python. READ UNTIL THE END OF THE QUESTION PLZ... ADD THE WHOLE CODE PLZ , NOT A PART OF CODE. You must write the program of an agent allowing to play the game of the Wumpus you have to consider the following informations: - Performance : — Exit with gold: +1000 — Fall or be eaten: −∞ — Execute an action: −1 - Environment : — n × n square map — Probability of wells on a space: 0.2 — A “Gold” space and a “Wumpus” space — Actions / Effectors: 1: up, 2: right, 3: down, 4: left, 5: grab, 6: climb Given a completely visible map, find the best sequence of actions. ´ The world map is represented in a textual file. The vacuum is represented by "", the wells by "P", the gold by "O" and finally the Wumpus by "W". You always start in the box (1,1) and will have to exit through this same box. This is how looks the map : ...P WOP. .... ..P. You must get it from a text file. Your program always returns valid paths — Your program always returns an optimal sequence of actions. — Your program has good algorithmic complexity. Use the A star
Please make sure to add the whole code you made... If needed, add it on multiple comments... Also show me the output of the optimal path cuz the last person send a code which doesn't work . Don't forget this is the map to get from the file and the optimal path for this card is: ”12153436”.ADD THE WHOLE CODE PLZ.
MAKE SURE THE COE IS WORKING FOR THIS CARD
...P
WOP.
....
..P.
Step by step
Solved in 3 steps
