https://github.com/alejandro945/hellish-maze
The best game that uses abstract creation design pattern factory that finds the fastest way to escape the infrenal labyrinth using graph theory and graph paths
https://github.com/alejandro945/hellish-maze
dijkstra-shortest-path floyd-warshall-algorithm graph kruskal-algorithm maze-game prim-algorithm
Last synced: 2 months ago
JSON representation
The best game that uses abstract creation design pattern factory that finds the fastest way to escape the infrenal labyrinth using graph theory and graph paths
- Host: GitHub
- URL: https://github.com/alejandro945/hellish-maze
- Owner: alejandro945
- License: mit
- Created: 2021-11-10T01:24:08.000Z (over 3 years ago)
- Default Branch: master
- Last Pushed: 2021-12-01T03:35:52.000Z (over 3 years ago)
- Last Synced: 2024-12-27T02:14:04.491Z (4 months ago)
- Topics: dijkstra-shortest-path, floyd-warshall-algorithm, graph, kruskal-algorithm, maze-game, prim-algorithm
- Language: Java
- Homepage:
- Size: 22.2 MB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Welcome to our proyect! 
# Hellish Maze Video Game 🔥 
Hellish Maze is a video game that consists of finding the shortest path to reach the farthest treasure.
This Game allows users to choose an avatar which will be the one that will be known from his arrival until his completion, apart from that, he will be able to choose the mode in which he wants to play, so that himself is the selector of his own destiny. After choosing a mode, the application will generate a world, with a number of random doors and rooms. Finally, it must also be able to show the best possible path to the treasure after finishing the game, either by losing or having won, this in order to show the users the decisions they should make.
This version was created by Alejandro Varela, Luis Murcia and Gabriel Suarez. The interesting about the work, is the application code use a varitie of java tools like collections ands data structures, but also the team create their owns structures for futures implementations using decoupling concept and use abstract factory as a creational pattern.
## Changelog 🎯
#### Version 1
* TAD Design for each collection implemented
* Engineering Methiod
* Functional requirements
* JUnit Tests
* Class Diagram
* Implementation done
* Screens and navigation done
* Project description
* Read me
## Pre-requirements 💥
```
You need JDK 1.8_261
```
## Documentation 📃
* Click here ➡️ [Statement](https://github.com/alejandro945/hellish-maze/blob/master/docs/STATEMENT.pdf)
* Click here ➡️ [Requirements and Diagram Class](https://github.com/alejandro945/hellish-maze/blob/master/docs/FUNCTIONAL%20REQUIREMENTS.pdf)
## Splash Screen 🚀
* Welcome
## Instructions 🚨
* Rules - Information
## User Section 👾
* Choose your destination
## Maze 👺
* Game Board
## State Modal 🕹
* Nested Modal
## Build with 🛠️
_Project tools_
* Java 8
* JavaFx 8
* JavaFoenix 8
* Scene Builder 1.8
* VS code
## Operation System 📢
* Windows
* Mac
* Linux
[](https://forthebadge.com) [](https://forthebadge.com)
## Authors ✒️
* **Alejandro Varela** - [Alejandro Varela](https://github.com/alejandro945)
* **Luis Murcia** - [Luis Murcia](https://github.com/luis486)
* **Gabriel Suarez** - [Gabriel Suarez](https://github.com/GabrielSB19)
---
Random dev joke for you!
⌨️ con ❤️ por [Alejandro Varela](https://github.com/alejandro945), [Luis Murcia](https://github.com/luis486) y [Gabriel Suarez](https://github.com/GabrielSB19) 🚀