Hackety Hacking Problem Making robots meet: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

6 April 2008

22 January 2008

  • curprev 21:1821:18, 22 January 2008Anubhavit talk contribs 3,867 bytes +3,867 New page: == Problem Statement == Two Robots, who cannot communicate with each other, are present on an infinite long railway track. Can you suggest a way of how they can meet each other? (Provided...