Nicheloom

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

WikiFork

Find the shortest Wikipedia chain using binary choices

Details

External ID
1260201
Source
PH
Company
—
Product
WikiFork
Website domain
producthunt.com
Launched
Sept. 25, 2026
Cohort
—
Upvotes
1
Upvotes percentile
0.30815693820825313
Tags
Free Games
Fetched at
Sept. 26, 2026, 10:53 p.m.
Updated at
Sept. 26, 2026, 10:53 p.m.

Description

Two historical figures and a chain of Wikipedia links between them. Two cards a turn: lay down whoever stands fewer links from the target. Ten moves. A perfect run finds the shortest chain there is.

Enrichment

Theme
indie mini-games and interactive toys
Vertical
Media & entertainment
Function
Search & retrieval
Audience
B2C
AI stance
Not AI
Project type
Hobby / open-source project
Normalized one-liner
wikipedia navigation game using binary branch choices
Manually corrected
False

Could you build this?

Partial The binary choice game UI is simple, but precomputing or querying the shortest path between arbitrary Wikipedia articles in real-time requires a massive pre-indexed graph database.

What it would actually take: A full Wikipedia link graph contains millions of nodes and hundreds of millions of edges; running bidirectional BFS on demand requires a custom in-memory graph engine (e.g., in Rust or C++) or an optimized graph database like Neo4j. The game engine also requires caching heuristics to ensure generated pairs have valid, interesting paths of known length.

Competitors

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

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

Launched 254 days after the earliest competitor.

Other launches for this product