aboutsummaryrefslogtreecommitdiffstats
path: root/AoC2022
Commit message (Collapse)AuthorAgeFilesLines
* more julia and formattedOscar Najera2023-01-287-12/+77
|
* more juliaOscar Najera2023-01-261-0/+15
|
* Learning some juliaOscar Najera2023-01-265-27/+108
|
* drop some repetitionOscar Najera2023-01-241-12/+9
|
* Complete Advent of code day 25 lispOscar Najera2023-01-243-0/+172
|
* Clean up, heretic use of mutationOscar Najera2023-01-241-57/+68
|
* Day 24Oscar Najera2023-01-243-0/+161
|
* Day 23Oscar Najera2023-01-233-0/+171
|
* Clean up a bitOscar Najera2023-01-231-80/+48
|
* Solved day 22 part 2Oscar Najera2023-01-161-35/+96
| | | | This looks horrible and solution path is hard coded
* some simplificationOscar Najera2023-01-161-6/+6
|
* cross between faces as composed transformationOscar Najera2023-01-161-34/+54
| | | | | This is instead of determining manually the transformations can be deduced visually from the way the field composes.
* walk cubeOscar Najera2023-01-151-25/+49
|
* solve part2 exampleOscar Najera2023-01-151-27/+37
| | | | Realize I can have an arbitrary cube
* moving on cube surfaceOscar Najera2023-01-151-126/+114
|
* track facesOscar Najera2023-01-151-1/+124
|
* Day 22 part1Oscar Najera2023-01-153-0/+321
|
* Day 21 Full solveOscar Najera2023-01-131-13/+58
|
* day 21Oscar Najera2023-01-133-0/+2774
|
* Day 20 part2Oscar Najera2023-01-131-10/+15
|
* Day 20 part1Oscar Najera2023-01-132-0/+5070
|
* Clean upOscar Najera2023-01-121-187/+92
|
* Working. Use fset a lot moreOscar Najera2023-01-121-25/+45
|
* Not workingOscar Najera2023-01-121-28/+54
| | | | Test the comparison of states
* preliminary stack of statesOscar Najera2023-01-121-5/+81
|
* solve day 19 part 1 LISPOscar Najera2023-01-111-32/+75
|
* cleaning upOscar Najera2023-01-111-44/+16
|
* solves exampleOscar Najera2023-01-111-39/+40
|
* AGG Mutable stateOscar Najera2023-01-113-0/+140
|
* some isolation of tasksOscar Najera2023-01-111-5/+10
|
* property based distance testOscar Najera2023-01-111-0/+10
|
* Day 18 part 2Oscar Najera2023-01-071-1/+45
|
* Day 18Oscar Najera2023-01-073-0/+2792
|
* Day 17 do it in emacs too slowOscar Najera2023-01-072-1/+149
|
* Some cleanupOscar Najera2023-01-061-19/+17
|
* Drop those type annotations that didn't speedupOscar Najera2023-01-061-30/+14
|
* Day 17 part 2Oscar Najera2023-01-061-30/+35
| | | | There is no better optimization that calculating less
* finding a periodOscar Najera2023-01-061-19/+45
|
* some typing hoping speedupOscar Najera2023-01-061-29/+67
|
* solve day 17 part 1Oscar Najera2023-01-063-0/+92
|
* reorder cleanupOscar Najera2022-12-201-104/+105
|
* orderOscar Najera2022-12-191-38/+41
|
* early exit for unpromissing pathsOscar Najera2022-12-191-35/+57
|
* compactOscar Najera2022-12-191-38/+32
|
* reduce no loopOscar Najera2022-12-191-9/+12
|
* reduce instead of sortOscar Najera2022-12-191-5/+4
|
* Create directly next moves listOscar Najera2022-12-191-14/+17
| | | | | Test in place for suitably. Instead of a copy of the travel times create a new list that is more useful
* denest moreOscar Najera2022-12-191-24/+26
|
* isolate and denestOscar Najera2022-12-191-36/+34
|
* appropriate only does check no next-options redefOscar Najera2022-12-191-14/+10
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-25 01:12:14 +0000