Question 1

How does WikiPath find the connection between two things?

Accepted Answer

It runs a bidirectional search outward from both articles at once across the full English Wikipedia link graph — roughly 7.19 million articles — and meets in the middle to find the genuinely shortest chain of real links. It favours prose links, where one article's text actually mentions the next, over the lazy route through giant hub pages. The whole crawl lands in well under ten milliseconds; the story takes longer to read than the path takes to chart.

Question 2

What is the Surprise Score?

Accepted Answer

The Surprise Score is a 0 to 100 rating of how improbable it is that two things sit so few clicks apart. It weighs how far apart they feel — the semantic distance between the two articles' meanings — against how few clicks actually separate them, then penalises routes that cheat through mega-hubs. Two footballers one click apart score low; a pharaoh and a pop star four clicks apart score high. It's the number you'll screenshot.

Question 3

Are the connections real or made up?

Accepted Answer

Every connection is real — these are live Wikipedia links you could click yourself, never invented for effect. The path is drawn from the actual link graph, and the story is anchored to the real sentence in each source article that creates each hop: truth, not source. The narrator brings colour, but it is forbidden from inventing a link that isn't there, and a plain grounded version takes over if it ever wobbles.

Question 4

How many Wikipedia articles does WikiPath cover?

Accepted Answer

The whole of English Wikipedia — about 7.19 million articles, held in memory as one searchable map. If a thing has a Wikipedia page, it's a place on our chart and fair game for a route. The graph is precomputed, so the connection you ask for is drawn from that full map every time, not from a curated shortlist.

Question 5

Is WikiPath free?

Accepted Answer

Yes — chart as many connections as you like, no account, no paywall. WikiPath is built on Wikipedia, whose article text is shared under the CC BY-SA 4.0 licence, and we pass that openness straight through to you. Type two things and go.

Question 6

Can I connect any two things?

Accepted Answer

Any two things with a Wikipedia page — a pharaoh and a pop star, your hometown and a deep-sea fish, a sport and a saint. The shortest chain between any two articles is rarely more than a handful of clicks, so the answer almost always exists; the only real limit is whether a thing has its own page. The fun is that the dares you think can't possibly connect are exactly the ones that score highest.

Question 7

Where do the stories come from?

Accepted Answer

A storyteller narrates each path, but it's kept on a short leash: every claim is anchored to the genuine prose sentence in each article that makes the link, so the story explains a connection that's actually there. It's allowed to add true, well-known colour to make the route land — never to invent a fact or fake a relationship — and a deterministic grounded version steps in if it strays. Built on Wikipedia, CC BY-SA 4.0.