2022 retrospective fixed broken link

1 files changed, 1 insertions, 1 deletions

diff --git a/2022/commentary.md b/2022/commentary.md
index 00c9f49..915d769 100644
--- a/2022/commentary.md
+++ b/2022/commentary.md
@@ -17,7 +17,7 @@ So, here's my day-by-day opinion on how this year went for me.
 *  **[Day 9](https://github.com/hunkyjimpjorps/AdventOfCode/blob/main/2022/day-09/day-09.rkt)**. *Simulate a rope.*  Simulation problems are my favorite kind of AoC problem (probably because they're the most similar to the kind of stuff I did in school). The solution I wrote for a one-segment rope in part 1 just needed to be folded over a list to give me a solution for the ten-segment rope in part 2.  Higher-order functions are nice.
 *  **[Day 10](https://github.com/hunkyjimpjorps/AdventOfCode/blob/main/2022/day-10/day-10.rkt)**. *The traditional fake-ASM parsing problem*, and another problem that's just largely just folding a function over an accumulator. I feel like if you get comfortable with `for/fold` you can get about 25 AoC stars right off the bat.
 *  **[Day 11](https://github.com/hunkyjimpjorps/AdventOfCode/blob/main/2022/day-11/day-11.rkt)**.  *Monkeys take your stuff.*  This problem features my least favorite AoC trope, which is a Part 2 that requires you to know a particular fact about modular arithmetic to solve it in a reasonable amount of time.  It also had a data file I found less annoying to retype by hand than to parse.  Probably the worst one of the set.
-*  **[Day 12](https://github.com/hunkyjimpjorps/AdventOfCode/blob/head/2022/day-12/day-12.rkt)**.  *Find a hiking route up a spiral mountain.*  I leaned pretty hard on the [`graph`](https://docs.racket-lang.org/graph/index.html) package for this one.  Eventually I'd like to learn how to implement Dijkstra and A* and other graph traversal algorithms myself, but for now I'm satisfied with just figuring out how to use the prepackaged versions.
+*  **[Day 12](https://github.com/hunkyjimpjorps/AdventOfCode/blob/main/2022/day-12/day-12.rkt)**.  *Find a hiking route up a spiral mountain.*  I leaned pretty hard on the [`graph`](https://docs.racket-lang.org/graph/index.html) package for this one.  Eventually I'd like to learn how to implement Dijkstra and A* and other graph traversal algorithms myself, but for now I'm satisfied with just figuring out how to use the prepackaged versions.
 *  **[Day 13](https://github.com/hunkyjimpjorps/AdventOfCode/blob/main/2022/day-13/day-13.rkt)**. *Sort a recursive data type.* I'm really glad for two features of Racket for this one.  First, the ability to read data as code, which meant I could read the nested lists directly with just one tweak to the readtable and without doing any string parsing at all.  Second, structural pattern matching.  Racket's matching syntax isn't as elegant as some languages (I miss the `[x | xs]` form from Elixir compared to `(list* x xs)`, for example), but it's powerful.
 *  **[Day 14](https://github.com/hunkyjimpjorps/AdventOfCode/blob/main/2022/day-14/day-14.rkt)**. *Simulate falling sand.*  A fun simulation problem, and one that both has a naive solution that solves in a reasonable amount of time and an optimized backtracking solution that's easy to reason out.  This was my favorite puzzle of the set.
 *  **[Day 15](https://github.com/hunkyjimpjorps/AdventOfCode/blob/main/2022/day-15/day-15.rkt)**. *Find the only possible place for a missing beacon.*  The fundamental problem here is finding out a way to represent a range of integers sparsely (or [using a library that does that for you](https://docs.racket-lang.org/data/integer-set.html)).  Lots of opportunities for optimization.