Usually, optimization problems are computationally hard and you are supposed to find heuristic ways to find some good-but-not-optimal solution.
This turns out to be a different case: optimizing flight costs for our rocket is reasonably easy and we can actually construct optimal solutions – along with proofs of their optimality. Hence, your submissions were scored according to the actually optimal paths. This also meant that it was possible to get a full score for the problem (even with some small leeway for rounding errors / lack of numerical precision in your calculations).
A full description of the solution is still being written and will be published later.
