TIS-100 Bench: Signal Multiplexer

A selector chooses input A, input B, or their sum. All three input streams must be consumed in step.

In TIS-100 Bench, 16 LLMs each had one attempt at this TIS-100 puzzle, with 10 minutes to find a working program and keep improving it, without seeing the community leaderboard. 15 of 16 models solved it. No model found a new Pareto-frontier point beyond the community leaderboard.

15 / 16models solved it
202best LLM cycles (145 community)
0new frontier points

Records

ScoreCommunity bestBest LLMModel
Cycles145202Muse Spark 1.3 · +39%
Nodes55DeepSeek V4.1 Flash Ties record
Instructions1416DeepSeek V4.1 Flash · +14%

Community records from the community leaderboard when we froze it. A record counts only after fresh-game replay and 100,000 passing random tests.

Pareto frontier

Pareto explorer

Lower is better ↙
Loading interactive Pareto explorer…
Community leaderboardModel frontier pointNew frontier point
Select a point with the mouse or keyboard to inspect its scores and program.

Search over time

Loading puzzle trajectories…

Every model

ModelSolvedBest cyclesBest nodesBest instructionsNew frontier points
01Muse Spark 1.3Yes202516—
02Fable 5.1Yes203516—
03GLM-5.3Yes203516—
04GPT-6 AstraYes203516—
05Gemini 3.8 FlashYes203516—
06Sonnet 5.5Yes203516—
07GPT-6.1 SolYes204516—
08Gemini 4 ArgonYes204516—
09Kimi K3.1 ProYes204516—
10Muse Wonder 1.0Yes204516—
11Opus 5.5Yes204516—
12DeepSeek V4.1 FlashYes237516—
13GPT-6 LunaYes263516—
14Grok 4.7Yes264516—
15Haiku 5.5Yes264516—
16MiMo-V2.6-ProNo————

Best scores can come from different programs. New frontier points are not matched or beaten on all three scores by any community program.

Best model programs

These programs are in TIS-100 save format and released under the MIT License. All of this puzzle’s model programs are on GitHub and Hugging Face.

Muse Spark 1.3 Fewest cycles

202 cycles · 7 nodes · 33 instructions22280.202-7-33.txt on GitHub

Muse Spark 1.3 program running on 22280 in TIS-100
Node 1
MOV UP, RIGHT
MOV UP, DOWN
Node 2
S: MOV UP, ACC
JEZ Z
JLZ A
MOV RIGHT, DOWN
MOV LEFT, NIL
JMP F
A: MOV LEFT, DOWN
MOV RIGHT, NIL
JMP F
Z: MOV LEFT, ACC
ADD RIGHT
MOV ACC, DOWN
F: MOV UP, DOWN
Node 3
MOV UP, LEFT
MOV UP, DOWN
Node 5
MOV UP, RIGHT
Node 6
T: MOV UP, DOWN
MOV UP, ACC
JEZ Z
JLZ A
MOV RIGHT, DOWN
MOV LEFT, NIL
JMP T
A: MOV LEFT, DOWN
MOV RIGHT, NIL
JMP T
Z: MOV LEFT, ACC
ADD RIGHT
MOV ACC, DOWN
Node 7
MOV UP, LEFT
Node 9
MOV UP, DOWN

GPT-6 Astra Fewest nodes

237 cycles · 5 nodes · 19 instructions22280.237-5-19.txt on GitHub

GPT-6 Astra program running on 22280 in TIS-100
Node 1
MOV UP RIGHT
Node 2
L: MOV UP ACC
JEZ SUM
T: JGZ B
A: MOV RIGHT NIL
MOV LEFT DOWN
MOV UP ACC
JNZ T
SUM: MOV LEFT ACC
ADD RIGHT
MOV ACC DOWN
MOV UP ACC
JEZ SUM
JLZ A
B: MOV LEFT NIL
MOV RIGHT DOWN
Node 3
MOV UP LEFT
Node 6
MOV UP DOWN
Node 9
MOV UP DOWN

GPT-6 Astra Fewest instructions

262 cycles · 5 nodes · 16 instructions22280.262-5-16.txt on GitHub

GPT-6 Astra program running on 22280 in TIS-100
Node 1
MOV UP RIGHT
Node 2
L: MOV UP ACC
JGZ B
JEZ S
MOV RIGHT NIL
MOV LEFT DOWN
JMP L
B: MOV LEFT NIL
MOV RIGHT DOWN
JMP L
S: MOV LEFT ACC
ADD RIGHT
MOV ACC DOWN
Node 3
MOV UP LEFT
Node 6
MOV UP DOWN
Node 9
MOV UP DOWN