How to find a path in an unknown maze in prolog? I am having initial position and no. of rows and columns, but no end position and I cannot give the rows*columns as end as I have to move recursively to find Wumpus, pit ,wall and an empty space in a maze.
Prolog Wumpus How to find a path in an unknown maze
513 views Asked by Rahul Bhasin At
1
There are 1 answers
Related Questions in PROLOG
- Cabal sandbox is using a global dependency. Could not resolve
- Haskell lens: let binding of Traversal'
- How can I parse fixed-length, non-delimited integers with attoparsec?
- Pipeline-like operation using TChan
- compile-time vs. run-time cost of Hamlet templates
- Date-time package in haskell - error in the current one, can't find an analog
- How does one debug infinite recursion in Haskell?
- Force GHC using local files
- List with random numbers in Haskell
- Changes in other elements based on listbox selections in threepenny-gui
Related Questions in MAZE
- Cabal sandbox is using a global dependency. Could not resolve
- Haskell lens: let binding of Traversal'
- How can I parse fixed-length, non-delimited integers with attoparsec?
- Pipeline-like operation using TChan
- compile-time vs. run-time cost of Hamlet templates
- Date-time package in haskell - error in the current one, can't find an analog
- How does one debug infinite recursion in Haskell?
- Force GHC using local files
- List with random numbers in Haskell
- Changes in other elements based on listbox selections in threepenny-gui
Related Questions in WUMPUS-WORLD
- Cabal sandbox is using a global dependency. Could not resolve
- Haskell lens: let binding of Traversal'
- How can I parse fixed-length, non-delimited integers with attoparsec?
- Pipeline-like operation using TChan
- compile-time vs. run-time cost of Hamlet templates
- Date-time package in haskell - error in the current one, can't find an analog
- How does one debug infinite recursion in Haskell?
- Force GHC using local files
- List with random numbers in Haskell
- Changes in other elements based on listbox selections in threepenny-gui
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Popular Tags
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
You can only find a path of the known part of a maze. For the unknown path you would need to maybe work with hypothesis and even propability might help valueing options.
The Hunt the Wumpus game maze discovery is nicely depicted by the original article from Gregory Yob which shows some gameplay. Whether this discovery is stable also depends on some assumptions that the tunnels do not change:
Original Hunt the Wumpus BASIC Program from 1972
https://www.atariarchives.org/bcc1/showpage.php?page=247
To allow experimentation with the original 1972 version of Hunt the Wumpus, I have translated the BASIC code into Prolog. It uses Erlang style programming, so there is not assert/retract. The game state is just passed along and modified along tail-recursive and mutally-recursive predicate calls.
But to embed it in some planning system, you would need to massage the code more, and remove the read_line/1 and write/1 and nl/1, and replace it by a modelling of an interaction between the player and the game.
Tranlation to Prolog in Erlang Style
https://github.com/jburse/jekejeke-samples/tree/master/pack/games