Wumpus problem

hockymot2008_2009

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.

Reynolds Glisner

an excellent solution can be found here: http://www.codeguru.com/forum/showthread.php?threadid=465309[^] :)

hockymot2008_2009

I just think that if you can not help other people, you shouldn't consider them as a joke... :sigh:

Member 4194593

I think it was a way to indicate to you that you should look to other currently available sources before you ask others to spend their time trying to help you. Did you google "Wumpus"? Many available references. If you have checked those and still do not have an answer, then ask for individual help, but maybe on a gaming forum.

73Zeppelin

The original BASIC code has been translated into C here[^]. I am not familiar with the Wumpus problem, but perhaps you can dissect the code. Google will also give Java implementations and I'm sure you can find others. Maybe looking at the code can help.

Mark Churchill

Sir, you win at the internet. Please remember to collect your prize before you disconnect.

Mark Churchill Director, Dunn & Churchill Pty Ltd Free Download: Diamond Binding: The simple, powerful, reliable, and effective data layer toolkit for Visual Studio.
Alpha release: Entanglar: Transparant multiplayer framework for .Net games.