Is the 6 Degrees of Wikipedia Game Functional Again?

In summary: Just enter the starting and ending points and it will find the shortest path.In summary, the Shortest Path from Invariant Subspace Problem to Paris Hilton can be found by following the links on the Wikipedia pages for Music of England, Automobile, and Nicole Kidman.
  • #1
fourier jr
765
13
I know this was posted before a long time ago, but it wasn't working for a while, and now it's back. Have some fun :biggrin:

example:
Shortest path from invariant subspace problem to paris hilton
Invariant subspace problem
Functional analysis
2004
February 17
Paris Hilton
4 clicks needed

http://www.netsoc.tcd.ie/~mu/wiki/
 
Physics news on Phys.org
  • #2
Kevin Bacon
Liza Weil (Stir of Echoes - the babysitter)
Me (I went to high school with her)
You!
 
  • #3
Posted from the banner ad.

>> How the daisy got its spots... and why
>> Google-Fujitsu join 'smart objects' alliance
 
  • #4
I almost thought it wasn't working but apparently you must capitalize proper nouns.

Squid
Greece
1967
Nicole Kidman
3 clicks needed
 
  • #5
Okay, I'm not sure how this works. Do we pick a start point and an end point and then click links on Wikipedia pages until we get from one to the next?
 
  • #6
GeorginaS said:
Okay, I'm not sure how this works. Do we pick a start point and an end point and then click links on Wikipedia pages until we get from one to the next?

I picked sandpaper and God and got there in 4 clicks. Doesn't seem very hard when there's plenty of links to click on.
 
  • #7
Wow anything is possible:Polynomial remainder theorem
Algebra
Omar Khayyám
Debra Paget
Birds of Paradise
Western Parotia
5 clicks needed
 
  • #8
GeorginaS said:
Okay, I'm not sure how this works. Do we pick a start point and an end point and then click links on Wikipedia pages until we get from one to the next?

Yes, but using the year or date pages is cheating
 
  • #9
Try using two usernames. For instance Sorry! and Leroy Jenkens.

http://en.wikipedia.org/wiki/Sorry!_(game )
http://en.wikipedia.org/wiki/Leroy_Jenkins_(jazz_musician )


Sorry!
England
Music of England
Bagpipe
Musical instrument
List of musical instruments
Viola
List of violists
Leroy Jenkens
 
Last edited by a moderator:
  • #10
Seems like to get from house to car one has to go through Brazil:

Shortest path from house to car
(view reverse path)

House
Brazil
Automobile
2 clicks needed

What a detour.
 
  • #11
tila tequila (the hot asian chick from shot at love)
april 6
1969
pauley perrette (the hot goth chick from ncis)
3 clicks needed
 
  • #12
GeorginaS said:
Okay, I'm not sure how this works. Do we pick a start point and an end point and then click links on Wikipedia pages until we get from one to the next?

There is a game like Mgb describes but if you follow the link in the OP it takes you to a page with an engine that will find the shortest route for you.

http://www.netsoc.tcd.ie/~mu/wiki/
 
  • #13
http://www.netsoc.tcd.ie/~mu/cgi-bin/shortpath.cgi?from=Barrack+Obama&to=Awesome
 
Last edited by a moderator:
  • #14
Pinu7 said:
http://www.netsoc.tcd.ie/~mu/cgi-bin/shortpath.cgi?from=Barrack+Obama&to=Awesome

LOL That is pretty funny.
 
Last edited by a moderator:
  • #15
Pinu7 said:
http://www.netsoc.tcd.ie/~mu/cgi-bin/shortpath.cgi?from=Barrack+Obama&to=Awesome

Oddly there is a reverse path.
 
Last edited by a moderator:
  • #16
TheStatutoryApe said:
Oddly there is a reverse path.

The other pages don't have to link to each other. So if A links to B that doesn't mean B has to link to A.
 

FAQ: Is the 6 Degrees of Wikipedia Game Functional Again?

What is "6 degrees of Wikipedia (again)"?

"6 degrees of Wikipedia (again)" is a game that is based on the concept of the "six degrees of separation," where any two people in the world are connected by no more than six acquaintances. In this game, players try to navigate from one Wikipedia article to another using only hyperlinks within the articles, in six clicks or less.

How does the game work?

Players start with a specific Wikipedia article and must navigate to a different article by clicking on hyperlinks within the article. They must do so in six clicks or less. Each click counts as one degree of separation. The goal is to see if the player can successfully reach the target article within six degrees of separation.

Is there a specific set of rules for the game?

There are no specific rules for "6 degrees of Wikipedia (again)." However, players must follow a few guidelines to make the game fair and challenging. They must only use hyperlinks within the Wikipedia articles, and they cannot use the back button or any external search engines to navigate between articles.

Can players choose any Wikipedia article to start with?

Yes, players can choose any Wikipedia article to start with. However, it is recommended to start with a relatively obscure article to make the game more challenging. Starting with a popular article may make it easier to reach the target article within six degrees of separation.

Is there a time limit for completing the game?

There is no set time limit for completing the game. However, players can set a time limit for themselves to make the game more challenging. It is also recommended to time each round to see how quickly the player can reach the target article within six degrees of separation.

Similar threads

I Some questions about Cosmic Inflation
Replies
4
Views
2K
Summer pictures, or Boreks in Croatia (and Hungary)
Replies
28
Views
13K
Challenge Math Challenge - November 2018
6
Replies
175
Views
22K
Do You Have What it Takes to Be a True Mathematician?
Replies
21
Views
4K
Complex integration: which path should i choose?
Replies
2
Views
2K
  • Sticky
Kerbal Space Program Tutorial Series - Open Access to 1.7
2
Replies
48
Views
63K
Challenge Math Challenge - December 2018
2
Replies
67
Views
12K
Prospects of spin foam formalism in loop quantum gravity [Alexandrov, Roche]
Replies
9
Views
6K
Mathematica This Week's Finds in Mathematical Physics (Week 226)
Replies
7
Views
3K
Mathematica This Week's Finds in Mathematical Physics (Week 267)
Replies
1
Views
3K

Hot Threads

Recent Insights

Back
Top