Six Degrees of Wikipedia

An anonymous reader notes that someone has applied the game Six Degrees of Kevin Bacon to the articles in Wikipedia. Instead of the relation being "in the same film," he used "is linked to by." From the blog post: "We'll call the 'Kevin Bacon number' from one article to another the 'distance' between them. It's then possible to work out the 'closeness' of an article in Wikipedia as its average distance to any other article. I wanted to find the centre of Wikipedia, that is, the article that is closest to all other articles (has minimum [distance])."

I know the center

[plover]

It's pretty obvious, and has a Bacon number of 1.0: http://en.wikipedia.org/wiki/Main_Page [wikipedia.org]

Re:I know the center

[nebaz]

I think the spirit of the discussion, since Wikipedia is actually a directed graph, is more from the sender's perspective. Every page has a link to the main page, but not the other way around. The main page does not directly link to all other pages (though with search, you can find them).

(me, -1 Obvious)

Re:

[oodaloop]

So it should have a high prestige, but not closeness.

-5 Obvious

Re:I know the center

[smitty97]

no, this is it:

http://en.wikipedia.org/wiki/Kevin_Bacon [wikipedia.org]

Billy Jean King is the center!

[goombah99]

Is that the one Michael Jackson sings about?

three clicks to to hell:

slashdot
slashdot effect
Larry Niven
Hell

Re:

[Rei]

Yeah, it's pretty amazing how quickly seemingly unrelated things interconnect. Example:

Shortest path from Aptera Motors to Pop Tart

Aptera Motors
California
January 13
American Idol
Pop-Tart

4 clicks needed

Or:


Shortest path from Parking pawl to Fermionic condensate

Parking pawl
1965
Brazil
Chemistry
Fermionic condensate

4 clicks needed


The dates and lists help it out an awful lot; it'd be interesting to see the results if you could exclude them.

Re:

[Charles Dodgeson]

Well, the center really should have number 0, and it should be either on the Erdos number page [wikipedia.org] or, if one insists, on the Kevin Bacon page.

Re:I know the center

[Eudial]

The point with wikipedia is being omitted altogether. In wikipedia, there is just one degree of separation.

(1) See an article.
(2) See another unrelated article.
(3) Edit articles 1 and 2 to link to each other.

Complexity O(1). You could write a (very unpopular) bot that links all wikipedia articles.

Re:I know the center

[saskboy]

Or be even more of a smartass, and write a bot that links all Wikipedia articles to Kevin Bacon's!

Baconator

[goombah99]

Or be even more of a smartass, and write a bot that links all Wikipedia articles to Kevin Bacon's!

The way to do this is to have every page list it's bacon number at the bottom, and then have the "bacon" be linked to kevin. Of course this would be construction mean every article had a bacon number of one.

Re:I know the center

[JordanL]

I find it incredibly ammusing that Bukkake is only three clicks away from The Roman Catholic Church...

By way of the Japanese Language evidentally.

http://www.netsoc.tcd.ie/~mu/cgi-bin/shortpath.cgi?from=bukkake&to=catholic+church [netsoc.tcd.ie]

Re:I know the center

[Anonymous Coward]

I find it incredibly amusing that that was one of the first connections you looked for...

Re:

[Slashidiot]

I've been delighted to find out the shortest path from A to B. Two clicks, through ASCII. So it's not a straight line, as people try to make us believe...

Re:

[Fumus]

Funny that. Start to end has five clicks needed.

Shortest path from start to end
Start
Start signal
Code
Computer printer
Black
End
5 clicks needed

And now

[Anonymous Coward]

I know that Kurt Vonnegut is apparently the only link between Douglas Adams and Adolph Hitler.

Cool stats though.

No... I'd rather not

[OMNIpotusCOM]

I'd be more impressed if we could find the center of Slashdot... except that it's probably somewhere near CowboyNeal's taint. So, on second thought... maybe not.

Why wouldn't there be disjoint partitions?

[Palmyst]

Ignoring obvious stuff like main page, index etc.. is it not possible that there could be two articles that are not in the same transitive closure at all?

Re:Why wouldn't there be disjoint partitions?

[Intron]

In theory. I haven't found two articles with a separation greater than 4, tho.

Orca
Argentina
Saxophone
Oboe
3 clicks needed

Re:Why wouldn't there be disjoint partitions?

[mfarah]

So far, my "personal best" has been 5 clicks:

Shortest path from Pelagius of Asturias to Pham Nuwen

Pelagius of Asturias
Iberian Peninsula
Africa
Zheng He
A Deepness in the Sky
Pham Nuwen

5 clicks needed

I've found several others that require 5 links.

I wish Stephen Dolan would have posted which article(s) has(have) the BIGGEST number as well...

Re:Why wouldn't there be disjoint partitions?

[imsabbel]

I totally approve of your choice of search words.

Re:

[Redacted]

Shortest path from Nikon D300 to Ossa

No path found

What do I win?

Re:

[MrAnnoyanceToYou]

Meh. There's a path I found manually in about a minute. There's probably a shorter one, though;
Ossa
Motorcycle
Toyota
Honda
Nikon
Nikon D300

Re:

[stedo]

Those both link to the article "Ossa (motorcycle)", which isn't what the original poster had. In that case, the shortest path is Nikon D300->August 23->Rik Smits->Motocross Ossa (motorcycle). There is no path to the article "Ossa" (a disambiguation page), staying within the main namespace (no Wikipedia: or User: links).

Stephen Dolan, aka mu

Re:Why wouldn't there be disjoint partitions?

[Gat0r30y]

If you follow the best route in all cases, it takes an average of 4.573 clicks to get from any Wikipedia article to any other.

It would appear there aren't any. Why? I haven't the slightest, however, since editors can add to many seemingly disjoint articles, it would seem that could help - though I'm not sure if the method used here would take that into account.

Re:

[Anonymous Cowpat]

well, according to "Complexity vs. stability in small-world networks." (Sitabhra Sinha. Journal of Physics. 2004):

The number of links per node (bi-directional), k (must be) >> ln(N), where N is the number of nodes, to avoid a fragmented network (assuming undirected link distribution).
So - figure out the number of pages (nodes) in wikipedia, slap a natural log around it and you know how many links you would need to double and then have much more than to avoid fragmentation.

So, you need much more than ~

Re:

[goombah99]

why 29

Re:

[Anonymous Cowpat]

taking the number from the article; there are 2,111,479 articles on wikipedia. ln(2111479) is ~14.5.

hence there must be >> 2(14.5) links per node.

Re:

[thue]

There is a disjoint partition, since you can count every article which is not linked to as an element in the disjoint partition. A list of article which is not linked to is at http://en.wikipedia.org/wiki/Special:LonelyPages [wikipedia.org]

Re:Why wouldn't there be disjoint partitions?

[Migrant Programmer]

That page links to them..

Re:Why wouldn't there be disjoint partitions?

[psychodelicacy]

Makes me think of Russell's paradox...

Re:

[Gat0r30y]

Those aren't linked from any other articles - but they link to other wikipedia articles. Since its a directional graph he's using (from what I gathered) it would appear to me that these would only be disjoint in a one way sort of style. I.E. You can get from A to B in a finite number of steps but you cannot get from B to A - he appears to measure the minimum distance. - However I was able to get thies -
Shortest path from Agassaim to bananas No path found
However that is not always the case for "orphan

Re:

[stedo]

Yes, there are. Read the rest of TFA for exactly how this is handled, but the gist is: closeness of an article = [total length of all shortest paths from this article]/[number of articles reachable from here]. There are a couple of disjoint sets, but they don't actually affect the results much as they're all tiny (disambig pages, etc)

Where All...

[TheLazySci-FiAuthor]

It's sometimes eerie to think of an idea and then see that someone has done it over the weekend and posted it on slashdot.

Last friday at work I was researching different chemicals on wikipedia (a favorite past time of mine) and thought it would be pretty neat if there was a way to find how related two articles were - or to have some way to query the links between two articles to find similarities.

What I really wanted was a very simple query. My SQL is very rusty, so a plain english version might be perhaps, 'show links where link exists in article_a and article_b'

Is there a way to execute SQL queries on wikipedia without having to actually download the entire database? I asked google, but was presented with the SQL page on wikipedia....

Re:Where All...

[corsec67]

Is there a way to execute SQL queries on wikipedia without having to actually download the entire database? I asked google, but was presented with the SQL page on wikipedia....

If there was a way to do that, it would be through a SQL injection hack.

So, hopefully not.

"What is the use...

[jd]

...in staying up all night arguing over whether there is or isn't a God, if the machine only gives you his bleedin' phone number in the morning!"

You're not the only one with this problem, I fear.

Re:

[TheLazySci-FiAuthor]

Deep Thoughts do abound around here, eh? ;)

Re:Where All...

[borizz]

My SQL is very rusty

Yes, and removing the space between My and SQL doesn't really help much either...

Re:

[blhack]

This is a troll....right?

Please, tell me this is a troll.

GET OFF MY LAWN YOU SON OF A BITCH!

Re:

[SQLGuru]

If you're old enough to have a lawn, you wouldn't be using this new fangled SQL stuff and you'd be sticking to your ISAM files......

Your lawn is full of grub worms!

Layne

Erdos number, please!

[Charles Dodgeson]

This is News for Nerds. Surely the analogy should be to Erdos numbers [oakland.edu], not Kevin Bacon.

Re:Erdos number, please!

[mrbluze]

Surely the analogy should be to Erdos numbers [oakland.edu], not Kevin Bacon. --

Erdos numbers just don't have the same crackling sound to them.

Re:

[timeOday]

I think this is more interesting than either Erdos number or Kevin Bacon number - those are both social network proximities. This is about the proximity of general information. And IMHO it's somewhat believable - if I, John Doe, linked to an article about myself from the article on the UK, it would be removed very quickly. I do wonder if the results are very different than if you did latent semantic analysis on a big corpus of text from more varied sources though. I think links would be somewhat more ec

Re:

[grizdog]

Also, I'm sure Erdos has priority. I remember people talking about Erdos numbers in the early 80s. I don't think Bacon number goes back before 1990.

United Kingdom?

[Palmyst]

Legacy of the colonial era, no doubt.

This is news?

[oodaloop]

Almost every network exhibits small world phenomena. Neural networks, human networks, www, etc. EVERY actor is connected to every other actor by 6 or fewer degrees, not just Kevin Bacon. And every human is connected to every other human by 6 or fewer degrees. And while understanding how small world phenomena helps us understand human networks, I fail to see how this is even slightly interesting applied to Wikipedia.

Re:This is news?

[timeOday]

Small world phenomena in general aren't very interesting, but the specific results are. Your comment is like having an election and saying "big deal, I knew somebody would win!"

Re:

[oodaloop]

I disagree. To me, the opposite is true. I work in the intelligence community, and small world phenomena means a great deal to me. When looking at terrorist networks, for instance, it comes as no surprise to me that every low-level member is only a few links away from the leader, though it never fails to amaze most of my coworkers. Knowing centrality or closeness out to three decimal places usually doesn't mean a whole lot, but knowing about small world phenomena allows a greater understanding of how th

Re:

[Moridineas]

OSC?

Re:

[Gat0r30y]

Did you bother to read the notes on how he parsed the data, or how he used group theory, or how he used distributed computing? While not particularly newsworthy in their own right. I thought that was pretty interesting even if the result should be expected. Also the little shortest path search is pretty fun to play with.

Well, that depends.

[jd]

The six degrees of seperation is an easily-misunderstood concept, making it important that what it is people are looking for is also what people think they are looking for.

The next thing to consider is that Wikipedia is produced by self-selecting contributors who are (necessariy) selective as to what facts (and what references) are to be used, making this a definitely non-random sample using incomplete data out of a population that may have unexpected biases.

What matters, then, is that even under heavil

Link distance

[ninjapiratemonkey]

The distance going from Article A to Article B is not necessarily the same as from Article B to article A. For example, the Slashdot [wikipedia.org] page links to the HTTP [wikipedia.org] page, but not vice versa. It would be interesting to know if he took that into consideration when counting links, or whether he would have counted it as one in either direction.

Re:Link distance

[stedo]

I just took it as distance outwards. The "center" I came up with is the article from which it is easiest to get to all others.

Re:Link distance

[jd]

In mathematical terms, this makes Wikipedia a non-simply-connected space. This has two consequences. Firstly, it makes the topology much harder to describe. Secondly, it means that topologists should have enough research material to write books and papers on the dynamics of Wikispace for years to come.

Re:

[wirelessbuzzers]

In mathematical terms, this makes Wikipedia a non-simply-connected space.

No, it doesn't. In a simply-connected space, any path between two points is fundamentally the same. Non-simply-connected refers to a shape like a torus, in which getting somewhere by going clockwise and by going counter-clockwise are fundamentally different.

What it does mean, however, is that "Wikipedia distance" is not a metric.

Re:

[line-bundle]

I think there is a simple to prove theorem:

If the distance from article A to B is n, then the distance from B to A is at most 2n.

Proof:
Because every page has a "What links here" page we can walk backwards in twice as many steps. There could be a shorter path which is why the bound is not strict.

Re:

[ArsonSmith]

I found this one interesting:

Shortest path from george bush to satan

George Bush
George H. W. Bush
Andover, Massachusetts
Satan

3 clicks needed

Further Proof that...

[LionKimbro]

...the sun never sets, on the British Empire.

Call my lawyer!

[Nephroth]

I thought of this years ago! I've got blog posts as prior art! SOMEBODY GET ME A MARSHALL TEXAS JUDGE ON THE LINE!

Yes, I read XKCD

[orkysoft]

This seems to be the obligatory XKCD.com link. [xkcd.com]

"six degrees" connections are not uniform

[smellsofbikes]

In case anyone is interested, the original research that created the idea of 'six degrees of separation' is summarized and analyzed by Malcolm Gladwell in his essay Six Degrees Of Lois Weisberg [gladwell.com]. The original research was done by Stanley Milgram (of greater fame for the (in)famous Milgram Experiment [wikipedia.org] in which people were led to believe that they were shocking other people to death, but continued to do so anyway because they were Just Following Orders.) Milgram's six-degrees research, to sum up, involved handing out a large number of letters to random people, and asking them to give the letters to other people they knew who they thought would be most likely to know a (given, random, unknown-to-everyone-involved) person, and then tracking how those letters actually moved through society to their intended recipients.
The result was a map that showed large groups of closely-connected people, linked by small numbers of people who were linked into many, disparate, closely-linked groups. These people are unusual and their behavior is unusually influential on others, precisely because they serve to transfer information from homogenous groups to other homogenous groups.
It's not that people, or wikipedia articles, are all evenly linked by an average of six links that's important. The idea of 'six degrees of separation' is precisely about the nodes which interlink groups of nodes to each other.

From Bacon to Physics, 3 clicks.

[certron]

While the results are interesting (I won't spoil it by posting the answers, although I'm sure someone else has already cut to the chase and done it), the way they arrived at their results is more interesting. I'm sure this could be extended to some pretty maps of what links where, or deep/shallow topics in different fields. I had tried to find the number of links between Kevin Bacon and Nuclear Physics, but it didn't like my input. Instead, I discovered that it takes 3 clicks to go from Bacon to Physics, passing through Columbia University and BDSM on the way.

Off-topic, but this is as good a place as any: There was a project hosted on some academic server a few years ago that linked song lyrics together. Clicking on the lyric 'creep' in the lyrics of the Radiohead song of the same title would bring up links to the TLC and Stone Temple Pilots songs of the same title, as well as any other song that used that word in their lyrics. Two songs that shared certain words would be linked by at most 2 clicks. I'm sure it has been buried in Google-cruft in the years since someone figured out that lyrics pages could be slurped up and turned into banner ad farms, but I had been thinking about how this could be re-implemented using a Wiki that would turn every word into a link and then link to a 'what links here' page. Does anyone know where this original project is or what happened to it? Any hints on re-implementing the behavior with a wiki?

Re:

[certron]

Incidentally, going from Physics to Bacon is also 3 clicks, passing through 1968 and Lisa Loeb in the process.

I remember when searching for certain terms on the Internet could bring you from one article to another and suddenly you'd gone from Seaquest DSV to magnetic monopoles to a South African shaman who talks with UFO aliens and suggests curing diseases with sonic frequencies. Now you can do all that solely through Wikipedia.

Obligatory XKCD: http://xkcd.com/214/ [xkcd.com]

you can do better than that

[circletimessquare]

the idea is to find redundant connections between sir francis bacon and kevin bacon: socially, in film, genetically, and via wikipedia links

this sort of alternate connection generation is known as a double bacon whopper with cheese

Fun games to play with your friends

[snuf23]

Our personal favorite for Wikipedia is "Six degrees of anal sex". You'd be amazed how few steps it takes to go from Rush Limbaugh to butt piracy.

Here's proof that number 2 is almost evil.

[Escogido]

Shortest path from Microsoft to Evil

Microsoft
ASCII
2 (number)
Evil

3 clicks needed

Too bored to make a good pun out of this so please someone else do.

Re:

[certron]

2 is quite evil. Only 2 clicks needed for both of these:

Sex -> Rape -> Violence
Violence -> Video game -> Sex

Draw your own conclusions...

Re:Here's proof that number 2 is almost evil.

[Jorgandar]

How many clicks to profit?

e.g.

1. Kevin bacon
2. ?
3. profit!

Re:

[Spikeles]

Shortest path from Kevin Bacon to Profit [netsoc.tcd.ie]

1. Kevin Bacon
2. Midwestern United States
3. Profit

2 clicks needed

Re:Here's proof that number 2 is almost evil.

[Spikeles]

Normally i don't post to myself, but these are just too funny:

Shortest path from You to Natalie Portman [netsoc.tcd.ie]

1. You
2. Darth Vader
3. Natalie Portman

2 clicks needed

Shortest path from Natalie Portman to Hot Grits [netsoc.tcd.ie]

1. Natalie Portman
2. Connecticut
3. African American
4. Grits
5. You

2 clicks needed
and finally

Shortest path from Natalie Portman to Bed [netsoc.tcd.ie]

1. Natalie Portman
2. Arabic language
3. Bilabial consonant
4. Bed

Re:

[pajeromanco]

Or:

Shortest path from Apple to Evil

Apple
Evil

1 clicks needed

But what we all want to know is

[4D6963]

I'm pretty sure I'm not the only one who wants to know about the most remote articles, or who even wants to see distribution graphs, am I? The article is a teaser, not completely satisfactory. :-(

OP is similar to the guy who climbed Mt. Everest

[Enleth]

They once asked him, why would he do that (as that was dangerous and quite pointless from any practical point of view because there's nothing on top of Mt. Everest and the guy wasn't even a scientist). His answer? "Because it's there."

The more I think about it, the more I come to the conclusion that it's what defines a true geek - doing things even if they're pointless by themselves, for the sake of doing them and proving that this or that completely crazy idea is actually doable. And, of course, because th

How many degrees can you find?

[Em Adespoton]

I haven't been able to get two words to be more than 4 links apart so far... can anyone come up with words that can beat 4 degrees?

Re:How many degrees can you find?

[stedo]

Unfortunately, yes. The original project was to find the diameter of wikipedia, i.e. the biggest such number of links. That approach was abandoned when I found giant "tails" in wikipedia, almost linear linked lists of articles that stretch out for 70 links. The worst offenders were the subpages of List of named asteroids as each is only linked from the previous one, and it takes about 70 links to get from anywhere to the last one.

Stephen Dolan, aka mu

It All Depends Who Wrote the Article

[STrinity]

[[There]] are [[some]] [[Cmdr Taco|idiots]] who [[bracket]] [[every]] other [[word]].

Anyone fluent in python

[ProfessionalCookie]

This looks like a job for Google App Engine [google.com]!

Wiki Races

[Ninja Master Gara]

A variant game to do with the connected nature of Wikipedia involves a group of people choosing a start page and an end page and seeing who can get there in the least amount of hops. Posting the route allows for interesting analysis of the logic players used to try to get places. The "find shortest path" in the article would kill that tho :P

Billy Jean King

[Dice]

FTA:

If you skip past all of the articles that are just lists, years or days of the year, the "real article" closest to the centre is: United Kingdom at an average of 3.67 clicks to anywhere else. Following it are Billie Jean King and United States (in that order, strangely) with averages of 3.68 and 3.69 clicks respectively.

A quick look at her article [wikipedia.org] - along with keeping in mind the previous results of year-and-date type pages being ranked very highly - it seems that her main advantage is that her article

Re:

[stedo]

Yeah, that kind of thing does bias the results a bit. If you go to the bother of downloading the full results (I think the server may be a bit slashdotted atm, so don't do this immediately), then it turns out that a lot of music group's tours place unusually highly because they have a lot of sentences like "In [[2007]], they toured the [[United Kingdom]]".

Stephen Dolan, aka mu

A similiar site (in Common Lisp)

[neomage86]

I wrote something kind of similar as a proof of concept (in common lisp) a little while back: http://icarus.maneks.net:4242/ [maneks.net]

There's a few technical details at http://icarus.maneks.net:4242/static/readme.txt [maneks.net]

I've been meaning to clean it up and release the source (maybe a screencast intro to Lisp?) for a while now. The main problem with mine is that the DB server and Web server are far apart, so it takes forever to get any data

More Fun with IMDB

[STrinity]

If you want to look something up on IMDB, it can be fun to see if you can use the links on the front page to reach the article you want within seven degrees. I normally count actors but not movies as a degree, but you could try per-click.

The Disneyporn game.

[Kaenneth]

I prefer the Disneyporn game, where you go to Disney.com and see how many left clicks it takes to reach porn.

Closest I found (a few years ago) was from Disney to ABC, to ABC Sports, to HP (server provider), to Yahoo index, to massage providers, then a few ad links.

Only fair to ensure your PC is free of extra popup software first.

What about language?

[kylehase]

The 6 degrees theory claims that everyone in the world is connected. That means you'd have to include every Wikipedia page in other languages as well, not just English.

I tested some random Japanese Wikipages and the test failed. I then tried some very common English pages and those failed as well "Unknown article...". So I think their server might be having the /. effect.

In any case it doesn't look like they included other languages in their setup.

Re:

[stedo]

No, it's just the English Wikipedia. There aren't that many links between the English and Japanese Wikipedias anyway, so it wouldn't make much difference. I might do it again later with other Wikipedias.

Stephen Dolan (aka mu)

shortest path

[joelpt]

Shortest path from disney to fuck

The Walt Disney Company
Motion Picture Association of America film rating system
Fuck

2 clicks needed

Excluding "list" pages

[$random_var]

The paths it generates from Article A to Article B would be more interesting if they excluded list pages... so far, most of the interesting searches I've tried have been short-circuited by some kind of date page.

time-like Bacon distance

[xPsi]

Wikipedia articles actually linking to Kevin Bacon should be made "time-like" and given a negative sign in the metric tensor when calculating article "distances" in this exercise.

No, I don't know why I'm advocating this.

Music Industry Spam

[owlnation]

There's so much promotional material for bands on Wikipedia that this must lower the the number of steps between pages.

Basically every other page at least has some sort of "band X wrote a song about .... ". And then every band page has further spam in the form of "band Y covered the song of Band X on their ABC album".

Is this a good time to remind everyone that the Music Industry is the Original Evil raised to the power of evil -- and yet, something that's supposed to be neutral (and I guess I emphasi

And you can believe it, too!

[foxtrot]

It must've stuck in this guy's craw a little, given that he's at Trinity College in Dublin, Ireland to find out that the Center of the Known Wikiverse is the United Kingdom...

But what about WikiBacon?

[ChePibe]

In an ironic twist, most articles on Wikipedia are also within 6 clicks of Kevin Bacon's article!

Enjoy a nice game of WikiBacon [blogspot.com]!

Link is NOT to my blog

Yay

[Daimanta]

Shortest path from Zeuxis and Parrhasius to Jeruzal
No path found

I beat the Man

Sex and the Slashdot

[guruevi]

Scary:

From Slashdot to Girl, 3 clicks
From Slashdot to Sex, 2 clicks
From Slashdot to Microsoft, 1 click

Interesting, from Slashdot to your basement (4 clicks), you actually go through Apple, Inc.

This should be from the "Old News" department...

[Titoxd]

This article talks about a tool that was first available to Wikipedians in 2004 [wikipedia.org]. Heck, there's an entire page to try to find long chains at Wikipedia:Six degrees of Wikipedia [wikipedia.org], and it even mentions a chain of seven articles...

No surprise here

[ConfusedVorlon]

Good to see confirmation of what we Brits already knew.

The UK is the centre of the known universe.

Re:

[jacquesm]

not for me either, I'm in the diamond business...

Re:

[xaxa]

1) Click Random Page
2) Click it again (open it in a new tab)
3) Try to get from page A to page B in as clicks as possible.

Other person repeats, whoever has the smaller number wins!

I never said it was a good game.

Re:Excellent...

[Sancho]

As someone else pointed out, the largest number is 3.

Edit page -> Insert link to old page and hit Save -> View this page.

That's a feeble challenge

[The Master Control P]

The standard proposition on /b/ is to get to Hitler in 4 links, 3 for extra win.

http://en.wikipedia.org/wiki/1977_Southeast_Asian_Games [wikipedia.org]
http://en.wikipedia.org/wiki/Indonesia [wikipedia.org]
http://en.wikipedia.org/wiki/World_War_II [wikipedia.org]
HITLER [wikipedia.org]!

Re:

[paintswithcolour]

We should turn it into a tourist slogan.

If 'All roads lead to Rome', then 'All Wikipedia Articles lead to the United Kingdom' should do it. And pretty catchy too...

Re:

[lattyware]

I can get 5 from CD wallet to Eric Nylund, best so far.