ICFP Contest Report
summary
ICFP programming contest tasks teams to reconstruct randomized maps of a labyrinth whose rooms have six doors and only two‑bit labels; a server returns sequences of those labels from walks and maps reset on wrong guesses. Top solutions encode observations into SAT and solve them after one long walk + SAT encoding, others use simulated annealing to pick walks, one team uses active automata learning. Scoring uses board count scoring; winners include Unagi and Oyo (Rust), Purely Functional Networks (C++), heuristics and Python tools perform well.
AI-written summary · about