Wumpus problem

[capint]

I need help from you who have experience with wumpus problem.
I would like to ask that at one step, how can we choose the adjacent field to go ?
I know one method that we choose the adjacent OK field (without mummies or pits) that has fewest visited times. My teacher said that it's not the most optimal method...
Would you mind helping me?. Thanks in advance.

[TheCPUWizard]

The best help we can give is to sit down and reason it out with pencil and paper.

Also read the "Why we dont do homework" FAQ, and the other important "Before You Post" information...

When you have an approach, post the specific details, and why you think it is better (or not), people will be happy to help you when you do the work.... :wave::wave:

[capint]

I just ask for some suggestions. I don't need your source code or that sort of things ... Is that illegal ?