This is a maze game project for the Outlier computer science course. This project consists of 7 classes in each file, where a player moves from the top left-hand corner of a 2D board to the bottom right-hand corner without running out of health. The maze is a 2D String array. The game will start with a reserved cell for the player (P) and one random cell containing a magical gem (GEM). Every other cell will be randomly assigned to one of the following hazards: wolf, bear, elk, or hare. Hazards will have higher-value costs further into the board.
The player starts in the top-left corner with 500 health and must travel to the bottom-right corner without running out of health. For each turn, the player can move up, down, left, or right. After selecting a direction, the player is given a preview of the hazard in the chosen cell. Then, they can confirm the move or opt out and choose a new direction.
As the player traverses the maze, their health changes according to the hazards they reach. Once the player has visited a cell, the cell value changes to “X”—the hazard has been neutralized and the player can revisit the cell without any change in health.
The game ends when the player reaches the bottom right-hand corner of the maze or when they run out of health.
