Welcome to the Speedsolving.com, home of the web's largest puzzle community! You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

Oh and on my page, I only show the first shortest path I find, not all of them. I might change that to showing the first few, or add showing the number of different paths.

Oh, and this is really cool. Thanks for putting this together, Stefan. One other question: I see that, for instance, 2009LINJ04 is separated from 65 people by 6 degrees. Who are some of these people? It's pretty clear nobody can be further than that, as Lars is separated from everyone by only 3.

By the way, I'm just curious - who on here has an Erdős number? Knowing the math tendencies of cubers, I can't help believing there are a few. Jessica Fridrich has an Erdős number of 3.

You could make a poster for the graph where the vertices are competitions and they're connected via competitors, that one would be much smaller. Show only its minimum spanning tree (counting the sum of all paths from the root, I mean, don't know the name for this) and it might look quite nice. For bonus style points, use every competitor at most once.

Bruchem
number People
0 1 (this is Ron himself)
1 1365 (I'm one of these, woohoo!)
2 6876
3 846
none 19 (the competitors of Dubai Open 2009)
Average Bruchem number: 1.94267165492958