This Demonstration is an extension of a previous Demonstration by Michael Waters. It extends the four-bug problem in several ways.

Consider bugs placed regularly around the circumference of a circle. With each step, each bug takes one step closer to a counterclockwise neighbor, and a line is draw between the two.

You can vary the number of bugs, the step length and the number of steps. Also, the bugs are locators that you can drag. If you move the locators, do not change their sequential order.

The neighbor may be one or more positions away, but the gap between neighbors must be relatively prime to the number of bugs so that the sequence forms a complete cycle. Otherwise, the display will almost always revert to a gap of one. Something interesting might still happen if the values are odd.

By symmetry, it is only necessary to have the 'bug chase gap" go halfway around the circle of bugs. For example, for the 10-bug case there are only options for gaps of 1 and 3. You can also vary the speed of each bug.

When it appears that the bugs converge, the point of convergence is approximated. If the paths do not converge, then the limit point will be listed as "unavailable". The limit point is also unavailable early in the journey.

Set "bug chase gap" to 1 for bugs to chase their immediate neighbor as in the classic chase problem. A value of 2 indicates the bugs skip the nearest neighbor and follow the second-closest neighbor.

The speed of a bug is the multiple of the unit step length that it takes. Thus, a value of 2 indicates that the bug is traveling twice as fast or its step is twice as long as the global step size.