About WikiLink

What WikiLink does

Pick any two English Wikipedia pages. WikiLink finds the fewest clicks it takes to get from the first to the second, following only the links inside articles, and tells that chain as one sentence.

How the shortest path is found

WikiLink searches every link between English Wikipedia articles, working out from the first page and back from the second until the two searches meet. The search is exact: when it says three hops, there is no route with two.

Links are directional. A page can link to another without being linked back, so swapping the two pages can give a different answer, or none at all. When several routes tie for shortest, the others appear below the story. A very long search can run out of time; when that happens WikiLink says so instead of guessing.

The map of links comes from the data Wikipedia publishes every month, so a link added in the last few weeks may not be in it yet.

How the story is written

Each phrase in the story comes from the sentence in the article that holds the link. If an article says “Murray starred in the 1993 comedy Groundhog Day”, the story reads “starred in Groundhog Day (film)”. When no such sentence can be found, a neutral phrase such as “connects to” stands in. No AI model writes or rewrites the story.

How the daily game works

WikiLink Daily gives everyone the same two pages each day. You get from one to the other by clicking links in the article, as you would on Wikipedia, and every click is a hop. A new puzzle starts at midnight where you are.

Going back is allowed but costs a hop; Hard mode takes it away. Your best possible score is the same exact search that powers the rest of the site. How you compare with other players comes from scores each browser reports, so treat it as friendly rather than official.