HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
klemenvod
TokenBrawl
Python2026–2026
klemenvod / TokenBrawl

TokenBrawl

A 1v1 Bomberman-style game where two LLM agents play autonomously against each other. No human plays — you watch the AIs fight. Each agent receives a text description of the board state, reasons about it, and outputs a move as JSON. The game engine executes it.

2Distinct people
2Mentions
0Explicit recommenders
12GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A 1v1 Bomberman-style game where two LLM agents play autonomously against each other. No human plays — you watch the AIs fight. Each agent receives a text description of the board state, reasons about it, and outputs a move as JSON. The game engine executes it.

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:03:16 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by 3-hour interval2 dated mentions

Observed mentions: 2026-04-14 07:36:39 UTC to 2026-04-16 15:43:04 UTC.

012026-04-14 06:00:00 UTC to 2026-04-14 09:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsApr 14, 06:002026-04-14 09:00:00 UTC to 2026-04-14 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-14 12:00:00 UTC to 2026-04-14 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-14 15:00:00 UTC to 2026-04-14 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-14 18:00:00 UTC to 2026-04-14 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-14 21:00:00 UTC to 2026-04-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-15 00:00:00 UTC to 2026-04-15 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-15 03:00:00 UTC to 2026-04-15 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-15 06:00:00 UTC to 2026-04-15 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-15 09:00:00 UTC to 2026-04-15 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsApr 15, 09:002026-04-15 12:00:00 UTC to 2026-04-15 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-15 15:00:00 UTC to 2026-04-15 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-15 18:00:00 UTC to 2026-04-15 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-15 21:00:00 UTC to 2026-04-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-16 00:00:00 UTC to 2026-04-16 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-16 03:00:00 UTC to 2026-04-16 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-16 06:00:00 UTC to 2026-04-16 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-16 09:00:00 UTC to 2026-04-16 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-16 12:00:00 UTC to 2026-04-16 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2026-04-16 15:00:00 UTC to 2026-04-16 18:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsApr 16, 15:00

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Apr 14, 06:002026-04-14 06:00:00 UTC2026-04-14 09:00:00 UTC110
Apr 14, 09:002026-04-14 09:00:00 UTC2026-04-14 12:00:00 UTC000
Apr 14, 12:002026-04-14 12:00:00 UTC2026-04-14 15:00:00 UTC000
Apr 14, 15:002026-04-14 15:00:00 UTC2026-04-14 18:00:00 UTC000
Apr 14, 18:002026-04-14 18:00:00 UTC2026-04-14 21:00:00 UTC000
Apr 14, 21:002026-04-14 21:00:00 UTC2026-04-15 00:00:00 UTC000
Apr 15, 00:002026-04-15 00:00:00 UTC2026-04-15 03:00:00 UTC000
Apr 15, 03:002026-04-15 03:00:00 UTC2026-04-15 06:00:00 UTC000
Apr 15, 06:002026-04-15 06:00:00 UTC2026-04-15 09:00:00 UTC000
Apr 15, 09:002026-04-15 09:00:00 UTC2026-04-15 12:00:00 UTC000
Apr 15, 12:002026-04-15 12:00:00 UTC2026-04-15 15:00:00 UTC000
Apr 15, 15:002026-04-15 15:00:00 UTC2026-04-15 18:00:00 UTC000
Apr 15, 18:002026-04-15 18:00:00 UTC2026-04-15 21:00:00 UTC000
Apr 15, 21:002026-04-15 21:00:00 UTC2026-04-16 00:00:00 UTC000
Apr 16, 00:002026-04-16 00:00:00 UTC2026-04-16 03:00:00 UTC000
Apr 16, 03:002026-04-16 03:00:00 UTC2026-04-16 06:00:00 UTC000
Apr 16, 06:002026-04-16 06:00:00 UTC2026-04-16 09:00:00 UTC000
Apr 16, 09:002026-04-16 09:00:00 UTC2026-04-16 12:00:00 UTC000
Apr 16, 12:002026-04-16 12:00:00 UTC2026-04-16 15:00:00 UTC000
Apr 16, 15:002026-04-16 15:00:00 UTC2026-04-16 18:00:00 UTC110

What Hacker News says

2 sources

Show HN: A Bomberman-style 1v1 game where LLMs compete in real time

A few weeks ago, ARC-AGI 3 was released. For those unfamiliar, it’s a benchmark designed to study agentic intelligence through interactive environments. I'm a big fan of these kinds of benchmarks as IMO they reveal so much more about the capabilities and limits of agentic AI than static Q&A benchmarks. They are also more intuitive to understand when you are able to actually see how the model behaves in these environments. I wanted to build something in that spirit, but with an environment that pits two LLMs against each other. My criteria were: 1. Strategic & Real-time. The game had to create genuine tradeoffs between speed and quality of reasoning. Smaller models can make more moves but less strategic ones; larger models move slower but smarter. 2. Good harness. I deliberately avoided visual inputs — models are still too slow and not acc
Read the rest
urate enough with them (see: Claude playing Pokémon). Instead, a harness translates the game state into structured text, and the game engine renders the agents' responses as fluid animations. 3. Fun to watch. Because benchmarks don't need to be dry bread :) The end result is a Bomberman-style 1v1 game where two agents compete by destroying bricks and trying to bomb each other. You can check a demo video here: https://youtu.be/4x8tVypmuRk Would love to hear what you think!
2 points · Open discussion

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.