1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
--- Day 13: Mine Cart Madness ---
A crop of this size requires significant logistics to transport produce, soil, fertilizer, and so
on. The Elves are very busy pushing things around in [1m[97mcarts[0m on some kind of rudimentary system of
tracks they've come up with.
Seeing as how cart-and-track systems don't appear in recorded history for another 1000 years, the
Elves seem to be making this up as they go along. They haven't even figured out how to avoid
collisions yet.
You map out the tracks (your puzzle input) and see where you can help.
Tracks consist of straight paths (| and -), curves (/ and \), and intersections (+). Curves connect
exactly two perpendicular pieces of track; for example, this is a closed loop:
/----\
| |
| |
\----/
Intersections occur when two perpendicular paths cross. At an intersection, a cart is capable of
turning left, turning right, or continuing straight. Here are two loops connected by two
intersections:
/-----\
| |
| /--+--\
| | | |
\--+--/ |
| |
\-----/
Several [1m[97mcarts[0m are also on the tracks. Carts always face either up (^), down (v), left (<), or right
(>). (On your initial map, the track under each cart is a straight path matching the direction the
cart is facing.)
Each time a cart has the option to turn (by arriving at any intersection), it turns
[1m[97mleft[0m the first time, goes [1m[97mstraight[0m the second time, turns [1m[97mright[0m the third time, and then repeats
those directions starting again with [1m[97mleft[0m the fourth time, [1m[97mstraight[0m the fifth time, and so on. This
process is independent of the particular intersection at which the cart has arrived - that is, the
cart has no per-intersection memory.
Carts all move at the same speed; they take turns moving a single step at a time. They do this based
on their [1m[97mcurrent location[0m: carts on the top row move first (acting from left to right), then carts
on the second row move (again from left to right), then carts on the third row, and so on. Once
each cart has moved one step, the process repeats; each of these loops is called a
[1m[97mtick[0m.
For example, suppose there are two carts on a straight track:
| | | | |
v | | | |
| v v | |
| | | v X
| | ^ ^ |
^ ^ | | |
| | | | |
First, the top cart moves. It is facing down (v), so it moves down one square. Second, the bottom
cart moves. It is facing up (^), so it moves up one square. Because all carts have moved, the first
tick ends. Then, the process repeats, starting with the first cart. The first cart moves down,
then the second cart moves up - right into the first cart, colliding with it! (The location of the
crash is marked with an X.) This ends the second and last tick.
Here is a longer example:
/->-\
| | /----\
| /-+--+-\ |
| | | | v |
\-+-/ \-+--/
\------/
/-->\
| | /----\
| /-+--+-\ |
| | | | | |
\-+-/ \->--/
\------/
/---v
| | /----\
| /-+--+-\ |
| | | | | |
\-+-/ \-+>-/
\------/
/---\
| v /----\
| /-+--+-\ |
| | | | | |
\-+-/ \-+->/
\------/
/---\
| | /----\
| /->--+-\ |
| | | | | |
\-+-/ \-+--^
\------/
/---\
| | /----\
| /-+>-+-\ |
| | | | | ^
\-+-/ \-+--/
\------/
/---\
| | /----\
| /-+->+-\ ^
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /----<
| /-+-->-\ |
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /---<\
| /-+--+>\ |
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /--<-\
| /-+--+-v |
| | | | | |
\-+-/ \-+--/
\------/
/---\
| | /-<--\
| /-+--+-\ |
| | | | v |
\-+-/ \-+--/
\------/
/---\
| | /<---\
| /-+--+-\ |
| | | | | |
\-+-/ \-<--/
\------/
/---\
| | v----\
| /-+--+-\ |
| | | | | |
\-+-/ \<+--/
\------/
/---\
| | /----\
| /-+--v-\ |
| | | | | |
\-+-/ ^-+--/
\------/
/---\
| | /----\
| /-+--+-\ |
| | | X | |
\-+-/ \-+--/
\------/
After following their respective paths for a while, the carts eventually crash. To help prevent
crashes, you'd like to know [1m[97mthe location of the first crash[0m. Locations are given in X,Y coordinates,
where the furthest left column is X=0 and the furthest top row is Y=0:
111
0123456789012
0/---\
1| | /----\
2| /-+--+-\ |
3| | | X | |
4\-+-/ \-+--/
5 \------/
In this example, the location of the first crash is [1m[97m7,3[0m.
|
