TI-Planet Summer Contest 2013
Paul Emge (fortytwo)

My AI works by checking everything which it sees in a room. It then assigns a weight to each room based on which characteristics it has, based on the probability of the room having a trap, the wumpus, or the treasure, and the distance from the current room. It then uses Dijkstra's algorithm to find an ideal path to that room. The weights are set up so that the explorer will explore the maze if there is significant risk of a trap or the wumpus in a room which also may have the treasure.

I also ported the program to Löve so that I could run and test more easily on my computer. It can be run with "love wumpus n d p". It was made using Löve version 0.80.