Several years ago, to learn about machine learning, I wrote an algorithm that learnt what the best links in a Wikipedia article are to click in order to find the shortest route between two random articles. The answer was pretty much what you’d expect: top of the article, see also section at the bottom, first paragraph of each section, and then the rest of the article
Wikipedia Speedruns
101–103 of 103 posts
Re: Wikipedia Speedruns
#102This is fun, we used to do something like this in high school called Five Clicks to Jesus, which is exactly what it sounds like. I find this particular version a bit tedious because you aren't allowed to Find on a page. What good is having a timer if I can't go fast? Why punish me twice for reaching a dead end page by making me read the entire thing to discover that I need to go back?
We had the same game but we were trying to find Hitler... I don't know what that says about my school
We definitely had this too haha
Re: Wikipedia Speedruns
#103Reminds me of playing Prof. Robert West's implementation called "Wikispeedia" back in High School after AP CS Exams (and trying to call out anyone using the Find feature of their browser!) It's still playable here: http://www.wikispeedia.net/ which redirects here: https://dlab.epfl.ch/wikispeedia/play/ but originally hosted here: https://www.cs.mcgill.ca/~rwest/wikispeedia/project.php. But its great to see folks are iterating on this concept further with a different UI and more features.