Kocaeli universitesi, prolab II I
This is a shortest distance problem.
To begin with a grid of n x m size is created.
There will be a grid with obstacles as walls and pathway.
There are good and bad characters with different capacity and specialities.
Characters are placed on the grid.
Each character will have an entry point or initial location on the grid.
While a good characters tries to reach the end point to get a trophy, hunters or bad characters try to reach him by finding the shortest path and following it.
there are two main characters refered to as good characters in the game.
- LukeSkyWalker can move n steps in a given direction( automatically or controlled by user)
- LukeSkyWalker will have limited life compared to othere characters he is the weakest. ...
- Same as LukeSkyWalker, he can move n steps in any direction
- Master yoda is a die hard and has 2 times longer life than LukeSkyWalker
- Master yoda can use doors on the board as shortcut or portals to the otherside of the board. ...
- It is the purpose of a hunter to find the shortest path the good character which is a moving target.
Considerably the weakest of all.
He can move 1 step(s)
Can move 2 steps in direction.
Can use doors as getway to the other side
Has a limited number of times he can go through walls i.e obstacles.
Can move n steps in a given direction.
He can use doors.
Can move though walls n given times.
The project is sorely build in Java.
In your favourite Java IDE you will need to clone this repository. maven will set up all required dependencies. run UserInterface java file and you are good to go...
- Clone the repo
git https://github.com/possenalain/prolab-ii-i-starwars.git
- Import the project into your IDE.
- build with maven.
- Reading harita.txt (bootstraping file) the game gets initialized.
- choose with which character you would play as.
- game board (labyrinth). is the created thus the game starts.
- ...
Depending on the size of the labyrinth represented as a matrix the time it takes to find the shortest path gets high
In the future I intend to use dynamic programming and find all best routes from any point to anyother on the grid instead of recalculating every single time a character makes a move.
## ContributingContributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
Distributed under the MIT License. See LICENSE.txt for more information.
Project Link: https://github.com/possenalain/prolab-ii-i-starwars.git