Traveling Santa

OpenFrontierCS · algorithmicLive

Traveling Santa with a carrot constraint: output a city tour minimizing travel time, where every 10th step costs 10% more unless it starts from a prime-numbered city. Scored 0–1 against a strengthened baseline across 20 hidden cases. Time limit 2.5s, memory 512 MB.

10
solvers
1.6266
current best