Wikipedia Game Solver searches for a chain of article links from a starting page to a target page. Use it to explore Wikipedia connections or compare routes for the Wikipedia game.
Enter a start and target article, choose a search mode, and run the solver. Greedy mode follows promising links quickly; shortest-path mode searches more broadly within its depth and search limits. You can inspect the route and the search trace as it runs.
Greedy routes are not guaranteed to be shortest. Search limits and Wikipedia API availability can prevent either mode from finding a route. The solver runs in your browser and requires an internet connection.
Built by Jack Homer. Read the Wikipedia Game Solver project write-up.