Беги, Баг, беги! (Run, Bug, Run!)

bug-makers

Task: maze game where a deterministic least-visited-neighbor 'bug' walker is simulated server-side on a submitted 31x21 map; the flag requires the walk to take >=250000 steps. Solution: port the JS engine to Python, recognize score = first-passage time to the exit's unique neighbor, then maximize it via simulated annealing with iterative seed-chaining and light perturbation to build a dense irregular maze (273598 steps).