| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | reduce no loop | Oscar Najera | 2022-12-19 | 1 | -9/+12 |
| | | |||||
| * | reduce instead of sort | Oscar Najera | 2022-12-19 | 1 | -5/+4 |
| | | |||||
| * | Create directly next moves list | Oscar Najera | 2022-12-19 | 1 | -14/+17 |
| | | | | | | Test in place for suitably. Instead of a copy of the travel times create a new list that is more useful | ||||
| * | denest more | Oscar Najera | 2022-12-19 | 1 | -24/+26 |
| | | |||||
| * | isolate and denest | Oscar Najera | 2022-12-19 | 1 | -36/+34 |
| | | |||||
| * | appropriate only does check no next-options redef | Oscar Najera | 2022-12-19 | 1 | -14/+10 |
| | | |||||
| * | run test on makefile not on script | Oscar Najera | 2022-12-18 | 1 | -1/+0 |
| | | |||||
| * | Logical path test instead of member | Oscar Najera | 2022-12-18 | 1 | -23/+21 |
| | | |||||
| * | unify solution with part1 | Oscar Najera | 2022-12-18 | 1 | -42/+13 |
| | | |||||
| * | track current flow in place not on sorting. Speedup | Oscar Najera | 2022-12-18 | 1 | -13/+23 |
| | | |||||
| * | test cleanup | Oscar Najera | 2022-12-18 | 1 | -16/+23 |
| | | |||||
| * | ??graph to hashtable | Oscar Najera | 2022-12-18 | 1 | -9/+13 |
| | | |||||
| * | some cleanups | Oscar Najera | 2022-12-18 | 1 | -50/+61 |
| | | |||||
| * | Solving day 16 | Oscar Najera | 2022-12-18 | 1 | -24/+95 |
| | | |||||
| * | Return optimal path too | Oscar Najera | 2022-12-18 | 1 | -17/+21 |
| | | |||||
| * | LISP solve part 1 day 16 | Oscar Najera | 2022-12-18 | 1 | -99/+35 |
| | | |||||
| * | traverse but not optimum | Oscar Najera | 2022-12-18 | 1 | -24/+120 |
| | | |||||
| * | lisp try day 16 | Oscar Najera | 2022-12-18 | 1 | -0/+64 |
 |
index : pub/hi/scratch | |
| Short Software projects to try things out |
| aboutsummaryrefslogtreecommitdiffstats |