A logic puzzle. Solve the map by drawing bumper car paths inside the grid.
@TODO: Add sketch from notebook.
Map
Grid, top-down view of bumper cars.
Objective
Move all bumper cars ( = draw a path from them) that only makes them collide (for the first time) at the end of the path.
Or, alternatively, some cars say “don’t collide” and others say “collide”
Patterns / Rules
- Every bumper car has X Energy = steps to take. Perhaps split in dtail (X->Y->Z->A). Perhaps the general rule is “Move X, then move X-1, then move X-2, until done”. Perhaps you must turn in-between those steps.
- (Collision means the path reflects. The bumper car continues its movement, but backward/reversed.)
- They can also rotate in specific spots?
- They can move forward OR backward at any time??