PM2 Team 02 Projekt 1 Racetrack
Go to file
romanschenk37 fa4842e440 refactoring of Method calculatePath from Game.java to Track.java 2022-03-24 13:32:12 +01:00
follower implemented PathFollowerMoveStrategy.java 2022-03-22 18:20:23 +01:00
gradle/wrapper Initial commit 2022-03-04 09:04:12 +01:00
moves Initial commit 2022-03-04 09:04:12 +01:00
src refactoring of Method calculatePath from Game.java to Track.java 2022-03-24 13:32:12 +01:00
tracks completed Method initphase 2022-03-10 16:30:33 +01:00
.editorconfig Initial commit 2022-03-04 09:04:12 +01:00
.gitattributes Initial commit 2022-03-04 09:04:12 +01:00
.gitignore Initial commit 2022-03-04 09:04:12 +01:00
Klassendiagramm.drawio -CarTest added winpoint test 2022-03-22 19:04:26 +01:00
README.md continued readme 2022-03-23 21:32:15 +01:00
build.gradle Changed mainClass in build.gradle to Main 2022-03-20 13:44:54 +01:00
gradle.properties Initial commit 2022-03-04 09:04:12 +01:00
gradlew Initial commit 2022-03-04 09:04:12 +01:00
gradlew.bat Initial commit 2022-03-04 09:04:12 +01:00
settings.gradle Initial commit 2022-03-04 09:04:12 +01:00

README.md

team02-AngryNerds-projekt1-racetrack

PM2 Team 02 Projekt 1 Racetrack Racetrack is a pen and paper game that dates back to the early 1960s in this version of the game, the game is digitalized and the math behind it is done automatically rather than calculated by hand and the winner gets informed automatically as well.

The aim of the game is to finish the race faster than your opponent or win by being the only survivor in case the other cars crash.

In order to not crash you have to keep in mind the acceleration and other players car to get to the finish line safely.

Initialization:

The game can be initialized by the terminal command:

./gradlew run

You will then be prompted to select a track file from the selection by entering the corresponding number.

For each car that is taking part in the race a strategy has to be chosen there are the following options:

  • Do not move Strategy

This Strategy sets the car stationary, and it won't make any moves during the game staying at the startpoint indefinitely.

  • User Move Strategy

The player is prompted for each move to make a choice the different choices you are able to take are as following:

1=down-left
2=down
3=down-right
4=left
5=no acceleration
6=right
7=up-left
8=up
9=up-right
it is also possible to leave the game when it is your turn by entering 10

  • Move List Strategy

For this strategy a predefined list of moves have to be given, the list may contain all allowed moves like mentioned in User Move Strategy

  • Path Follow Move Strategy

A list of point has to be given to the follow move strategy, the strategy will then calculate the route to cross each point in the given order.

  • Path Finder Strategy

The pathfinder Strategy Calculates a route itself and follows it direction fully automatically.

The shown Track can be interpreted as following:
'#' is a Wall
'>,<,^,v' are finish line components
And every other character represents a car.

Determining a winner

The winner gets determined automatically.
The car that first passes the finish line (doing a complete round) is given the win, if all car except one crash the surviving car will be crowned as the winner.
The game will inform you of this, and you will have the option to quit the game or play another match.

Branching Model

We choose a simple branching model where all starting features got a branch and where merged into the main branch, some branches who needed unfinished code to be completed where taken from the game branch but merged into the main at the end as well.
Since there was just one end product we abstained from using a development branch and merges where done straight into main.

Class Diagramm