Timeline for Devising algorithm for an A.I. to solve the Wumpus game
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2017 at 21:18 | comment | added | kev | When you say stuck- do you mean there exists a solution but the algorithm can not find it? In AI you can devise an algorithm which is called 'complete'. A 'complete' algorithm will always find a solution if the solution exists. For instance BFS is complete AND optimal (i.e. will find the best solution). Do you know what a tree is? | |
| Jul 8, 2017 at 2:14 | comment | added | Ignacio Rojas | Thanks for Norvig's reference. I'm currently reading through the section which covers the wumpus game, I'll work on this problem after I finish it. | |
| Jul 8, 2017 at 1:54 | comment | added | Ignacio Rojas | I'm not quite sure on how to model this as a search problem. I know that breadth-first search and depth-first search are algorithms to search graphs but I do not know which of these should I use. Also, I feel that there exists the possibility that the algorithm gets completely stuck. | |
| Jul 8, 2017 at 1:20 | review | First posts | |||
| Jul 8, 2017 at 5:12 | |||||
| Jul 8, 2017 at 1:17 | history | answered | kev | CC BY-SA 3.0 |