I'm trying to find a way to approach a problem:
No two objects can occupy the same slot.
Objects can travel 1, 2, or 3 slots per period.
There are 18 slots.
That is really a very trivial case of a more complex problem. My question is does this sound like similar to any existing problems...