JevMade Sign in
← Back to experiments

Apps & data pipelines

TypeSafe Tetris

Autonomous Tetris where a local analyzer enumerates and scores every legal landing and only the best twelve reach Jev, which picks exactly one.

Source screenshot of TypeSafe Tetris
SOURCE SCREENSHOTFull screenshot ↗

What it does

Because the candidate set is bounded by local evaluation, Jev can only ever choose a placement the analyzer already ranked. An API failure pauses the run and can be retried without changing the board.

How you can use it

A developer can adapt this project to let an outside AI service play a puzzle game. The local computer finds every valid move and keeps the best twelve options. It sends these choices and the board layout to the AI service. The service then picks exactly one move to play.

A developer must provide an access key that connects the game to the AI service. The service cannot invent an impossible move because it must choose from the supplied list. If the connection fails, the game simply pauses and waits to try again.

Maker-reported (not independently measured by JevMade): 10×20 board · best 12 candidates per piece · profiles 20 / 40 / 100 lines

Primitives
choice
Platform
TypeScript
Added
Project created

Keep this for later

Sign in to bookmark experiments, guides and videos, and keep notes only you can see.

Continue to sign in

We’ll bring you back to this listing.