==2021 Advent of Code==
Written in Python 3.9
| Task | Solution | Comments |
|---|---|---|
| Day 01 | 01-sonar-sweep/solve_a.py 01/solve_b.py | Comparison of neighbouring list elements |
| Day 02 | 02-dive/solve.py | if elif else |
| Day 03 | 03-binary-diagnostic/solve.py | most common bits |
| Day 04 | 04-giant-squid/solve.py | Bingo simulation |
| Day 05 | 05-hydrothermal-venture/solve.py | Spatial reasoning: find line intersections |
| Day 06 | 06-lanternfish/solve.py | simulate 1.7 TB of lanternfish without using 1.7 TB of memory |
| Day 07 | 07-the-treachery-of-whales/solve.py | Minimise fuel costs |
| Day 08 | 08-seven-segment-search/solve.py | unscramble wiring on seven segmented displays |
| Day 09 | 09-smoke-basin/solve.py | uploading later |
| Day 10 | 10-syntax-scoring/solve.py | stack based syntax checker |
| Day 11 | 11-dumbo-octopus/solve.py | Stack based breadth first search mapping chain reactions between neighbouring octopuses |
| Day 12 | 12-passage-pathing/solve.py | Stack based breadth first search to find all paths through a graph |
| Day 13 | 13-transparent-origami/solve.py | Fold a 2D transparency until the dots overlap to reveal letters |
| Day 14 | 14-extended-polymerisation/solve.py | create 19 TB of polymer without using 19 TB of memory |
| Day 15 | 15-chiton/solve.py | Find best path with Dijkstra |
| Day 16 | 16-packet-decoder/solve.py Part 1, 16-packet-decoder/solve_2.py Part 2 | Parse nested hexadecimal packets |
| Day 17 | 17-tricky-shot/solve.py | Find all initial x,y velocities that hit a target |
| Day 18 | 18-snailfish/solve.py | Solved the hard way: with string manipulation |
| Day 19 | ||
| Day 20 | ||
| Day 21 | 21-dirac-dice/solve1.py | Simulate a dice game |
| Day 22 | 22-reactor-reboot/solve.py | Turn bits in a large 3D array on and off |
| Day 23 | Solved by hand | |
| Day 24 | ||
| Day 25 | 25-sea-cucumber/solve.py | Move sea cucumbers east and south until they traffic jam |