The race is on a loop, you only pass each point one time. You get from the starting place and return there, passing at each point 1 time, what would be the shortest/fastest path? That’s the problem.

You can probably put weights on the fuel efficiency, based on the cargo weight, distance/speed he can drive (based on the experience and expected value for him), fueling stops, etc. Just add that to A* and some tinkering, I think you could make a good algorithm.

Oh yeah, the biggest allies, the left and ummm, Saudi Arabia, the UAE, Qatar?

I think this is about the travelling salesman math/computer science problem:

https://en.wikipedia.org/wiki/Travelling_salesman_problem

A good video about this:

https://m.youtube.com/watch?v=GiDsjIBOVoA

Surveillance for you, no oversight for me.

He says that, having already adopted the first two, he tackled the third: “When I have the Red Command, Amigos de Amigos (ADA), the PCC here…” he sighs, listing powerful organized crime groups, “as well as a situation in which a huge number of fugitives are roaming the city with impunity, it’s impossible for the police to be arresting everyone. The only way to remove them from circulation to protect society — and place them where [the justice system] has decided they should be — is through technology.”

Funny how a person that’s alledgedly related to PCC (organized crime) complains about them.

I use msys2 (https://www.msys2.org/), it uses pacman as its package manager and has a lot of developer packages (so i can compile fortran and integrating it to python). It comes with bash and a terminal, but I used windows terminal and made a profile for using msys2’s bash, the same on vscode. Then I installed neofetch (https://packages.msys2.org/base/neofetch) and just saw this hahaha.