Problem Description

The board for this problem, consists of a 4 x 4 square grid. Each space on the grid is in one of the following states. It could be empty, contain gold, contain the Wumpus, or contain a pit. The objective is to design a lego robot, make it to the square with the gold and back to the square it started in, without moving into any squares with a pit or the Wumpus. The robot starts in the bottom left square on the grid facing up. The robot is given one arrow, which can be used to shoot the Wumpus if the robot is able to find him. Once the Wumpus is shot, the square it was on turns into an empty square.

After the robot moves, it waits to receive signals from the four squares adjacent to it. If there is at least one pit in one of these squares, the robot will feel a breeze. If the gold is in one of these squares, the robot will see a glitter, and if the Wumpus is in one of these squares, the robot will experience a terrible smell. Each signal has the same strength, regardless of how many of the adjacent squares are in the state corresponding to the given signal. For example, the robot will receive the same signal if it has three pits around it, as it would if only one pit was around it. All signals stop once the robot gets the gold, as it should be able to find its way back to where it started.

If the robot falls into a pit, or runs into the square with the Wumpus at any point, the game is over.