|
-
November 15th, 2008, 09:33 AM
#1
Wumpus problem
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.
-
November 15th, 2008, 01:32 PM
#2
Re: Wumpus problem
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.... 
TheCPUWizard is a registered trademark, all rights reserved. (If this post was helpful, please RATE it!)
 2008, 2009,2010
In theory, there is no difference between theory and practice; in practice there is.
* Join the fight, refuse to respond to posts that contain code outside of [code] ... [/code] tags. See here for instructions 
* How NOT to post a question here 
* Of course you read this carefully before you posted 
* Need homework help? Read this first
-
November 15th, 2008, 06:59 PM
#3
Re: Wumpus problem
I just ask for some suggestions. I don't need your source code or that sort of things ... Is that illegal ?
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|
Reply With Quote
