|
|
e6d4a79975
|
try constrain directions
|
2024-01-27 23:57:41 +01:00 |
|
|
|
2e6ace81b7
|
calculate shortest path
|
2024-01-27 23:57:15 +01:00 |
|
|
|
14c6eec96f
|
a* neighbor calculations
|
2024-01-27 23:55:08 +01:00 |
|
|
|
4b61a2ed24
|
prepare scanning neighbors
|
2024-01-27 23:53:01 +01:00 |
|
|
|
32ee792157
|
find best choice in open set
|
2024-01-27 23:52:14 +01:00 |
|
|
|
5fa907c64e
|
prepare a* algorithm
|
2024-01-27 23:49:41 +01:00 |
|
|
|
00e53cdbd7
|
parse tiles into grid
|
2024-01-27 22:17:21 +01:00 |
|
|
|
c1453d6634
|
init d17p1
|
2024-01-27 22:17:08 +01:00 |
|
|
|
35a96647a5
|
init d16p1
|
2024-01-10 20:22:12 +01:00 |
|
|
|
cbd3a2929b
|
clean up: formatting
|
2024-01-10 20:02:15 +01:00 |
|
|
|
138b4e2944
|
init d15p2
|
2023-12-15 20:38:40 +01:00 |
|
|
|
d6d3a06b85
|
calc hashes, sum up
|
2023-12-15 20:38:30 +01:00 |
|
|
|
774fd15ec4
|
init d15p1
|
2023-12-15 20:28:29 +01:00 |
|
|
|
4e98de4101
|
init d14p1
|
2023-12-15 20:28:24 +01:00 |
|
|
|
28f6cec172
|
init d13p1
|
2023-12-15 20:28:16 +01:00 |
|
|
|
23866c5385
|
init d12p1
|
2023-12-15 19:55:47 +01:00 |
|
|
|
403830daee
|
store positions, expand by incrementing
|
2023-12-15 19:52:59 +01:00 |
|
|
|
3f0d2874f8
|
init d11p2
|
2023-12-15 19:23:08 +01:00 |
|
|
|
9ed473e718
|
correct manhattan distance
|
2023-12-15 19:23:01 +01:00 |
|
|
|
de288ab19c
|
calculate and sum all distances
|
2023-12-12 11:06:38 +01:00 |
|
|
|
d1c56a4317
|
filter all galaxies and positions
|
2023-12-12 10:14:25 +01:00 |
|
|
|
8b72c18d65
|
flip, duplicate columns, flip again
|
2023-12-12 10:13:38 +01:00 |
|
|
|
49cbce92e9
|
douplicate rows
|
2023-12-12 10:13:08 +01:00 |
|
|
|
a8c4e3f737
|
init d11p1
|
2023-12-12 10:12:20 +01:00 |
|
|
|
6ad8f7fb31
|
scan each line; uneven wall intersections are inside
|
2023-12-12 08:45:56 +01:00 |
|
|
|
35f32b2a15
|
d10 bugfix
|
2023-12-11 10:57:30 +01:00 |
|
|
|
de2b777f37
|
split all types of linebreak
|
2023-12-11 10:56:20 +01:00 |
|
|
|
7ded3bc3e6
|
ignore all sampledata
|
2023-12-11 09:57:36 +01:00 |
|
|
|
2b80c9168a
|
basic README to explain repo
|
2023-12-10 16:59:11 +01:00 |
|
|
|
c9f13a28d5
|
ignore node_modules
|
2023-12-10 16:58:58 +01:00 |
|
|
|
b88f6ac6f9
|
ignore sample code
|
2023-12-10 16:31:27 +01:00 |
|
|
|
df1484f53f
|
better naming convention
|
2023-12-10 16:31:13 +01:00 |
|
|
|
5a03f2fff3
|
mark loop traces with '+'
|
2023-12-10 16:20:06 +01:00 |
|
|
|
eb0abaec30
|
d10 optimizations
|
2023-12-10 16:19:30 +01:00 |
|
|
|
ec608aae63
|
init d10p2
|
2023-12-10 16:03:18 +01:00 |
|
|
|
e1631e5415
|
save result in variable
|
2023-12-10 16:02:45 +01:00 |
|
|
|
a5b9f37f36
|
flood through maze with dijkstra's
|
2023-12-10 15:58:54 +01:00 |
|
|
|
91ee519a61
|
init d10p1
|
2023-12-10 15:02:05 +01:00 |
|
|
|
bc9d1b45f4
|
reverse direction compared to part1
|
2023-12-09 22:43:48 +01:00 |
|
|
|
2d980c7717
|
mutable instead of array of size 1
|
2023-12-09 22:42:38 +01:00 |
|
|
|
5cf420dc26
|
init d9p2
|
2023-12-09 22:31:48 +01:00 |
|
|
|
72392d46be
|
extrapolate to prediction, then sum them
|
2023-12-09 22:22:32 +01:00 |
|
|
|
dd6eb3ae3d
|
split history into difference sequences
|
2023-12-09 22:19:40 +01:00 |
|
|
|
633bfcdee5
|
calculate least common multiple of all cycle sizes
|
2023-12-09 21:03:38 +01:00 |
|
|
|
f7accd2a13
|
calculate cycle sizes for each starting position
|
2023-12-09 21:03:17 +01:00 |
|
|
|
f59e1530a5
|
use regular set 0 for aesthetics
|
2023-12-09 19:59:06 +01:00 |
|
|
|
a0b9c210e6
|
init d8p2
|
2023-12-09 19:57:55 +01:00 |
|
|
|
7233c861cb
|
solved d8p1
|
2023-12-09 19:57:23 +01:00 |
|
|
|
8775123025
|
init d9p1
|
2023-12-09 19:00:19 +01:00 |
|
|
|
f607fab0be
|
init d8p1
|
2023-12-09 19:00:13 +01:00 |
|
