Watch two trains with identical programs meet on an infinite railway line, using only local information and an expanding search pattern.
Both trains execute the same algorithm: they explore increasingly farther from their parachute in both directions. In each round, they double their search distance. This exponential growth guarantees they will eventually collide, no matter the initial distance.