Okay, here’s something new for us to try. You have 2 identical robots, and each must be given an identical set of commands. These robots will then be dropped out of a plane and parachute down to random locations on a straight line that extends infinitely in opposite directions (As in, it doesn’t wrap around and meet up with itself or anything, so it’s not like the equator or anything). When the robots land, the parachutes detach, and remain where they landed. Neither robot knows where the other robot is being dropped, so they wouldn’t know which direction it was in or anything. Your job is to program these robots to collide with each other.
The robots only have room for 10 commands, and you can choose from the following:
Move Left one unit.
Move Right one unit.
Skip the next command, unless there’s a parachute on this space.
Go to a specific command number.
So here’s an example of a program:
10 Go Right.
20 Go Left.
30 SKIP the next command unless there’s a parachute.
40 GOTO 10.
Make sense? Okay, your goal is to make them collide, and you only get 10 commands spaces. [Meaning, your program only consists of 10 lines of “code”. Not to be confused with “10 moves”, which would be something different.”] Each command takes one cycle to execute (including GOTO’s and SKIPs), and each movement moves 1 standard unit (we can call it a foot if that helps, but it doesn’t really matter) An extra 5 points for the first answer that guarentees a collision. A bonus 5 points for the most efficient/quickest answer. (The answer that would get them to collide the fastest in most situations). Ties split the bonus points.