On beating Google pagerank

 Use the following algorithm for a spider:

• Set a 0-point page url that contains at least 1 valid link to a different page.
• Set location of url of this 0-point page to x=0
• Create a grid with nodes, set a random position of y=link#
• link# starts from top to bottom, # being n
• So the first link is y=1, the second link y=2
• Follow the link y=1, its first link is z=1
• Let the search algorithm run
• Let it compile results after given time
• Rank as follows:
• rank = highest(n < y)
• with y being x++

This is also how to auto-map in 3d.