In this challenge you have a city map and a bunch of passengers to pick up and deliver with your computer controlled car fleet. You just have to work out the best way to deliver the 300 or so passengers without keeping them waiting too long and making the most money.
The image above is the city with gray bars being the roads.
That starts in December, meanwhile the deadline for challenge 64 is December 2nd so just over a week to get your entry in for that. I hope to have Linkage running tomorrow as well.
- Enter Challenge 64
- Read the spec of the Linkage contest.
” Note once a car has dropped off and is empty, you can leave it where it dropped off or move it somewhere else.”
So we will indicate where a taxi moves after dropoff simply by the third line of its next pickup — the list of moves it made to reach the pickup. And your checker will determine if the taxi had enough time to travel that path between its last dropoff and the pickup time listed in line 1, correct?
“If the passenger walked because no cab appeared use -1, -1, -1,0 for p,e,n,i and a single -1 for the 3rd line if no taxi was sent!”
What should the second line be? 0? F and D?
Mark
Thanks for picking up on my design omissions!
Checker will determine time yes.
A value of 0 seems reasonable for no taxi showing up, I’ll update it.
David
About C,C++,C# and Go
Can we have multiple cars on the same road slot at the same time?
Yes no problems. I’e updated the challenge.
David