Nicheloom

Market intelligence for builders — see what's gaining traction before it's crowded.

Sameshi

a ~1200 Elo chess engine that fits within 2KB

Details

External ID
47014500
Source
HN
Company
—
Product
Sameshi
Website domain
github.com
Launched
Feb. 14, 2026
Cohort
—
Upvotes
230
Upvotes percentile
0.9609164420485176
Tags
—
Fetched at
Sept. 7, 2026, 9:25 p.m.
Updated at
Sept. 7, 2026, 9:25 p.m.

Description

I made a chess engine today, and made it fit within 2KB. I used a variant of MinMax called Negamax, with alpha beta pruning. For the board representation I have used a 120-cell "mailbox". I managed to squeeze in checkmate/stalemate in there, after trimming out some edge cases.I am a great fan of demoscene (computer art subculture) since middle school, and hence it was a ritual i had to perform.For estimating the Elo, I measured 240 automated games against Stockfish Elo levels (1320 to 1600) under fixed depth-5 and some constrained rules, using equal color distribution.Then converted pooled win/draw/loss scores to Elo through some standard logistic formula with binomial 95% confidence interval.

Enrichment

Theme
AI agent games and chess tools
Vertical
Horizontal
Function
Hardware & robotics
Audience
Developer
AI stance
Not AI
Project type
Hobby / open-source project
Normalized one-liner
compact chess engine in 2kb
Manually corrected
False

Could you build this?

No While basic minimax chess algorithms can be generated by AI, fitting a full functional chess engine (including move generation, mailbox representation, alpha-beta pruning, and win conditions) into an extreme code-golf constraint of 2KB requires deep low-level algorithmic optimization and byte-level manual hacking.

What it would actually take: To achieve a working ~1200 Elo chess engine under 2KB, one needs handcrafted assembly, C, or minified JavaScript utilizing bitwise operations, compressed board representations (0x88 or 10x12 mailbox), and extreme byte-saving heuristics. Modern AI models frequently hallucinate illegal move mechanics or exceed strict size constraints when attempting aggressive code-golfing. Success requires deep familiarity with tournament rules, micro-optimizations, and algorithmic compression techniques.

Discussion

20 comments analyzed.

Competitors mentioned: Stockfish, asmFish, OliThink, Xiphos, TCEC 4K sized engines

Concerns raised: Missing core chess rules (castling, en passant, promotion, repetition, 50-move rule), Unsigned integers complicate language design and error-handling, Small size claims in chess programs can be fraudulent with hidden limitations, Static evaluation neural net trained with rules that aren't actually enforced, Not actual chess, just chess piece movement simulator

Feature requests: Playable version/play button link, Support for unsigned integer types

Competitors

Other products that read as similar to this one — 116 launches clear the similarity bar, closest 8 shown.

Attention rank: #5 of 117 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).

Launched 106 days after the earliest competitor.

Other launches for this product

Same idea, different domain

Nobody's really built a hardware & robotics tool for Fintech yet.