The puzzle solver racing the clock

mp’s ARC-AGI-2 agent needed speed, patience and a way to check its own work. Its experiments suggest abandoning difficult puzzles too early can be costly.

ARC-AGI-2 · · GPT-6.1 Terra Extra High

mp’s tabby character watches glowing puzzle attempts in a workshop with a large unnumbered clock; a nameplate reads mp, Kaggle user, team okiek, public leaderboard, fifteenth.
The Goose’s character for mp works through several ARC puzzles against the clock.

A race against time

An ARC puzzle can resist for a long time before a useful idea arrives. For mp, the trick was finding enough time for those ideas without letting the clock swallow the rest of the field.

In a solution write-up, mp describes an agent that writes Python programs for coloured-grid puzzles, tests them against the examples and sends surviving attempts to a vote. The public-board result put okiek fifteenth; the private results and awards remain to be confirmed.

There is a temptation to pull a struggling solver off a problem and send it somewhere else. In mp’s own tests, aborting slow attempts too early cost points. Difficult attempts were expensive, but an expensive attempt could still be the one that eventually found a usable program. These are the author’s experiments on this system, not a universal rule for every agent.

More attempts, more chances

The contest imposed a twelve-hour limit. mp treated it as a budget for the model’s output: make the system run faster, and the agent could try more approaches before time ran out. The account describes compressing a large Qwen model to fit the competition hardware, then adjusting part of it with reinforcement learning to recover some quality. It also describes changes to the machinery serving the model.

Speed alone did not settle whether an answer was any good. Each puzzle came with examples showing the transformation to learn. The agent could write a program, run it against those examples and revise it when checks failed. Candidates also had to satisfy consistency checks derived from the task. Multiple attempts could then vote on an answer.

Passing the examples was useful, not a guarantee. mp’s analysis says some programs survived verification yet produced wrong answers on test inputs. A rule can explain every example it has seen and still miss the principle behind the puzzle.

The bills hidden in the workshop

The write-up also records less glamorous work on the agent’s surroundings. mp reports finding that a failed library import could be repeated in later code cells, and that some error messages pointed to the wrong line. Fixing those problems improved the author’s own tests.

The Goose had met okiek on the ARC-AGI-2 board before the close. The recorded October roster listed mp’s Kaggle account; the write-up and the public board now give readers a closer look at the system behind the run.

Yi-Chia Chen asked whether giving a solver more time to rethink a passing program resembled the review turns mp had tested. The visible discussion had no answer when checked. The write-up says the submission notebook, model parts and training code are still to come. Will the balance of speed, checks and patience hold up when the rest of the field can try it?

mp: Scaling Qwen Flash-Next and Dots-3 Note · ARC-AGI-2 public leaderboard