Agentic coding benchmark
Standings ·
Six frontier models. Two hours each. One traditional Chinese board game.
Every model got roughly two hours of agentic coding time to build a playable Jungle (Dou Shou Qi) program from an empty repository. The finished programs were then played against one another — and any program in which a defect surfaced during competition failed.
DeepSeek · open weights
ClaudeCode + Vision MCP
Alibaba · open weights
ClaudeCode
Anthropic · closed weights
Everything-ClaudeCode
| Rank | Model | Access | Coding harness | Effort | Artifacts |
|---|---|---|---|---|---|
1 | DeepSeek-V4-Pro-0813 DeepSeek | Open | ClaudeCode + Vision MCP | official Max | |
2 | Qwen-3.8 Alibaba | Open | ClaudeCode | xhigh | |
3 | Claude-Fable-5 Anthropic | Closed | Everything-ClaudeCode | Max | |
4 | Grok-4.6 xAI | Closed | GrokBuild | xhigh | |
5tied | GPT-5.6-Sol OpenAI | Closed | Codex | Ultra | |
5tied | Kimi-K3 Moonshot AI | Open | ClaudeCode | Max |
Build phase. Every model received the same task — implement a complete, playable Jungle (Dou Shou Qi) program — and approximately 2hours of agentic coding time in which to finish it. Each model worked inside the coding harness and effort setting recorded against it in the table above, so a row describes a model-plus-harness configuration rather than a model in isolation.
Competition phase. The finished programs were then played against one another. A model is credited with a win when the program it wrote wins its match: what competes is the artifact the model produced, not the model playing live.
Failure criterion. A program in which a defect is observed during competition — an illegal move accepted, a rule applied incorrectly, a crash, or a state the game cannot recover from — is recorded as a failure for the model that wrote it. Correctness is therefore a precondition rather than a tiebreaker: a program that plays strongly but violates a rule does not outrank one that plays correctly.
Snapshot. These standings reflect results as of. Per-match records are not part of this snapshot — the table publishes final placements only. Every entry links to both the deployed build and its full source, so any result here can be replayed and inspected directly.
Jungle — 斗兽棋, Dou Shou Qi, "the game of fighting animals" — is a two-player board game played on a 7×9 grid. Each side commands eight animals. A player wins by moving any piece into the opponent's den, or by capturing every opposing piece.
A piece may ordinarily capture an enemy of equal or lower rank:
Except at the very ends of that ladder: the Rat captures the Elephant, while the Elephant can never touch the Rat. The ranking is a loop, not a line.
Three more exceptions govern the board itself:
These exceptions interact, which is what makes the game a searching two-hour target. A naive implementation yields something that resembles Jungle and plays legally most of the time; the defects concentrate in precisely the positions the exceptions govern. Competition play is what forces those positions to occur.
Places follow standard competition ranking. Two models finished level and therefore share fifth place; the place immediately below a shared position is skipped, so there is no sixth. Rows marked tied are level with one another, not ordered within the tie — the alphabetical order shown inside a tie carries no meaning.
Coding harness names the agent that drove the model, and Effort the reasoning tier it ran at. Both materially affect the result, so a row should be read as one configuration of a model rather than as a verdict on the model at every setting.
Each Play link opens that model's deployed build in a new tab, and each Source link opens the corresponding GitHub repository. All twelve destinations are third-party pages published from this benchmark's own runs.