Skip to main content

Six Degrees of Wikipedia

How many clicks from Pizza to the Moon landing? Find the shortest path, or race it yourself.

EVT·T303
Link Graph

About Six Degrees of Wikipedia

Every Wikipedia article links to dozens or hundreds of others, and those links form one enormous map. This tool finds the shortest route across that map between any two articles you pick: the fewest clicks from Pizza to the Moon landing, from a footballer to a fungus, from your hometown to a medieval king.

The search runs live against Wikipedia. It works outward from both ends at once — the links leaving your start page, and the pages that link in to your target — one level at a time, always growing the smaller side, until the two meet. Because levels are finished in order, the first meeting is provably a shortest path. Redirects count as the page they point to, and each link in the path shown is re-checked against the live page before you see it.

It has limits, stated plainly. Wikipedia caps how many requests a tool may send each minute, so each search stops at 100 requests; when that happens before the searches meet, you get the proven minimum (“at least 4 clicks”) rather than a guess. Links come from Wikipedia’s link tables, which include navigation boxes as well as the article text, exactly as when you click around yourself.

Data sourceWikipedia (MediaWiki Action API), live
MethodBidirectional breadth-first search
Last reviewed2026-11-16 by Dennis Traina
      Searching nine other-language Wikipedias requires subscription
      Try:
      Shortest path
      –
      Shortest routes found
      –
      Links re-checked
      –
      Wikipedia queries
      –
      The Path
      Every Shortest Path Found

      The graph of every shortest path requires subscription
      Challenge a Friend

      A link that opens this pair in play mode with the answer hidden. Add your own score and they will see the number to beat.

      Custom challenge links for friends require subscription
      Sign up free to save your history
      Daily Challenge Archive & Streak

      Replay any of the last 30 days. Your results and streak are kept in this browser.

      The 30-day daily-challenge archive and your streak require subscription
      137 Foundry — custom app building studio

      How to Use Six Degrees of Wikipedia

      Start typing an article title and pick it from the suggestions; do the same for the target. The suggestions come from Wikipedia’s own title search, so the tool always starts from a real page rather than a misspelling. Press Find the shortest path and the answer appears as a chain of cards: each page, a one-line summary, and the exact link that takes you to the next one. To try it yourself first, switch to Play it yourself: you start on the first article, pick links from its list, and the tool counts your clicks until you land on the target. The Daily challenge gives everyone the same pair each day.

      Why Almost Everything Is Three or Four Clicks Apart

      The phrase comes from the idea that any two people are linked by a short chain of acquaintances, which Stanley Milgram’s 1960s letter-forwarding experiments made famous. Wikipedia behaves the same way for a structural reason: a few hubs. Articles about countries, years, major cities and broad fields are linked from huge numbers of pages and link out to huge numbers more, so most routes go “up” to a hub and back “down” to the target. Pizza reaches the Moon landing in three clicks; Kevin Bacon reaches Philosophy in two. When a pair takes five or more, one end is usually an obscure page with very few links in or out.

      How the Search Finds the Shortest Route

      Searching outward from one end alone explodes quickly: a page with 500 links leads to roughly 150,000 pages two clicks away. Searching from both ends and meeting in the middle needs only the square root of that work. The tool asks Wikipedia for the links leaving the start page and, separately, for the pages that link in to the target, and keeps growing whichever side is smaller. It finishes each level before starting the next, which is what makes the first meeting provably shortest. Two details keep it honest:

      • Redirects. “Moon landings” redirects to “Moon landing”. A link to the redirect takes you to the same page in one click, so before each level is expanded the tool resolves every redirect at its edge. Without that, it would miss routes and report paths one click too long.
      • Verification. Link tables can lag a fresh edit. Before a path is shown, each of its links is looked up again on the live source page; a hop that no longer exists is flagged rather than presented as fact.

      Playing the Wikipedia Game Well

      People who play the Wikipedia game (or “Wikiracing”) fast tend to use the same moves. Head for a broad hub early — a country, a century, a whole discipline — because hubs are the motorways of the link graph. Think about what the target is a kind of and which big article would mention it: the Moon landing hangs off “Apollo program”, “NASA” and “1969”. Use the filter box to search a long link list for words like the target’s country or field. And remember that navigation boxes count: the long lists at the bottom of an article are often the quickest way sideways.

      What This Tool Does Not Do

      It does not keep a copy of Wikipedia; every search reads the live link tables, which is why the answer can change when an article is edited. It does not log what you search for. And it does not exceed Wikipedia’s limits: when the site-wide allowance is used up for the minute, it tells you to wait rather than hammer a volunteer-run service. Searches that finished are reused for a week, so popular pairs are instant.

      More curiosities from the same shelf: The Day You Were Born, Birthday Twins and Beat the Predictor, or browse every Fun & Novelty tool.

      Frequently Asked Questions

      What counts as a click?

      Following one link from one article to another article. The tool uses Wikipedia’s own link tables, which include every link on the page: the article text, infoboxes, and the navigation boxes and identifier boxes at the bottom. That is the same set of links you can click, and play mode shows exactly that list. Links to redirects count as a link to the page they redirect to, with no extra click.

      Is the path really the shortest?

      Yes, when the tool says it found one. It searches level by level from both ends, so the first time the two searches meet, every shorter route has already been ruled out. If the search reaches its limit first, the tool does not guess: it tells you the minimum number of clicks it has proved, for example “at least 4”. Other routes of the same length often exist; the tool counts the ones it found.

      Why can it not search forever?

      Because it asks Wikipedia live, and Wikipedia limits how many requests an automated tool may make each minute. Each search is capped at 100 requests and 25 seconds, finished searches are kept for a week so repeats are instant, and the pages you click through in play mode are loaded by your own browser.

      Do most articles really connect in six clicks?

      Almost always, and usually in three or four. English Wikipedia has millions of articles but a small number of hubs — countries, years, major cities, broad subjects — that are linked from enormous numbers of pages and link onwards to enormous numbers more. Get to a hub and you can get almost anywhere. The rare exceptions are pages with no links in, or no links out.

      Where does the daily challenge come from?

      Wikipedia’s own front page. The start is an article from that day’s “On this day” section and the target is that day’s featured article, so the pair changes every day at midnight UTC and is the same for everyone.

      Honey-Do Tracker — home maintenance for landlords and property managers
      Honey-Do Tracker — home maintenance for landlords and property managers
      Honey-Do Tracker — home maintenance for landlords and property managers
      Link copied to clipboard!