The CSSE department at Monmouth University created a scavenger hunt for its students. An initial challenge is given and if completed correctly, it will yield a hint for the next challenge. All of the challenges are meant to be completed using Java and fundamentals taught up to CS-176.
All the challenges and its intructions will be gathered in this repo.
There were three challenges that become more diffcult after one another. Below you will find a short description of each challenge.
The first challenge is to decypher a message using an alaphabet array. The second position of the array must contain a and so on. Each number represents an index and should be replaced with its respective value from the array.
25-15-21 3-1-14 6-9-14-4 20-8-5 6-9-18-19-20 16-21-13-16-11-9-14 9-14-19-9-4-5 15-6 20-8-5 20-21-20-15-18-9-14-7 3-5-14-20-5-18 8-15-23-1-18-4 8-1-12-12 20-8-18-5-5 15-14-5 26-5-18-15 15-14 20-8-5 2-15-20-20-15-13 15-6 20-8-5 16-21-13-16-11-9-14 25-15-21 23-9-12-12 6-9-14-4 1 17-18 3-15-4-5 21-19-5 20-8-5 3-15-4-5 4-15 14-15-20 13-15-22-5 15-18 20-1-11-5 20-8-5 16-21-13-16-11-9-14
The second challenge uses Java's shape libraries to render the next clue. Specific instructions were given to properly draw the room number where the hint resides. Said instructions can be found in the repo.
The final challenge entailed creating a secret message from text of literature and methods to extract specific words. If done correctly, the secret message will be revealed. The instructions can also be found in the repo.
An executable .jar file was not created. If you want to run the programs, you will have to clone the repo and compiled.
The program was created using the provided instructions by Emerson Hidalgo.