aboutsummaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2024-11-01Switched racket with rust (didn't want to use rust with external packages)Aryadev Chavali
2024-11-01Finish puzzle 3 of 2015 in ocamlAryadev Chavali
2024-11-01Add compile commands to make running these solutions easierAryadev Chavali
2024-11-01Puzzle 2 2015 doneAryadev Chavali
2024-11-01Finished problem 1Aryadev Chavali
2024-10-31Added README for 2015 and edited root READMEAryadev Chavali
2024-10-31Ignore all input filesAryadev Chavali
2024-10-30Solve puzzle 11 2022.Aryadev Chavali
2024-10-30Introduce tests for split-by-first and split-by-completelyAryadev Chavali
Allows one to split by string delimiter, or anything else.
2024-10-30Fixup some stuffAryadev Chavali
2024-10-30FINALLY figured out puzzle 10 2022Aryadev Chavali
Part 2 was a real struggle to get right, though part 1 was way easier.
2024-10-30Update lib.lisp to be more imperative and include a threading macroAryadev 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-29Use every instead of allAryadev Chavali
2023-10-21Added 2019 puzzles, in pythonAryadev Chavali
Finished first two rounds of puzzle 1
2023-10-21Finished round 2 of puzzle 9Aryadev 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-18Finished round 1 of puzzle 9Aryadev 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-17Finished round 2 of puzzle-8Aryadev Chavali
2023-10-17Finished round 1 of puzzle-8Aryadev Chavali
2023-10-17Added all and remove-nthAryadev Chavali
Does what they say, all is the logical inverse to some.
2023-10-17Started puzzle-8Aryadev Chavali
2023-10-17split-by->split-by-first, split-completely->split-by-completelyAryadev Chavali
2023-10-17FINALLY figured out the solution to puzzle 7Aryadev 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-17Made a rough sketch comment of puzzle-7 structureAryadev Chavali
2023-10-17Current implementation of puzzle-7Aryadev Chavali
Not complete, dunno what to do for parsing and handling CD commands.
2023-10-17Some root directory repository stuffAryadev Chavali
2023-10-17Better comment on puzzle-6.lispAryadev Chavali
2023-10-17Update 2022/README with puzzle solution descriptionsAryadev Chavali
2023-10-17Use lib.lisp in puzzle-6Aryadev Chavali
2023-10-17Remove python version of puzzle 1Aryadev Chavali
Lisp version is satisfactory.
2023-10-17Made a python version of puzzle 1Aryadev Chavali
I'm going to use a different language per puzzle now.
2023-10-17Version control lib.lispAryadev Chavali
2023-10-17(*)~changed to relative file namingAryadev Chavali
2023-10-17(2022>6)+solution for problem 6Aryadev Chavali
2023-10-17(2022>README,1,5)+literate code for problem 1 rewrite,~minor changes to 5Aryadev Chavali
Making README.org a literate document for my code to better describe my process.
2023-07-09~testAryadev Chavali
2023-06-26(2022>puzzle-5)+solution for puzzle-5Aryadev 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 doingAryadev Chavali
2023-06-26(3|4)+lisp files for puzzles 3 and 4Aryadev Chavali
2023-06-26(1|2)+lisp files for puzzles 1 and 2Aryadev Chavali
Includes code for both rounds, separated by comments.
generated by cgit v1.2.3-13-gbd6f (git 2.30.0) at 2024-12-25 13:16:08 +0000