https://github.com/0xtter/jurassic-fight
This Java project simulates dinosaur clans that move on a field to gain knowledge and share it upon return. The program tracks dinosaur movements and knowledge acquisition to determine the winner. With a focus on entertainment and education, this project provides a unique way to learn about Java programming and dinosaur behavior.
https://github.com/0xtter/jurassic-fight
game java simulation
Last synced: 9 months ago
JSON representation
This Java project simulates dinosaur clans that move on a field to gain knowledge and share it upon return. The program tracks dinosaur movements and knowledge acquisition to determine the winner. With a focus on entertainment and education, this project provides a unique way to learn about Java programming and dinosaur behavior.
- Host: GitHub
- URL: https://github.com/0xtter/jurassic-fight
- Owner: 0xtter
- License: mit
- Created: 2022-10-03T15:04:31.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-11-20T21:44:00.000Z (over 3 years ago)
- Last Synced: 2025-04-03T14:46:06.144Z (about 1 year ago)
- Topics: game, java, simulation
- Language: Java
- Homepage:
- Size: 8.98 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Jurassic-Fight
[Github Page](https://github.com/0xtter/Jurassic-Fight)
| Nom | Ptérodactyle | Tyrannosaures | Diplodocus | Mosasaures |
| --- | ------------ | ------------- | ---------- | ---------- |
| | | | | |
## Requirements 📑
### Scenario
- [ ] 4 Groups in competition.
- [ ] Alliances between the groups.
- [ ] Specificial individual for each group called "Master".
- [ ] The more a teacher has listened to different messages, the more likely the group is to be the wiser and therefore to be the winner.
- [ ] The Master cannot move.
- [ ] Individuals brings back knowledge to the master.
- [ ] The exchange of message between two individuals is done according to their group and a possible alliance.
- [ ] Pseudo randomness on the movements.
- [ ] Pseudo randomness on the reception of the messages.
- [ ] Event (like asteroid or tsunami) that can influence the scene.
### Class Diagram
Map Class
- [ ] Rectangular shape.
- [ ] Each corner has a 'SafeZone'.
- [ ] Sum of the 4 SafeZones are less than half of the surface of the map.
- [ ] Each master is static in the SafeZone
- [ ] The map is discretized into n*m boxes.
- [ ] The boxes are identifiable by a horizontal index and a vertical index.
- [ ] A method of the Map class will return the tiles available around a tile given as a parameter.
- [ ] A method will return the direction to take to reach your own SafeZone.
- [ ] Obstacles can be generated randomly at the start of the simulation.
- [ ] Each box can contain a maximum of one indidividual or obstacle; when there
### Statechart Diagram
### Activity Diagram
### Simulation
- [ ] The simulation is discrete and at constant time step.
- [ ] At each stage, all mobile individuals have a method running in order to make them evolve on the Map.
- [ ] The order of manipulation of individuals is calculated randomly.
- [ ] The simulation ends when one of the masters has all the messages in the game.
- [ ] If after a fixed number of time steps, the game hasn't ended, It will be forced to end.
- [ ] If so, the winner should be determined by a specific.
### Individuals
- [ ] There must be 2 alliances.
- [ ] Must have an array of string to store messages received and collected during the game.
- [ ] Must know the previous position ((x,y) or (NE , N , SW , ...)
- [ ] System of Energy point. Spent outside base, gain inside.
- [ ] move function are called in a random order for each creature.
- [ ] The behaviour of the creature depends on the level of EP. If EP>50%, explore , if EP<20%, flee to the base , ...
### Code
- [ ] Polymorphism (method reacting to the class of the input).
- [ ] Static attribute.
- [ ] Singleton.
- [ ] Pseudo-random method.