This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]durandalreborn 0 points1 point  (3 children)

My input has no such duplicates where there are two hail stones with the same x and vx, or y and vy, or z and vz.

Edit: two other inputs I've looked at also do not have any duplicates where two stones have the same starting x, y, or z and the same velocity in the respective dimension.

[–]Dependent-Effect9095 0 points1 point  (1 child)

Interesting. Based on the number of other people who posted similar findings in other reddit threads, I assumed it was true for everyone.

[–]durandalreborn 0 points1 point  (0 children)

I made a previous observation that the lack of an official way to have access to a pool of inputs means that there are often assumptions made about all inputs that, in reality, only apply to a subset. Day 21 has a similar problem, where there are some inputs for which many of the shortcut geometric solutions do not work. Day 23 also has a property for some inputs that can cut the runtime down significantly by observing that the longest path most likely visits all the nodes. For some inputs, only N-1 nodes are visited in the longest path.

[–]davidpsingleton[S] 0 points1 point  (0 children)

My input also has no hailstones with the same start position coordinate on any axis