title: Two robots in an infinite line
body: <p>This is a little bit different from the "Parachuted Robots" puzzle. There are two robots hanging on an infinite line. Their distance is not relative, therefore it doesn't matter if they are 5m or 5km apart. Suppose that you need to program the two robots in order to meet at the magnet and the only options you have are:</p>
  
  <ul>
  <li>One move to the left</li>
  <li>One move to the right</li>
  <li>Two moves to the left</li>
  <li>Two moves to the right</li>
  <li>Stop and check if the robot is on the magnet</li>
  </ul>
  
  <p>The robots will not know if there are already next to the magnet, and moving one robot will also move the other robot on the same direction. Formulate an algorithm for the two robots to meet at the magnet.</p>
  
  <p>I am unable to formulate a solution to this question, is there a solution to the puzzle?</p>