Documentation

The scanners are represented by a pair of the number of time units it will take a packet to reach that scanner and the number of cells the scanner traverses.

Compute the solutions to day 13. Input can be ovverridden via command-line arguments.

Returns true when the scanner will be at position 0 at the given time-step.

>>> collides 6 4
True
>>> collides 5 4
False

Sum of the product of index and size of scanners that detect the packet.

>>> part1 [(0,3),(1,2),(4,4),(6,4)]
24

Finds the smallest offset at which time a packet could traverse the scanners without collision.

>>> part2 [(0,3),(1,2),(4,4),(6,4)]
Just 10

Check that a packet delayed by a certain amount of time will successfully clear the scanners.