How to resolve the algorithm Hunt the Wumpus step by step in the Ruby programming language
How to resolve the algorithm Hunt the Wumpus step by step in the Ruby programming language
Table of Contents
Problem Statement
Create a simple implementation of the classic textual game Hunt the Wumpus. The rules are: The game is set in a cave that consists of a 20 room labyrinth. Each room is connected to 3 other rooms (the cave is modeled after the vertices of a dodecahedron). The objective of the player is to find and kill the horrendous beast Wumpus that lurks in the cave. The player has 5 arrows. If they run out of arrows before killing the Wumpus, the player loses the game. In the cave there are: If the player enters a room with the Wumpus, he is eaten by it and the game is lost. If the player enters a room with a bottomless pit, he falls into it and the game is lost. If the player enters a room with a giant bat, the bat takes him and transports him into a random empty room. Each turn the player can either walk into an adjacent room or shoot into an adjacent room. Whenever the player enters a room, he "senses" what happens in adjacent rooms. The messages are: When the player shoots, he wins the game if he is shooting in the room with the Wumpus. If he shoots into another room, the Wumpus has a 75% of chance of waking up and moving into an adjacent room: if this is the room with the player, he eats him up and the game is lost.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Hunt the Wumpus step by step in the Ruby programming language
Source code in the ruby programming language
You may also check:How to resolve the algorithm Spinning rod animation/Text step by step in the Haskell programming language
You may also check:How to resolve the algorithm Loops/Do-while step by step in the E programming language
You may also check:How to resolve the algorithm Substring step by step in the Maple programming language
You may also check:How to resolve the algorithm Smarandache prime-digital sequence step by step in the REXX programming language
You may also check:How to resolve the algorithm Greatest common divisor step by step in the Verilog programming language