Recorded rounds
Four games, played once
strike-1 played each game once, against an opponent that picks at random. The site replays those answers. These pages never call the model.
Watch it run
Random singles, one choice per turn
strike-1 plays a gen 9 random singles battle against a seeded random opponent. Each turn the model reads a short text summary and picks a legal move or switch, plus a win-likelihood score. One battle was recorded once against the API and replayed here.
Press play. Seed 17291234.
- Turns
- 0/27
- Round trip, p50
- 576 ms
- Decisions
- 27
Last turn action probabilities
Press play to step through the battle.
Win likelihood (p1)
The model never runs the battle engine. It only sees plain text about your active creature, the bench, legal moves, and what the foe shows. Code sends the choice with the highest probability. The opponent picks uniformly among its legal options from the same seed.
Recorded on 18 October 2026 against strike-1. Probabilities are not calibrated. The replay shows every answer exactly as it came back; nothing was edited.
Watch it run
Snake, six yes/no answers per move
Top screen: strike-1. Bottom screen: a coin flip among the moves that do not kill. Both snakes get the same apples. One round was played once against the API and recorded; this is the replay.
Apples 0 · Length 3
Apples 0 · Length 3
Press play. Seed 3310.
- Moves
- 0/521
- Round trip, p50
- 828 ms
- Answers
- 3126
The last move, as the model saw it
| Move | Hits the body | Closer to the food |
|---|---|---|
| Left | - | - |
| Straight | - | - |
| Right | - | - |
The model never sees the board. Each move it reads three sensors (left, straight, right) and answers six yes/no questions: does this move hit the body, does it bring the snake closer to the food. Code picks the move from those six probabilities only, so a wrong answer can kill the snake.
Recorded on 17 October 2026 against strike-1. Probabilities are not calibrated. The replay shows every answer exactly as it came back; nothing was edited.
Watch it run
Blocks, one choice per piece
Top screen: strike-1. Bottom screen: a uniform random pick among every legal drop. Both boards share the same piece order. One round was played once against the API and recorded; this is the replay.
Score 0 · Lines 0
Score 0 · Lines 0
Press play. Seed 88001.
- Pieces
- 0/72
- Round trip, p50
- 1481 ms
- Answers
- 144
The last piece, as the model saw it
| Key | Drop | Probability |
|---|
Stack danger (HUD only)
The model never sees the grid. Each piece it reads stack height, hole count, the current and next shape, and up to twelve candidate drops (rotation and column). Code locks the piece from the choice probabilities only, so a weak pick can top out the stack. The danger score is shown in the HUD only.
Recorded on 17 October 2026 against strike-1. Probabilities are not calibrated. The replay shows every answer exactly as it came back; nothing was edited.
Watch it run
Runner, six yes/no answers per ground tile
Top screen: strike-1. Bottom screen: a blind pick among safe run, jump, and long jump. Both runners share the same seeded level. One round was played once against the API and recorded; this is the replay.
Score 0 · Distance 0 · Coins 0 · Stomps 0
Score 0 · Distance 0 · Coins 0 · Stomps 0
Press play. Seed 31415926.
- Ticks
- 0/367
- Round trip, p50
- 1154 ms
- Answers
- 954
The last ground tile, as the model saw it
| Action | Ends the run | Coin or enemy |
|---|---|---|
| Run | - | - |
| Short jump | - | - |
| Long jump | - | - |
The model never sees the level. On each ground tile it reads plain geometry and answers six yes/no questions about whether run, short jump, or long jump would end the run or collect a coin or stomp. Code drops the relatively riskiest answers (not only those above 0.5), then picks the best remaining reward from those six probabilities only.
Recorded on 18 October 2026 against strike-1. Probabilities are not calibrated. The replay shows every answer exactly as it came back; nothing was edited.