Skip to content

This is a game written in Java which implements heaps and the A-star algorithm.

Notifications You must be signed in to change notification settings

vincenthuor/PirateTreasureHunt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 

Repository files navigation

PirateTreasureHunt

This is an implementation of RedBeard Treasure Hunt game. You are to nagivate the seas to find your treasure. A navigable square is denoted by (".") and a non-navigable square denoted by ("+"). You can only use your sonar a number of times before it runs out of battery. Once you drop the sonar from your current position, your computer will search for the closest path to the treasure if and only if it is within your sonar's range. If your sonar does not detect a treasure, you may navigate N, S, E, W, and their allowable combinations. If you run out of battery for your sonar device, you lose the game.

Here is an example of finding the treasure! The ("*") denotes the shortest navigable path to a Treasure. Alt text

About

This is a game written in Java which implements heaps and the A-star algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages