| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-10-30 | Solve puzzle 11 2022. | Aryadev Chavali | |
| 2024-10-30 | Introduce tests for split-by-first and split-by-completely | Aryadev Chavali | |
| Allows one to split by string delimiter, or anything else. | |||
| 2024-10-30 | Fixup some stuff | Aryadev Chavali | |
| 2024-10-30 | FINALLY figured out puzzle 10 2022 | Aryadev Chavali | |
| Part 2 was a real struggle to get right, though part 1 was way easier. | |||
| 2024-10-30 | Update lib.lisp to be more imperative and include a threading macro | Aryadev Chavali | |
| Instead of (f (g (h (j (k x))))) we can write (-> (k x) (j it) (h it) (g it) (f it)) which is works really well for particularly large and complicated expressions. | |||
| 2024-10-29 | Use every instead of all | Aryadev Chavali | |
| 2023-10-21 | Finished round 2 of puzzle 9 | Aryadev Chavali | |
| Annoying bug that took ages to fix: for multi-execute, there may be times where movements go in complete diagonals. In this case, we need to move in the unit vector diagonal direction. So I modified update-tail for this case. Never happens in round 1 lol. | |||
| 2023-10-18 | Finished round 1 of puzzle 9 | Aryadev Chavali | |
| Pretty interesting, functional idioms kinda fail here as there are no nice functions I can think of for the single-knot-execute-line `dotimes` section. I could use tail recursion with an optimisation but this is pretty explicit. You can compare execute-lines to execute-line to see which type of iteration fits you. | |||
| 2023-10-17 | Finished round 2 of puzzle-8 | Aryadev Chavali | |
| 2023-10-17 | Finished round 1 of puzzle-8 | Aryadev Chavali | |
| 2023-10-17 | Added all and remove-nth | Aryadev Chavali | |
| Does what they say, all is the logical inverse to some. | |||
| 2023-10-17 | Started puzzle-8 | Aryadev Chavali | |
| 2023-10-17 | split-by->split-by-first, split-completely->split-by-completely | Aryadev Chavali | |
| 2023-10-17 | FINALLY figured out the solution to puzzle 7 | Aryadev Chavali | |
| Easy problem once I figured out the trick to constructing an inherently stateful structure with backwards pointer references (at least the first way I would've made it) into a functional alist solution. Very cool. | |||
| 2023-10-17 | Made a rough sketch comment of puzzle-7 structure | Aryadev Chavali | |
| 2023-10-17 | Current implementation of puzzle-7 | Aryadev Chavali | |
| Not complete, dunno what to do for parsing and handling CD commands. | |||
| 2023-10-17 | Better comment on puzzle-6.lisp | Aryadev Chavali | |
| 2023-10-17 | Update 2022/README with puzzle solution descriptions | Aryadev Chavali | |
| 2023-10-17 | Use lib.lisp in puzzle-6 | Aryadev Chavali | |
| 2023-10-17 | Remove python version of puzzle 1 | Aryadev Chavali | |
| Lisp version is satisfactory. | |||
| 2023-10-17 | Made a python version of puzzle 1 | Aryadev Chavali | |
| I'm going to use a different language per puzzle now. | |||
| 2023-10-17 | Version control lib.lisp | Aryadev Chavali | |
| 2023-10-17 | (*)~changed to relative file naming | Aryadev Chavali | |
| 2023-10-17 | (2022>6)+solution for problem 6 | Aryadev Chavali | |
| 2023-10-17 | (2022>README,1,5)+literate code for problem 1 rewrite,~minor changes to 5 | Aryadev Chavali | |
| Making README.org a literate document for my code to better describe my process. | |||
| 2023-07-09 | ~test | Aryadev Chavali | |
| 2023-06-26 | (2022>puzzle-5)+solution for puzzle-5 | Aryadev Chavali | |
| Wow, quite involved and definitely cleanable but goddamn so much fun. | |||
| 2023-06-26 | (*->2022)~made it clear what advent of code I'm doing | Aryadev Chavali | |
 |
index : advent-of-code | |
| Repository for advent of code solutions. May be updated, may not be. | Aryadev Chavali <aryadev@aryadevchavali.com> |
| aboutsummaryrefslogtreecommitdiff |