The Wikipedia game

This is a discussion on The Wikipedia game within the A Brief History of Cprogramming.com forums, part of the Community Boards category; I don't see why the graph has to be unknown. You can download wikipedia and have all of the nodes ...

  1. #16
    Crazy Fool Perspective's Avatar
    Join Date
    Jan 2003
    Location
    Canada
    Posts
    2,640
    I don't see why the graph has to be unknown. You can download wikipedia and have all of the nodes and edges. The current image is an 18GB xml file, nothing intractable.

  2. #17
    Hail to the king, baby. Akkernight's Avatar
    Join Date
    Oct 2008
    Location
    Faroe Islands
    Posts
    717
    infact... I don't get this o.o
    Finding Hitler everywhere is only a little suprising, but Matt Damon o.O Why does he have anything to do with anything?
    Currently research OpenGL

  3. #18
    Malum in se abachler's Avatar
    Join Date
    Apr 2007
    Posts
    3,189
    Make two lists. Put every article in list 1. Now move 'Hitler to list 2 and mark its distance as 0.
    Run wikipedias 'what links here on every article in list 2. Mark each result that is in list 1 with a 1 adn move it to list 2. Run WLH on every article in list 2 with a distance of 1. mark all results in list 1 with a 2 and move it to list 2, repeat until there are no more articles in list 1.

    Worse case scenario is O^2/2 assuming only 1 article is moved each time or O^(1+1/N)/2 for an average of N links per page.
    Last edited by abachler; 03-24-2009 at 10:02 PM.
    Until you can build a working general purpose reprogrammable computer out of basic components from radio shack, you are not fit to call yourself a programmer in my presence. This is cwhizard, signing off.

  4. #19
    Registered User whiteflags's Avatar
    Join Date
    Apr 2006
    Location
    United States
    Posts
    7,738
    Six degrees of separation...

    but the answer is, obviously, any and all orphaned pages. I win.

  5. #20
    Banned ಠ_ಠ's Avatar
    Join Date
    Mar 2009
    Posts
    687
    Quote Originally Posted by whiteflags View Post
    Six degrees of separation...

    but the answer is, obviously, any and all orphaned pages. I win.
    Orphaned pages are ones that aren't linked to, they can still link to Hitler (I have encountered 3 that did)
    ╔╗╔══╦╗
    ║║║╔╗║║
    ║╚╣╚╝║╚╗
    ╚═╩══╩═╝

  6. #21
    Crazy Fool Perspective's Avatar
    Join Date
    Jan 2003
    Location
    Canada
    Posts
    2,640
    Quote Originally Posted by Akkernight View Post
    infact... I don't get this o.o
    Finding Hitler everywhere is only a little suprising, but Matt Damon o.O Why does he have anything to do with anything?
    It was originally Kevin Bacon. Now in 2009 I wouldn't be surprised if Matt Damon is the centre of the co-star graph.

    The Oracle of Bacon

  7. #22
    Malum in se abachler's Avatar
    Join Date
    Apr 2007
    Posts
    3,189
    mmmm, bacon, now im hungry

    Kevin Bacon's success is obviously based on his name, it just soudns yummy, oh wait that sounded kind of gay...
    Until you can build a working general purpose reprogrammable computer out of basic components from radio shack, you are not fit to call yourself a programmer in my presence. This is cwhizard, signing off.

  8. #23
    Registered User
    Join Date
    Sep 2008
    Location
    Toronto, Canada
    Posts
    1,832
    Yes, this is related to Six Degrees of Kevin Bacon

    That is, finding the minimum number of movie hops required to find where one given actor is related to another. There was a search engine to do just that... usually between any two people there was some maximum number... and it was surprisingly small, like 6 or so. As I recall, that search engine was phenomenally fast. I don't recall whether their algorithm was ever published.

    There was also a contest to find two actors who were maximally distanced. Perhaps that number was 11 or so. I forget exactly.

    But back to Wikipedia... a more interesting question might be - what is the minimum number of clicks (links) to get from a Wiki entry to your name? Obviously if there is a Wiki page that's specifically about you it is disqualified. In other words, I guess it boils down to: did you ever contribute something authoritative on the internet.
    Last edited by nonoob; 04-08-2009 at 10:06 PM.

  9. #24
    Banned ಠ_ಠ's Avatar
    Join Date
    Mar 2009
    Posts
    687
    Quote Originally Posted by nonoob View Post
    did you ever contribute something authoritative on the internet.
    nope
    ╔╗╔══╦╗
    ║║║╔╗║║
    ║╚╣╚╝║╚╗
    ╚═╩══╩═╝

Page 2 of 2 FirstFirst 12
Popular pages Recent additions subscribe to a feed

Similar Threads

  1. how do the game engine and the api interact?
    By Shadow12345 in forum Game Programming
    Replies: 9
    Last Post: 12-07-2010, 11:08 PM
  2. Open Source / Semi Open source game idea. Help needed
    By CaptainPatent in forum Projects and Job Recruitment
    Replies: 10
    Last Post: 05-16-2007, 10:44 AM
  3. game engine advice?
    By stien in forum Game Programming
    Replies: 0
    Last Post: 01-23-2007, 02:46 PM
  4. What the jip is up with wiki?
    By Clyde in forum A Brief History of Cprogramming.com
    Replies: 13
    Last Post: 12-22-2005, 06:58 PM
  5. My Maze Game --- A Few Questions
    By TechWins in forum Game Programming
    Replies: 18
    Last Post: 04-24-2002, 11:00 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21