INTRO: we scored 11,825,929 at the end of the given time to submit results to the judge system (best score: 49,776,211); we decided to push it further and create a working simulation of the problem
You will find the problem statement of the hashcode 2018 qualification round in the file: qualification_round.pdf
The Simulation Algorithm is the first algorithm tried for this project.
This algorithm simulate a situation where vehicles are searching for a new ride everytime they finish the past one.
It contains a simulation loop which is updating the position of the vehicles at every step.
It scored 47,289,281.
Score detail:
- a_example: 10
- b_should_be_easy: 176,820
- c_no_hurry: 15,791,787
- d_metropolis: 9,859,875
- e_high_bonus: 21,460,789
In this algorithm, every vehicle tries to find the best rides to take to make the maximum amount of point.
The problem with this algorithm is that the first vehicle will take the most rides it can take and the vehicles at the end might have no ride to take.
It is far from being the best.
It scored 37,123,238
Score detail:
- a_example: 10
- b_should_be_easy: 173,377
- c_no_hurry: 9,070,534
- d_metropolis: 6,664,342
- e_high_bonus: 21,214,975
npm install && npm start