Let’s “sri ganesh” (start) off this blog with a simple puzzle.
“2 paratroopers are dropped from a plane. The troopers land on line known to both of them, but they can land anywhere on that line. The troopers have 4 moves: move right, move left, pick up parachute, and put down parachute. Propose an algorithm to guarantee the 2 troopers will meet one another.”
What would be its solution? Scroll below for solution.
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
…
And the answer is :
When the troopers land, have both drop their parachutes. Have both move right at a rate X. When a trooper finds a parachute, increase their movement rate and they will “run down” the other trooper.
Do you have any other algorithm ?
1 Comment
March 20, 2008 at 1:10 pm
hadd sahi a.raj
keep ‘em coming..