miscPromedium
Беги, Баг, беги! (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).
$ ls tags/ techniques/
mazeexpressoptimizationsimulationweb_apisimulated_annealingdeterministic_walkerleast_visited_neighborfirst_passage_time
engine_port_to_pythonsimulated_annealing_with_seed_chainingfirst_passage_time_maximizationapi_submission
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Sign in with GitHub to continue. No email required.
$sign in$ grep --similar
Similar writeups
- [misc][Pro]Лабиринт (Labyrinth)— duckerz
- [misc][Pro]Скоростные Пазлы – 1 (Fast Puzzles – 1)— bug-makers
- [web][Pro]Прыгай!— bug-makers
- [web][Pro]Скоростные Пазлы – 2 (Speed Puzzles – 2)— bug-makers
- [misc][Pro]Скоростные Пазлы – 3 (Fast Puzzles – 3)— bug-makers