All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General > Word Problems
Wiki Ladders (Posted on 2012-10-11) Difficulty: 2 of 5

For current purposes, the 'permitted text' of a wikipedia entry comprises everything that is in the text of the main entry, but excludes 'See also', external links, and any inset boxes that link to higher-level concepts (e.g references to higher order categories, portals, scientific classifications, ruling dynasties, etc.) In short, 'text' means text.

The object of Wiki Ladders (by analogy with Word Ladders) is to navigate from one subject to another by choosing hyperlinks within the permitted text to find the shortest link between two articles bearing the exact required names. Modifying the permitted text to add 'helpful' links is forbidden!

For example, If the given words were 'Matthew Boulton' and 'Penny (British pre-decimal coin)', just one link is needed: Matthew Boulton>penny>'Penny (British pre-decimal coin)', but if the words were 'Matthew Boulton' and 'Penny (United States coin)' then three links are needed: Matthew Boulton>penny>US half dollar>cent>Penny (United States coin).

The two subjects for today are: Perplexus and B-roll.

Navigate from the the first to the second using the fewest links. The target to beat is 7 links.

Given that the permitted text may evolve naturally with the passage of time, the validity of a proposed solution shall be determined in accordance with the date of its posting on Perplexus and the 'Revision History' of the relevant article.

In the event of a tie-break, links that pass through a page that also mentions the 'United States' will be penalised by half a link per mention.

No Solution Yet Submitted by broll    
Rating: 4.0000 (3 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: Another 6-link non-winning solutionbroll2012-10-13 04:41:56
Another 6-link non-winning solutionDej Mar2012-10-12 15:44:04
re: Another solutionbroll2012-10-12 08:29:03
SolutionAnother solutionDej Mar2012-10-11 15:54:29
re: Two solutionsbroll2012-10-11 15:52:32
re: Two solutionsbroll2012-10-11 15:46:34
SolutionTwo solutionsMath Man2012-10-11 14:54:00
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information