The Great Wikipedia Six Degrees of Separation Game
The object of the game is to get from one page of Wikipedia to another, using no more than six intervening links.
You may leave Wikipedia, but obviously no URL in between may be a search engine's.
The winner will be the one who does it with the lowest number of in-between links.
In case of a tie, not leaving Wikipedia will count as a bonus, and in case there's still a tie, the fastest answer will win.
Here's an invalid example (because it uses seven and not six levels of separation):
To get from Jay Leno to the Roman Republic, you may follow the following trail:
See also Saar's four (!) steps solution in the Comments below.
Please give your solution in the comments below (don't forget to mention which puzzle you are solving).
Enjoy!
2010.11.22
How to get from Colophon to Semper fidelis ?
End of contest: 2010.12.02 at 00:00 UTC
2010.11.19
How to get from Email to the Battle of Stalingrad ?
End of contest: 2010.12.01 at 00:00 UTC
2010.11.18
- How to get from Khandahar to Quetzalcoatl ?
- How to get from Ginseng to Scipio Aemilianus ?
End of contest: 2010.12.03 at 00:00 UTC
2010.11.16
How to get from snowboarding to predestination ?
End of contest: 2010.12.01 at 00:00 UTC
2010.11.15
How to get from Jerusalem to Gulliver's Travels ?
