diff --git a/2024/R/day19.qmd b/2024/R/day19.qmd
new file mode 100644
index 0000000..509d1bb
--- /dev/null
+++ b/2024/R/day19.qmd
@@ -0,0 +1,32 @@
+---
+title: "Day 19"
+date: 2024-12-19
+author:
+  name: https://adventofcode.com/2024/day/19
+  url: https://adventofcode.com/2024/day/19
+---
+
+## Setup
+
+```{r setup}
+# Libraries
+library(tidyverse)
+
+# Read input from file
+available <- read_lines("../input/day19.txt", n_max = 1) |> str_split_1(", ")
+desired   <- read_lines("../input/day19.txt", skip = 2)
+```
+
+## Part 1
+
+```{r}
+
+# Convert all possible available patterns into a regex string
+regex <- str_c("^(", str_c(available, collapse = "|"), ")+$")
+
+# Test each desired pattern for a regex match and count the number of matches
+desired |> 
+  str_detect(regex) |> 
+  sum()
+
+```
diff --git a/2024/input/day19.txt b/2024/input/day19.txt
new file mode 100644
index 0000000..aa74deb
--- /dev/null
+++ b/2024/input/day19.txt
@@ -0,0 +1,402 @@
+ubgw, gug, wg, ubrgrrbr, gbbu, bg, ggu, uwu, uuuw, uu, brrg, rrb, ww, buggu, bbgwu, wwu, gbrgu, gggggr, grwggw, brru, wwuwubb, rbbr, wgbbgg, rbrr, wur, uwg, rub, gwubwuwr, brrb, wrgbbrg, brb, wuw, bwrubgw, gwu, uugruw, bggr, gww, brbrrbur, rrugurr, uurruru, uug, rburg, urggrw, uruu, bbr, gwrw, uubuggb, ggrr, gu, ugb, gbguwr, ubgwb, rwb, rggwbu, ugur, buggwg, rrrrg, gub, gbb, uwbu, ruw, wugrgbw, gwr, bgbbuu, rw, wrrb, ubguug, burgb, www, rbubbwg, wwguur, grb, gggr, gggubb, ubgu, gwbg, wug, wwr, gggguw, urr, gb, wwwrw, ugu, grbuw, ubb, bwrrr, ggg, guuugb, rwbb, rbw, wurwwb, brrbguwu, rwubg, guwbg, gwrb, gwwwb, ugbgru, uwrugu, gbg, gwrr, ggww, bwubwg, rww, bgw, rbbwwb, ggbugbg, ubrw, rurb, wwgwrbwr, ur, ug, rbrgbwg, gwg, gbbgw, uggr, wruw, gwb, brugbr, rur, gbw, wbuuu, wubw, ub, uwug, gr, uwwrwg, wubub, bbb, guguw, ggbbg, burrgu, bgb, wbrwwr, ugubwb, rugw, rbb, uur, w, grwu, rbrw, ubbrw, bbw, rwg, rgggrgrb, bu, bbgw, r, rruwb, uguwgb, ggr, brg, ggbg, bubru, bgugrw, bubbbb, guuub, guwgbwr, rrguuww, gbuw, rb, wrw, wubwb, gw, rubbrwbb, wuguu, wwub, brub, rgbu, wrbw, urbwuu, ubuwub, rbwbb, rurrg, gurb, ugrrr, bur, wu, gwbgwubr, ruu, wbbr, wrwg, ubbrg, brugrbw, uuwg, uru, ubwguru, wbu, bwrrbg, bggbgwb, uuw, gbugr, guw, rrgb, wwbgr, urw, ugg, wgg, rbur, wurwrwr, urg, uwru, wbbg, rbbgwg, wwwuurr, ugw, rgugb, ugrubru, gugwgbur, guwubrg, gugbr, bub, wwuw, guwbbu, ubuuwg, rgbrubr, wuubbg, bgur, rbub, bruru, wgwbrg, rug, gbu, ugrgbwwr, rggrg, gggw, wggr, wgwugu, wub, wwbrr, wb, wuwr, gwbw, bb, brrgb, rgbr, gbr, bgr, bburbbb, uguggrgr, wrg, wr, ruubr, bbww, bbubu, brw, ggrrwgb, rbbb, ubwgbrw, rgu, gur, wgrw, wbuu, rwgbw, rbr, wbrrgb, bru, wwwb, gwwrurbr, wbwg, wbb, urbugr, gwug, rrrb, urgr, rrubbu, rgrwgw, uub, rbugru, gru, rrwb, wbbgb, urb, rbu, bwuw, br, uwr, wwwgbwb, rbbwru, wgwwuwrg, grbw, ggb, brrgw, grwww, bbwbwwu, wuu, guuuubu, uwrr, bgu, ubuuug, rgwubug, rwbuuug, wgwwbw, ggbrrwr, grr, guuru, g, bwugw, uwwurg, gubbwbu, wggg, rrbbg, wwugrbgu, bug, grg, wugur, burubgwg, uwb, bbuuguuw, rbrbu, bwwgg, rbuggwg, brr, rbwuggu, buru, bbbbb, ggwb, rrwrwb, wugwgbuw, wbrw, bwu, wrr, guwwbg, rgw, wgr, wugg, ugbgu, gwrrrbg, uurg, uww, wwbbgbub, uwgug, buww, u, wrrrruww, brbgb, wru, guubrwr, gbgbr, uuu, rrr, brwg, wggu, rgwrgw, ugr, grwwbw, ugbrw, rwgr, buubru, uubggur, rgg, bbrr, gwrgug, wwwuw, rurwbb, uubw, gbrwr, ugguwurr, guur, gwrgru, rwug, ruubu, wwrg, rrg, ggw, wrb, ubwubw, rwr, bbg, uwrb, bgrbg, bgg, bbu, bwg, guubb, burwu, wwb, rr, bwbg, ugbub, urwwwbg, ugubgg, bwr, gbuug, bbwwbwu, wrbwb, wrub, uwwg, rrw, gbuu, wgrww, urwwg, bwrr, rrug, rru, wbgrg, uw, buu, rubwgwr, wbg, rwbbr, buurb, wrgbr, ggbw, wuwbw, buw, brurrur, wgw, wubu, wwbb, wgu, bgbu, uwgbu, rrbruu, ru, wwwbu, gg, wgrgr, uuug, ruub, rgwbrg, rbrrr, bgrr, ubw, urwgwgw, bww, guruwr, rwwrr, wgb, ubu, gguu, wbr, guwww, rgb, uwww, rbggr, ubr, grw, wrggur, bwwg, guu, wbw, gwbb, gwbub, rgubw, wwg, rggru, rbwbgg
+
+gbuggugwwurbbbggrrwbgubrgbgwwwbwurbuurgrburbbrgbrg
+uwwwrgbrugbbbbrgggubrbgwbggwugwbrrguwrgubuuggwggwrbuuuu
+rurgubgbgruwubbrbgbwrwgggwbggbbgrgbgbuwurrrrwwrwg
+bgbgbugwrrwuurrggbbugwbgwubrbrubuuburwbbrbrgrgwb
+wrbgrrurbgwwwrbubgbwubrgwguwggguuwguwbwuggubruw
+wgburbrwuwwugruurrbrrgbwrbbbwbguwwwurrbuubgwbrwur
+wurrwrugrwbrwrgrwrbbubugrwbuugubwwwuburwruwrbb
+rbruwbbruugwuwuwgwbrubwbrgwwbrwbbggrrwbbwrgbwbrrwb
+bgugwbwrrwrrwbggggrruurrggbbwrwwbwwugwbbrbguwr
+bbugwgugwrrwrgggwurrbuubbruburrgbuuwbbbgrbwgrggwuwu
+brgugrrwgruwrgggwuwgugurwbbgbgwrwgrugrggrrwg
+ggbbuwuwbrguwrbrguruburbwwgrwbrrgbbuugwuggwgwubruugbuggbr
+rwwrbwuwuugbwurubuuuubbwrurrrbrrbuwwrwwbbw
+gwgbubgbrwwbggbuwbubugwburgrbbrbbbbrubbbgu
+bwbrwwurwuwggwbgbrgubgbbuwuuwbbrrbguwugburrbbgg
+ruwrrugbwgwugrrrbwgbuwwbbgbubbubrrwwgbbgubgggurgbugbwbu
+rrrrbrbggubrbbrbbwbrugrguuwguwrburuurrrrbugugwrrg
+rbgwubgrbwrwrggurguuwrrrugruwbuurwgrgrrguu
+rbuugrggwbwwggwugrwrrrwbbrubwrwurbbuwruwbbwbuurrrwrubgggrr
+gruwbburgwwuuwurgwwuwbgugbubrgrgwrrrgwwwwgbwrrwwwwub
+rgurgubbubbgwbwruugwbgrrrbguwuuggrgwwrgwbr
+bwbrwgrrwwubrgrrbrbwuurbruuubwrwrwuuugwbrgwugww
+gbubrbbgurwbuguwurbgbubrgrrbrwruwwubbgggrwwrgbrrru
+brrgubgbwbwwugrwgwrwwbgwbwbgwgbbbgrbgggrrrrubwubbgu
+rrrbrugurubgrrwrgubwguurbggguwrwbrggwrgrgggwwwwrru
+bguwgrwbggrrbubrrwgwgrgurgwugguwruwgugbrwuugruburwuwg
+rugrggbugbrrguguuwwuwrggubwwrbubbwbrrwubburrburrgguubwgbwb
+uwgwgrgbggbwrruuuwguuwwwgrwwgrgurrbgururrrrgbg
+bwwrbrrbrburrguubgwrgggwrugugbrrrgwgguburuwr
+rbwbruuuguwgbgrbwurbbwrbuuwggrrrgwbggrrrgrwgwbwrggwbwbg
+gwruuburbbbgrwwgbgrgwrgrgruwubrrrbggwburrurbbrr
+gwuuwubwuggwwgrwuuururugbbbgbbbbgrgbgrbbguwwbww
+bbbbgrbrwurwwwubuwgbrrurbwubuurwrrrbrrgbrgrrrb
+bgbuwuuwrbrgwgrbrrwurbbbbggbugugbgguwwrrgubgwrbwgbwwgbwgg
+bbbrgrbbbrrrgbuwgrwubbugbuwbwrbuuuubwwwbbwbgwb
+bwbrrrwbbbrburwwwurgwggwbrwuubwwruurgugwugwgbuwrub
+wwuuwubwwgbrgwuuwwbwuruuggbbwwwrgubgrbggburrw
+bbugubbrwwgrwurrrubggbrbuwwrgugrburbwbbbwbgggbbbug
+uugurgbbwguwwugwbbrbwrubbrrrrugubbwwbuwwgbrgguugrw
+rrugbuwgbbwrwbbgguurubrwgwrubuwbbrbburubgwgugu
+bgwwwgwrbbwbggburruwbbgwurgrggwuwgbruugwuwguuwbbwb
+wubburguuguuuwrbwgwgbggbbgrgbbwuwbwbgbrwggg
+bugugbugbbbguwbbubguurrrrbbwgbgwbwrbuwwuwbubrr
+brrrrgrwwgbwbgguwwuuubbwuuwguwbbrubwbwggbgrwwrwbgrbwrw
+bbuwrwwubgruruuggggrbggrwurruwgwwrurbrbbrugbr
+uwwubburrgrbuuwbubrwububgwuwugruubbbgbggbrrur
+gwgrrugbwgwwurgugwrrwwruubguwugwwwwuruguruggr
+wbburrbuuurrbbbbbubrwwguwbbbwggrbwbwbbbuuuwrgbbgwrrgurgwg
+rwgbbwbgugwwuuubwwrgrbgruwwuwrrruwwrrgbrrwwruuwbrwrbu
+buwgwrwwrrggguuuwurgrruuwbwruurgrrgugrwbrgrbggruu
+gggwurbwbgwwwgwbrrugbbuwrbwwbgrwrwugrruurgwrgrgbwwwguwwr
+ggrbwbwuwuubwrwrbwuguwbbwwubbrwuubbwuwurrwugggbu
+wuubwgrgrrurrggwruwgrrwwrwugwuubugrwrwwbbub
+grwwguubgbugbuuugurbuwguwgwrgbwrgrbbwubbbuwbbwbg
+urwgrrbbbrgurgrwbrwruubwrrrrrbuuwrgrrwgugwgb
+wgbubbbgrwrgrrrububurgburwwgbwbrbwrurrgbrrbwwwbuub
+wgwrgbrburggubrgrruburbbwwgrrugugwubuuururbwubw
+wuwugrwwwwubguuuurbggburwguruwrrwubbrururwbu
+bgguuguwbgurwgwwggrwrwggwwggwbrggburrwbwwguwwugrguuw
+bwbrubuwrrrrwgwrurgrbuwgrubggugbrwrrrruruwruwrugrbbuuuwgubg
+wrbrwgbwgrbrrubrrruguwwggwwwgwruggrbubbruwuwubrrwwgugbgu
+bwbuugbgwwgbbuggrgrrubbbbubuwwgwbbuugwwwuuugrgwrb
+rwuugubbrrbgugbbrggrwwugggrgwgbggwbrrwguubbbgguwuggwu
+wgwrrrwrrwruurbwgurruwbrrrrgbgguurrgbbwbbbrruuru
+ubuwbbwugwrgwbrbwgrggbubbugubbguguwwrgrbbbgbwuubru
+gwrwgbrgubwwbwwgrrrbggbugwrrruwrbrrwwwwwuburuww
+urrrwbwgrrggwbbwgrubrrbgubrrbguwuburuwrbwwwwrbburrbwrrrugg
+ggburbrbwbrurgbuurgbbgbbugguguwwgubwgrwrbgwuururuu
+rwbrrrwggrwrbwbuuuwrugugbuurbruuugubgrbrbrggrgurgrgbwuwr
+gwugbwgggbwgwbrwbuurrwggwguwbwrwwwrgbwbwguuguwwrwgrguwgu
+bburrugrbwuurrrwwgruugubuugbbwbrgrgbbwbwubwrbrbggurgugw
+uuwbgubbuwrurrwburgwubbgrurwbggbururbuwgubwuw
+bwbuwrwwwgwwruwwggbgrugrruubwruwgrrwburggugugwb
+grguurbbrgubbubgbggggwwubbwubgrgrbbguuugbuugbguwrbwrwbwg
+bwrrbggrrwwbbbbbrruugrwuwbrggugwrrrubbwrbrguwgwwgrggwb
+wgbbuugrubrrgbwbuwgbububgwrgubggbbwwwbwbugbrugrruuurrw
+wuwrbggrrggrbubbbwubguwubwurwugwgbgrubwbbgw
+bbwbrgwbbgugwwbrrrwbbbgwbrbgrbgwgwgrgwguburbw
+bbrrwuwrgrbwgurgggurbbrbwbwruwggruuuwbuggrbwuu
+rburwgbgwbrbbbwbbwrrwuwrbubgubwuwbubbuurug
+wbbuggggubwbugugbbbrrbbguwuuwbbwurruwbbugbrrwg
+gguuggubuugwwubgrurbbrrrbbggwbwrubwwrgrurw
+rwwgrgrruuggwgwggwbgburrwbuuurrgbggbwbgrruu
+brrgurbwrugbbwuwgwuuwgruwwurrrbubwbrgwurwugbgggwbburbrruuu
+wrubbgrurrguurbgrgugbuwgbgwwgubwguuwwbbugbrruwgwgugwwgrugu
+gwwbrbgrrbgwwubwruguugguubrurburrwbuubruuw
+wurwwrrwbrwrwguwrubrbwrwugubguwrubgurubrwrbuugrwwuwwu
+wuwuggrbwubwwrwrrwggbbwwwuwgrwgrbwwrwwbugbwuwgurbgurugrurw
+brgggrgrbgruuwuugguwugrrwgbrwwgrruwggbgggwwrrwbuuwrgwugb
+bwbwwbbgbubwggburrwuwuubrbgrurugbbgrrruwrwrgu
+ggrwwwwrgbgbbbgrubuwwugguguubuubbbubrbuuwbwrbrgwrw
+uugbbrbwbgbbbwurbgwugrwrbwrbwwuwwbrguggwgrrrggwuguggrrgrwg
+rgggrbbrbrgubrbggrwuwbwuwubwwuuwuwuugbrgwu
+wbgurgrbrwubwurbgwwgbrwgbwbgbbbwwgrbgwrwbrbwwwrgbrrbwbgwr
+wbwgbgurwbuurruuwuuurrwwwwugwgururuwwbrrurwuu
+bwurgurubbbwgbbwgrguwwwbubggbggugrurbwbwrwbrruwugubbuw
+gburubbrrgwrwgwgrrgrgguwwgwwbwgrgggurubggbbwbuwgwwrrrwwru
+brbuggguwuruuwgrgwwrgbbubuwgbwwwurgwbugurrwwrugrg
+gwwgbbwbbrugrgugrwrwgwrburgruwuwuwwbwgrbguwuburrwbgruwggwb
+bbgbgggwwubwbwgrruwwrwgwgwuwgggrgurgbggwrbggwwrubbbu
+gwbruwrrrguwwbwbrwwguubburgruggwggbgubrurbrg
+ugrgrgbwurwwrwurbggwubbggwuburrrwwgrbbgwrgwbur
+gwgrgbrrbrrbwgwwrwggbbrbwgbrbbgbuwbrbbgwbgrggrgwuu
+bwbugrbgbbbruwgbwbwurbbgrbgrugguwrbwgbwwwuggbwrrwwwgrgbwrbu
+wgrgugwgbrruggwbrwbwurubgurrwgwubgbrgurgruburgg
+gguubbrbwbubguubuguwrwbgrwgwuurrgbrrwbgwbrwbu
+rbbrggugrubbuuruwrgbbgurbbwgugwuubwrgugubgwgugrw
+wwbbwwubwwbrugurgrbgruwrwwbgurgbguwrguuwwbgugrrgwgwugguu
+bbuwugrbbruuggrwwgrwbbgbwbwguguwurbbggubbr
+wgwuwwwbwgrguburbgbrwwbbgbbgugwbubbggbbuuwbgbgwbburwrg
+rwgrwgbbwrrrruwwuwggugbrgwruwuubbuwbbggwuugbruugbgbwwggg
+wwrwgwwwrgrugwgrwbrbrguwgubrrrguuugubuuuwuubgw
+bbuwgrrbwrwwwwgbgwbrrrbrrbgwuwrgwuwwbuggbwrwurwgwurwrwwu
+grgrgrguugruggbgbbubwrgbbbruurwgruwrwguguburrbbbuuwgwuggug
+rrbugrbuwrurbwugwuwgwuwbbwbugrrbgbuwrrugwruuwbbbugwwu
+bwwgurwwbubbwwuuwgrgrgwuuggwbbrrbgwgrubrgbwrggw
+rwwwwubuuuwububbgurbwrrbguggwgugwubgugwgggwwubgwbruubbwuur
+urbrrbwuuwuubgbbwbrruwbbbgwgbbuuururuwbrwgwbr
+wbwbbugggwubugrruugbbggugwwuwbwubrbbwbgwur
+wgwuwwbrwwugwgubrrwgbbgbbrggwurubbruwwgwugwguurrggrwgb
+ubbgwrbwuuggwwgrugugurwwbbwgrgwugbbrbuubugugbbrrbgbbggg
+bwbruuwuwbbwbubuwrgwuurugugbwwgrwrbwbrwgggrr
+wwruwurbwrwwgurgwuwbrugrgrggrguwuwurburgrwbbuwugrwbwrw
+wbrbugbbuwgrgrgrbburgrwggurrbuwrrugurggwbubur
+urwrubgbuuubrubgbrrbbbwwrbbuububrwwugurrbrgrwgwbrwuugbuw
+bgggbwrgggurbwrggugrrbguurgbgurruuuruuuruwbrgbbrrwgw
+bruwrrrgbuubbuggrwuwurrrrrrubbbgruruwgbruwrgbrurburwgurw
+rgwwguugbrbrrburggwwuuruurbbgubrwbwgugbwbbggggrwwrbr
+bugwburbgrwrugrrugwuwrgububwgrugbwubgrrrugrguubbgrub
+grrrburrurwgbuurrrugrbggwurgrwgbwwwururuwbrgbgg
+ugubwwubrwwbrrwggruwrggwwrrwrwwgbbwgwgwwbub
+bbuwuruwwrbgurwgbrgurbrbrrrurgurwgrbruubgbgbggbw
+rubrgwbgwurbbgwurwgrgrugwwgurwubgugggurrgwrbguurrbuugu
+ruwgbrbrbwruwrwbbbwwuwurguuuwuwgbrwrrrbburbuugubgwurugwbwr
+ururguggubgwbwbgbrugrrrwgubuugbwrubugrbgrwguwuuuwrwrb
+gubrbgwgwrgwbugwwrurwrwuggburbwbugrurugbbgw
+bburugggrrbwuggwurbuwbgwguwrrbubwggrubggwwwuuu
+bwuugwrgurrugbwuggwrgwrbwwugwgwurwbrwwwrgubgrgbgwrwb
+rwrugrugrwrwugrrgbgwbggbrbbwwbuugbgwwrrgggggubrr
+wurwrbwbbubuguuugwruwubggrwgugwuubgwbuugbbbrwwg
+bwbwgbbrrwrbgwruguugwrwgbgbubguwwgwrbwruugwbrggrggg
+gwwbbbbguubggbwrwrbbgbwwbgbwbrrgrgbgbbwbbb
+wrwwwggbubbrrwbwwburbugbwbwrwgggubbgguwrwuwbuwbguuugwb
+grwwubuwwbbubgwwgbgrrurrrruruggrbbrugubrrrugwbuurrrrw
+gwrwgwwuwwbrubbuwgrrubbugugwruuwgbwrwrwwgurbwrugb
+wbuwbrbuururbwrrgurbguwrgrgrbbubgrbuuubrugw
+gubwrrbrwrbgbbgwguwbbgbwrrbubrbggrwrrugbbuubbrgbgggu
+bbrwbbuuwbgbrbuuruwwbburbrbrgrrugbgbrwuuggwububru
+bbgwwugwurbgwwuurbgbrbrgrrbgubwwggwburrgwgrbbbrrg
+rurgbgguggugrwbrwuruuwurubbgwwwurggwwwwwbugbuuwwb
+rgrbugrbuwbwbbbuuggwurubugrwrrurbuuuugwwuwr
+brbbrgwrrbrbgubrubuuwugrbrrugruurbwbwgwgbugrrwwgw
+uggrwrurruwwwrbururwrwwruuugruwrrrubrrgbrbugwuww
+rwgwbwwugrwbugrwwwrwbgrrwwgwrwguwrrurbwbrgbrgw
+uruubbbgwrwwrbgugbwwbbuuguuwurrwuurburgggu
+ubgurrrbbbruugwurggrrwubwwrggrbwrbrubbrwgwbgru
+uurbbbgwubbbrbubrubuubbuwruwwwbuwgbbggbbuwrrrrwrgu
+gbgrrwguggbrgbwgububruubbgwgrggubrbwgwbuwgrwrb
+buwrgbggbwgrbgbguwgbbgrgwbubwgrbrrgwruwgwwggrrbburu
+ggbbbrrgggrgguwbwuruubwgbwrggbuguggburrbuwuwbgwbbguu
+bwbwgrgwgwwuwrgrgbbguurbbrwgwgurbrrbgubguubgugrguwguu
+bwbwbwuwrbbrrurbrgggrgrbrruuuruwggwggubrugubwwbruwrgrwbbbguw
+bwrwugbbwuggwrrgwurwrgwrggbbbbugubgwugbrwwbwr
+wrbugwuwrwbgbrrburugrbrguwbwbrgwbwurrwuwbgbwgg
+bruggwrwruwugbbuwuurbbwugurrrbuwggbuggwrwubrubgggugwggb
+bbbrbrbbguwbgggrwbrggrwbrgwrubbrgggwwgrgbggwgrgbgww
+bwbbbgggubuwgrwwbrwrwwwwwrwgbgwuggrrurgrgwubwuwruu
+rwrrwbwrbrwgggrggrrbgubgguuwugubwggwrgbgbwbgbuuwrgg
+wrgrrguggrrbwbgguggguwgwbbwgrwuwwuwuwwbwubgwrguuwuggbbwg
+bbuuuubbwuguwwbbubwbbwbwwggwgbbbubuwrruruggruwww
+wbwuwwwbrrgbggubrurbubuububwwgbbrwrwwgwbgrwggw
+uuubuurwubgbwwrrurbbrguuuuuuubuwrbwbbwwrrurguruwu
+wbugrggrwbgbwgrgrburuguwruuubbbgbbbgbwugbwur
+gugguuugbguubgbwgrubuwgwwggwgwbggbrwwrggrruwurwrwg
+uwuubgggbubbrrbwbbbrwwrbrgwrwbgwbrguwgrgwbwgrgrbgugu
+wbbwgruwrgurbbwwrgwbrguurugbrwwrbuwwbrbrrgbwrgr
+bwbuggwgwruuwgrrubbgggbwbbwbwbbubugugwrbrbguguggrgr
+rgbrguuuwrrgwbbrwgrwbugwbubwwwbuuuugwrwurgrwwrrbruwugw
+uruwwubrgwwrwrwrgugrbrrguugruuwbwbgrrwgwwrbw
+gwugbruubbbrggwubbggurwuuugugubrggbgugggwbrgw
+bbrubbgrwuguugggubbbrgbuwwbbuguuwggbgrgbgrbuurggburw
+urrggwwbbggubrugrgwuggbbguubwrbuwbwwrbugrwgwbgwbwrrub
+rruwrgbwwwbrwbrbubgwbbubuuuugbbgrbgbwbrwgbbrrrgrwrggg
+bgwbubwbbbbggrbbuuurrgbrrwbbbugwuuwbbggrubwggbbwrgbrwug
+gugurrwrwgwwubgwrrbgubguwbgbubwrbwubguuubbuwubgbgbwburw
+uguwbbugurbuwuwrgbgbwggrbubwwrruwwubbgguuguugrbgburgu
+rbbgubwwrbbrgwbgrbwrggwuwrgbuubgbuwguuwbubbgubgguurwgw
+wwwwubrwubbwgurrgbwbwubrbburgrgbgggbwubbgwrgbwubwbrugbbuw
+urbrrbbwwrrrubwbwggbburrwuwbbbrbugugwgwgbgwrugrwrrrwwgwgr
+wgwgrrrbgrguguurgwwrbbbrubuwgwrbbrurwurugg
+bgwubwbrbrgwbbwurbuggrwbgrwubuuguwrgrbwbrbguubrbggr
+uuuwuubuggbgbwggubrwuwgrgwuuggwbuwguruuuubrb
+wruwwuwuugwugrugbrgrwgbgggrwuwgguruwrrburwbgbbwwbw
+wgbrbrwwwgwuuuggwuguurbwuubwwbbrbbrwgbrgwgugbwuwg
+wbwubrgbrgrwgubwrrwwwgrrbrgrwbrbbgbugwgggwgwg
+ruugwbburgrrbbrwwrrrubwgrbbbwbwggrbuuubwrbbwgbwubuwbwbgwbg
+wubgrrrrrrguwuruuwubbbwwrbrruwrwgrbgwbrwubrrw
+wuuuwgbgrrwuruuuguubgbbubuubbbugbrwuuuguuwgw
+guurggruggggwgbbgrrbbgrwrgbrurubbwbbuwbwugrwb
+rgrgubbbgwgwwgwrwggwrgwurwugwbbgwbgbrwrguubbbr
+rbrrbuggwggrrgurgguurrgruwrbbrrwuugruuwwggwuww
+uwwwrgggubwgrwbrbbbwbwbrbwbrwuuwwbrrwuwggwg
+gwbrruugwwbugrugwuwwrbrwwwwbwwbuubguuggwrwrwbbrurbrgur
+gruuurrwrbwrwwubrbrrgbbuuwgwwbbrbbbbugurugggwguwrbrgrrrrgg
+grurwwubrbgrbubbgwruuuuuguurubrbwwuggwrwggrrbw
+rrwbuwuwrurbuwgruwwgbuwwubggwbrbrrubrgggbrru
+gbubbuggguubgrwwwburbbrwuwbbrgguwguubwbrrrgbgwwbbu
+uggwbwugbugwrgwwrgrrwwbgwggbbwgrbbbrbuuuwr
+uwrwgurgwbbuwbrbgwruwburugubgubgrwuwbwrruurgbrurr
+buwubgurrrbruggbrrrwrbrbrbgrbwwgwrbwrgbwguwrr
+rrrggrguurururrwbwrurwrgwurgwwuubuuwbgugwrw
+uggruwgwggggwurbwggbbwwbwbgwgubbbwwwbbbuwwgr
+gbwrugrgwubrgwbuwrruuwbbwbbgrrrgugggubguugbbb
+rggbwgwwurwurrrbrugrubugbrwgrbrgbuuuuugwgwwbgb
+grwrgubwrrrguwubwggwgwbugrrbugrrwrgrbbggwwu
+rrrgbuwwgugbugbbguwubwrwrbrguugrbwgbwwgggrbwwwugw
+rbgbuwgrwubbrrbwbbrwrrgbbrrububbbgrguwrubwrbbgrwggwr
+wrwwrgubguwbbubguwwubrururwwwbgbrwrbbrwbwbbbbbbu
+ruuuwwgurwbrwwggrwguggugubbwrbbruuubwgrgub
+brgrwbggguwbwrwwugwuwwrgrwguuruurwgwuggurguuugrwbuwbrbw
+bwbuubbbbgwbgubuuwgrbgggrbuwrwwuwrggugrgbwwrrrbrrrruub
+gbrrgbgurugrwrgurwrggbgguuugbruubuwwbrgwuwuggbbbwbwgburu
+wrurrruuwuuugbuwgbrbubuwugwrwrrbbguggwbuwbuw
+buwuwrrrrubwrgbbwbgrbgbbrguwrwgrrrubwuuugbbggwurugb
+rrwwbwwbbwwggrwgugrwrwrggrrgbubbrurgruggubrwwgrgbrbgr
+grggwbwrgbbbgrbgurbubgwrbrrgubuwuwburuwburggbguwgrwgrrrrwu
+wrwgggwgrrwbbruguwrbbrwgrurrgwgrbrrrrbwrrwbggrrrb
+buwrbwugrgwwwwbbrwbuubuugbbrwwrgwwrgwuwgggurrbbwruru
+wwwrbwrrrwbbwbwbwuubwwbwuggubgbwruwuwururwbrubg
+bgbwrugwbguwurrbgwbwwbrgrurwbbbwuubgwgugbubrrurwgwwu
+brrbbrwgwwbwbbggwgubwbwwrbrbruwruruwgwrugbrgwubgggr
+ggrugwbbburwbbbbrbrrbrrggbuggwurwwbbrgbuwgbuug
+bbburbuurbugbwrwubwgurwwrrbrrbbburbwbwuggugbuuwruururbbwwu
+ubwuugbuuwbggrgwurubbgbwwwrbbguwrgrbbrggbruuguwwbbb
+wruuwgubgbgurrwwguggrwubuwbbgbuwbwgrggwubwuwrgbwrgg
+grurrbwubwbrwuugbugbwuurbrruuugwrwrubrwbgw
+gwuwubwrrwruwbrwwruguggrgrbggwwbbgrwrwgbgbwbgbguw
+wbbwgwrggubuurwwgbgwrbbwrrubgrrwrbrugrwwwu
+wwwburggwuugwrwrbbgwrwbgrwurwrbbguwrwburggw
+wrbwggbrrburgbubwuwguggguburbuburugrgwgbwwbrgbuwwrurguubww
+ubbwuwruurwwurwuuuurubbwwrgwbubwgruwbwwbggbubgg
+bwbbwbgwwrruuubbguuuwrrbuuugbbwwbrwwrrurwrguwrbbgurgrw
+rgwgwgurwbwubwurrwrrggbwwwwgggbguguugrwbugrgbwwrrguuuu
+wgbbrwguwgwbbubrbuurbgurgbuwbggrwuwgugwuug
+rgrbuwbggubuwgwbgubwurggurbwgrgrwbrrrbrbrrwbbrugrwburgrru
+gbrbbbwrgbbwguwwurwwbbwbgbgrrrgrwguruwbuugubbubwggggrur
+wgbrgrwgwgrrbbrbrruurwbgbrgwbwwwuuuururguuwbr
+wruwgwgrrrrurgwurrbgbbbrbuurrgbubgububrwrw
+bgrbgbugbrgrrbrgbrwuurwggugbbbwrbggwguubww
+gurguurbbbrggbrgurgrubburbgwbwrrurbbuwuuwrrwgwbbugburwu
+guggrrbgbrubbrwgbrwbbwgrwrugrugggubuguwuwrwu
+wuwwbgwwrwbrwrwwwgugwrwgrubbrburugrgrrwgggwrburbr
+wgbbuwrbrbrrwuuurrbwgrwwwbruwggugwrrwgubbugugurrurgurwgug
+gbugwrgwgrgrbgubwbrwugbrwugrurburrwgbwrgbbgbrggrb
+gubuurbwubrubburrrbrrubrwrrrrgubwwwwbbwrubr
+wwrubrgbgbuuwbwgrbbwuburgbwrwuwwgubgbugwgwwrrgbw
+rubrbrbgbbrwrgwgbrrrgubwwrrrbrggbruwrgubgbgrbugrgug
+guwwuwbgugwguwbwguuuwrrbbrggwrrubrbrgrrurw
+ugbbugwuuuwugruggbwbwbrwubbgbgwbrbgwugwbgubgubbrrub
+rguuuwwgwwruwbugrugbuuruwggurbbggrrwbwgwwgruub
+bwbrubwrgugrrwbwbrgbwwugbuggbbubbbrrbugggwrugubw
+rugbuurrbugbrbrwwwrgwgwbrggwrgwgbgguubrrubwggb
+bwburuwrgrwrbrbgurwruguwbbgrrrgwgwgbgruugwwugrbgurgubbrwug
+brgggubburwgguubuuruwgbbuwbwgrbrrwrguuwbgrgrguwurg
+rubgbwuwgugrbugrbrbugrgwuwguwbbwurwruwgwuwbugrbwb
+wgrrwwwrgrwubggurguwgwbbwgrbubruwwwbgwbubrwwr
+bwbuwrwbgrwburbbbuuwugwguwwuuubbwgwguuuwurgrbburubgwgrwuubg
+bwbrggruuguugwrwbwuwuubuugubrurwwrrwrwbwb
+rrurrgrwbguuuurbbrrguubbgwggurwurrgubuuwggwuurrgwrbbwuurb
+wbruwurgugbgbrbgbuuuwrbbwgrrbwwgwrguurrurbbbb
+ruggwwrbwrwwwuwgggwgwggrubwuggrrbwuwbggbbugwbgwwwgwbr
+bruwgrbrrbggurwuuurwubbgbwgugwgburwgbbbrrbwbrwrbwgburbub
+gwwgugbgwuwbrubruuwwbwbbgbuuguuugbrrgrrbgwrrrw
+bgbuggbgrbgbgrbrbbggwwwbgrrgbbrwubwgwbbrgwwwgwrurwgrb
+bwubuggwrbwbbubwbbbbbbbwwugbgubbbuwrurwwbrrwwuggu
+wbbrrwgwrugbbgubggrbwwuuubwgbgggurbgggbwrgurru
+gbwuggrruguurubwugrurgrugwbgurggrrrgbgrrbgruwbggbguggbbrrb
+wrggruguwrugugbwbuugububwurugrwbggguggwuggggwrrgbuuguubu
+wrbbuwbrgbwuurgwrgwbrurrrbwubrrrrruwurwwgrubb
+ubrbrguuuuggbrgguggrgbbwbbwugggrwbwrwbwurbguuubgbrwbww
+wruwrgrbubbbrbbuuuuwgbgwbuwruugubuuwurrrbggwugwruubwbwwur
+bguwrgwugrrbbubwggruuwrbgugrbwubbgwwwbgwrrrwuwburgugruug
+ugwwuwubruuugwbbbwurgbbwubgbggbwrwbrbgrbrrgwrgbgg
+rgrggwwgurbuggwrbgrwubgugurrwbguugbrrgrbgbgbruuubuur
+bwbuwbbrwrgurgwggbburbwwgguugrgururugrbwuwuubguguug
+rgwbgbbuurbwwwuuugwrrguuubuwbuguurwuuwguwugrwrwrgwugbrwbu
+burugguruuuwwwurrgbwbbbggwwgbguurgwbbrwwwrubwbwrrrurrrg
+gbugruwggbuuwbwgubwugrgruwubwuuwbgrbwbrrubbbrwwr
+rbbgrugrruuwuggwwbbgubbrrrwrwrwuuwrbwwggwrbugwrurrwbw
+brbwbwwwuwbwbgrrbruwubwbbrwbguuwrrwrwrwrggwwu
+gbwwwgbgbrrbubrwgwwuuguuurwbburuuurrbuggbgugrrwggbrrwrrwww
+rggruugbwgbbrgugubgwbbuwubgrwbbgguwbbburrwbbgurr
+grbruwwwuwguwwwgrwwbbbgbrwggrburguggrwwbwrwbruggwu
+bbrbwuguubugbuuwgguuubggwuubuwbbbrburbubbbrbuuubgbrbrbu
+wrbrwgugrwgrrugrbbubbbwgugugrruburwwuwuwrwrgwwrbbb
+rwubgubrrwugbgbgwwguugbwrgggruuurgrwbwrgrwgbgrrrbr
+bwbburrurwrggwrrbrbrgwruurwububbwbbruuuwbuwuwbugwguwrguwb
+guwbbgrbwugrwrbbgbbbruguwgubrgugrbwwbwwbubrrrug
+wuwrrrgguugwugwgbuwgbgwuurgburrbwugwgbuwbggugrugw
+bwbwrwbgubugbrubrgrbrgubbuwurwuwwuwrbbugrgwwbbubwbguurwbbwu
+wgggbwuuwbuwrgbbbuwuwuuguwrguwgbwuugrubgwwwwuurubrburg
+bwbwgbrrwbuburwubrbwgrbbrgurrrrbwbgguwrggbbgbgwrbrgwrrwww
+rbwrrbuururwbuubuwbwggbbugbrbrgwrgurwgbubrurbrwwgrbgrrbr
+gbuwbwuwubbrugbrwubuwwwrgurwwbwbwwguwuwgbbwrwgwrgbg
+rbbgwbuwrbwgbububurwrbggruruwgubguwurbrgrwbwggbuugr
+bgwwrbuuwbwbgwbgubbgwguurrwggrggubrrwwwwrwrgurugwrbwuuw
+wggggrrggrwrwgrbggwrggrgwbbbguuubgrgbugbbburburuub
+rubgbrruubwbwwgrgbrubbrrrwrubugwubbwrbrwuubggggrwbwuw
+bbuubgrburgbgrrbrgrbwrubggggugwbgbggggrrbuubwwwbrburuubrrw
+bubggbbgrwgwggububugbrurruwurwrgbwbrwrrrwr
+rwrwuguwwgugubbggwugurwugbgubgwbwurbgwgburg
+ugwbgbubrburggwwgwgrrubbwrwwurrwgrugwwugbrrrgubwbubu
+urrgubuubbgrbggwwgbrrburrwwgwurwgrbubbwgubggwwgrgug
+bwubwwbbbbuwggurrwgrgbbuwruwgwurggrbugrrgrbrwbbwrrggwuuuwr
+bwbrrurgurbrurugbwrrbwbwwubgbbuwrrggwwrrwrrrruwww
+urrbubgwwbubbugburugrwgbuwbrgwbwbgbgbwgrbgubuu
+ggwrrgrwgugrwrbggurwbgrbbwwgguuurwbbwgbwwwugb
+rrrwurgrrrgbbuwrrrbwgguruuwrwwbuurgrbugrbrurbbwrbbrrww
+uubwwrrwwbrugwrwuugguubggwrggbbburgggruwbugrg
+ubrrburuwgwrgburggwubggrurbrwuwwuuwgbgrrgugubbbwuuubug
+gruuruubrbwrbgbwuggwwgwwuwrgrugwbuwbguwrurruwurbbwrrbr
+gbgurwrbrrburrbggugwrbwwgruuruwubrwggurgrrbrb
+bwbwwwwbugwugwbgwubrgruuugugggrugwgbgrbwgugg
+uuurbwgrrrwgrgbgbrugugwubbwuuuugwrrwrwrrwbrrbwuwbbbug
+rwgbbwrbggubgurbgbbgguburbgbwbuuwwgbbwrbgwrgwuu
+rbwgrbwwgugbrwwgbgrwugubwrwgrgwuggwrbbgbguuw
+brggggbwgwwbrbbbruggruggrwgubrbrrruggwwuuwbrrrgwuurwwrrbbb
+grrubwgbwgbuuwwgurgrwwwburbwrbbubrruwwgbwgrgbbgrgrwguggu
+bbuwwggrrrwbbuwwwgrwrwgrrrbgwurgrwrbgburbruugrrrwww
+gbubuwrwubrgbwgugwgrgrgbbrburuwgrwguwrguwbuuuggrugrugggwbg
+bwrggbrbugbugbwbbbguwbruwwuwrrwbugbuwuubgrbwubbwg
+ububugrrrgbgwuwrubuuwwuwggubuwugguwwurwbwwrruggrw
+brbbruguwwwurwrbbrrbrgrrrbwgrwrbgurbbbggrrwgugwggu
+rrwgbwrugwwgbubrgburwgbbrbggubrwugbgwgrubuuuwwuurrugw
+wugugbgwrwwwgburbrwgrrgwbrwrguwugrwgwbwwggggwuwb
+rbuwurbwwwuwruwrrgwbguwwgubbwrubwwubbbguwgubwbr
+bwbugguwurrwbgggguurbuguggbgwgwgurrwgubbwurgruwr
+ubruwwugubgburrurrwrbgubwgwgurwugbrgggbrrbbbuubwwwbw
+gwwbuuwbgurubgbgruuwbuggrrruguwwugrgrgbuwbggugrgbwrbbwuuu
+brrbwuuubrgwwrgbrubbrwbbbrwuwbbrrrbrwbrrbuwwwrrbwugwuwrrbg
+ubgrbgbgbubgwbwwugubwuubbbbrbrururgguwwgwwgwwbwwgrgbwg
+ugbgguurubgwwrbwwwgbbbuurbwguurgguuwbwurbrbgruuwrrwwwbbg
+rgwbrbrwgwgwbrwbbuggugbwgguuwggwwwurbbwuguwuuuru
+gugrbbbrggwbwwbbggbrwggwuuwrwrgrrbbwbwwwgwrrgurb
+bwbrwwwgwgggguguurrbuuwrrwrwwrwrwbggrwrwgguggbwuwwuu
+uwbwwgbbgrgwgwgbbubruurgbwwbwbwuuwugggguuuubuubrwrwb
+gwwggwbuugwurwwrgrbwrwwgggrgbwbbguwuggwrrubgrrbgwrgbwggrg
+urrrggurururrwuuguguurwbuubrrbwgwgbuwbgrgbbwurgb
+bbrguuwwwrggrgrwurgurbrurugbgbbwbrbuubbwwbggrbw
+brgbwwrguwwbrbwuuwwwgrbgbubwwguuubbrrrgrbwgrbbwbruubb
+wburugguubrbwwwgwrguubgbuubrwuwwwugrwwbubbrwwugubwwwu
+rbgrbrubrbugwubrbrwubrgbrggggbrggrgrwuubwuwbrruggrub
+uwbwuugbubrwubburbuuuwwwubgrbrbwurugwbrggwbbr
+ugbbgbwwwuuwrbwuwrubuuubwgggggubbwrgwbgurbrrgwuugbubrgwg
+bwbuuguggugwgburbgrruubwbbbgwwuubrrbbgrggwwggg
+wrwggbwuububgbrgugrgbrwbgbrrurggrurggbubgrbrruggrg
+bugrgururwrugbwbuuubrbugrwrbwrbruurgwgbbgg
+rrurggwburrwrwgbrrgrrbggwgbgwrbrubgbrgrrugbuw
+bbrbbrbbwwbbgbrgrwgrbwgwggbbugubwguuubgbrbuwbubggugw
+bwwrbbubwwgwwwuuwbbuuwugbgbburbbrbbwrgbbbggwrububru
+bwbrubbwgugruuwwrrggubwwwwgwbuurguwgbrrw
+rgbggruuugurbwguwbwbugrbbwbrrubrgbrrbggbrub
+wbrgwburuubwwbwgbbuggubbbrwrbgrgurwubrwbgwggubgg
+gwwburbwrrrrugrgrwguuggrrurgbgrugurwbgbggwgwbgbwrr
+ubgbrgwubwgbwwrwwbwrwgubburgwwwrgwggrwgwrwbugrrrb
+bwbuguubwurgwgbgwbrwggrgbgwbguuwwuuwububuwbgbbbuuguuwrubwwr
+bwburwbrbrrburrrgwwwggwuguurugwgbrgbbrggbrrwr
+ugbgugrrwurruburwwbgubrwburwgggbrguwguwurwrrbwrur
+uwbburburugrgbburgugrrrubuururrgrurwubuwugwwrbwrwuwbg
+uurgbubrwrwrguwwguuugbrwbwbbwwubrgbwuwbgrbgwb
+ugbrbbguguwbrrurgrrrrubgrgwrguguubrbbbrurubgwugggbuwubbub
+uwbwugwbwrugrurrbugrrrrgwuwrrrubbuubbwubbbbuuwrwwggb
+wuubggrrbgrgubrururbgugwrgubrburururbwuburbwgwgruubwguuwbw
+uwugwwwbwgrurrwwwuwububrruuuubwrwgbrbbuwububgwwb
+uwggbggwwbbugbguggubbgbugubwgrruurrgrrwbrbubgugrb
+bwbwrrbbrbgbggurburwgwrwwugruwguwrruurbrbwuuburu
+brwwwwurrbuburrwgwwbrbguburggbbguggwrwwubwbbbwww
+rbrurbrugrgwwgguwbrburrwwrbuwrwbbgrwbgrwurrugbwrbuugwwwww
+wwwwrwuwwbwbwrgbrbrbubuwbbwrrrwwwwbwgbruwwbrb
+ubgbguwrbbwuwugwrurwubrurgwwwbrgurubbuwgrrwburbgbugbgbwrg
+bwbbuwwwgwrrwurrbwburrrgbgrgrubbrubbrwbbwurggbrw
+urbgggbwwbwbgbguwwuubrgburgwuwuuwugwgrrbwrgrrbwuggrrrugr
+bwbuwugbbugbgggugurwgwbbwrrwbgbrbwrwwrwwubgwbrw
+gwwrrrbuwrwbwuguubwrbururrbgbwgrwgggwwuruuurruwwbuwuww
+uruuwrrbbwbgburggwuubrwgguubrgbrbbrwrrwgbrbwguubguwgbb
+uwubgguuuuugubuugwwrwbrbwguguwwgrrrrburbugggrbwbrrrwgrbwg
+ubwugrugggrurruubgwwgwrrgguuuwgubggwrwwuwwruwggrbb
+brwugbguggubgbrbbgrbwbbwwgbubgbggggbggbwubwrwbwurgw
+bwgbwbwbwgwwgbrgwubwgrwgwugubbbgubburwrwuwwrw
+wrbwgbbwggrubrugguwurruwbbrgrbrgruuuwubwwubrubwu
+rgwwugwbubwuwbbgbubbwbbuwwwbwwrurbbwubuwrwwwbgwu
+brbwwbbuuwbbwrwbruggwrgrwburbbwrubbbwbggrwrg
+rwgwbbwbrrwwurgugggwwbgburrruuwrbbwubgbugwwgwuwgbwwgw
+bwbwurubwwbwbubwwbwgwwrurbrubrgrgwrbrbrgwgwubbubuwrwwwuwbgwg
+wbbbwwururbgbrrbuuwbuwrwuuwurbwugggurwgbwbgwb
+urwwugbruuubrrwuggrburwwwbgwuuwuwwbbwurrrwrbgwgb
+gggbwgbrwruuuuwrbubuugugggugrrruruubuwbgugrrr
+bbrrbwrwrbubgbgwwuwrrwrbggbrgwurbgrrrbrgbbug
+gbwbwuruwwwugwwguwgggggrgugwwugrbgugubggububbwruruggugwr
+ugwububbbwwbwurrwwgbwwrgbubrrbubwwgugrgwwgrurwbbbbubwuww
diff --git a/_freeze/2024/R/day19/execute-results/html.json b/_freeze/2024/R/day19/execute-results/html.json
new file mode 100644
index 0000000..14e0d77
--- /dev/null
+++ b/_freeze/2024/R/day19/execute-results/html.json
@@ -0,0 +1,15 @@
+{
+  "hash": "8e7448dadefb57913685b2353c855293",
+  "result": {
+    "engine": "knitr",
+    "markdown": "---\ntitle: \"Day 19\"\ndate: 2024-12-19\nauthor:\n  name: https://adventofcode.com/2024/day/19\n  url: https://adventofcode.com/2024/day/19\n---\n\n\n\n\n## Setup\n\n\n\n\n::: {.cell}\n\n```{.r .cell-code}\n# Libraries\nlibrary(tidyverse)\n\n# Read input from file\navailable <- read_lines(\"../input/day19.txt\", n_max = 1) |> str_split_1(\", \")\ndesired   <- read_lines(\"../input/day19.txt\", skip = 2)\n```\n:::\n\n\n\n\n## Part 1\n\n\n\n\n::: {.cell}\n\n```{.r .cell-code}\n# Convert all possible available patterns into a regex string\nregex <- str_c(\"^(\", str_c(available, collapse = \"|\"), \")+$\")\n\n# Test each desired pattern for a regex match and count the number of matches\ndesired |> \n  str_detect(regex) |> \n  sum()\n```\n\n::: {.cell-output .cell-output-stdout}\n\n```\n[1] 363\n```\n\n\n:::\n:::\n",
+    "supporting": [],
+    "filters": [
+      "rmarkdown/pagebreak.lua"
+    ],
+    "includes": {},
+    "engineDependencies": {},
+    "preserve": {},
+    "postProcess": true
+  }
+}
\ No newline at end of file
diff --git a/docs/2022/R/day01.html b/docs/2022/R/day01.html
index 5c9e153..3446083 100644
--- a/docs/2022/R/day01.html
+++ b/docs/2022/R/day01.html
@@ -67,7 +67,7 @@
 <script src="../../site_libs/quarto-search/quarto-search.js"></script>
 <meta name="quarto:offset" content="../../">
 <link href="../../2022/R/day02.html" rel="next">
-<link href="../../2024/R/day18.html" rel="prev">
+<link href="../../2024/R/day19.html" rel="prev">
 <script src="../../site_libs/quarto-html/quarto.js"></script>
 <script src="../../site_libs/quarto-html/popper.min.js"></script>
 <script src="../../site_libs/quarto-html/tippy.umd.min.js"></script>
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 1</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
@@ -877,8 +883,8 @@ <h2 class="anchored" data-anchor-id="part-2">Part 2</h2>
 </script>
 <nav class="page-navigation">
   <div class="nav-page nav-page-previous">
-      <a href="../../2024/R/day18.html" class="pagination-link" aria-label="Day 18">
-        <i class="bi bi-arrow-left-short"></i> <span class="nav-page-text">Day 18</span>
+      <a href="../../2024/R/day19.html" class="pagination-link" aria-label="Day 19">
+        <i class="bi bi-arrow-left-short"></i> <span class="nav-page-text">Day 19</span>
       </a>          
   </div>
   <div class="nav-page nav-page-next">
diff --git a/docs/2022/R/day02.html b/docs/2022/R/day02.html
index d39836c..15e6212 100644
--- a/docs/2022/R/day02.html
+++ b/docs/2022/R/day02.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 2</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day03.html b/docs/2022/R/day03.html
index 788a657..3163757 100644
--- a/docs/2022/R/day03.html
+++ b/docs/2022/R/day03.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 3</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day04.html b/docs/2022/R/day04.html
index 469a3f3..a1d378d 100644
--- a/docs/2022/R/day04.html
+++ b/docs/2022/R/day04.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 4</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day05.html b/docs/2022/R/day05.html
index 52abd6a..daea34c 100644
--- a/docs/2022/R/day05.html
+++ b/docs/2022/R/day05.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 5</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day06.html b/docs/2022/R/day06.html
index b8f638d..5c92c39 100644
--- a/docs/2022/R/day06.html
+++ b/docs/2022/R/day06.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 6</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day07.html b/docs/2022/R/day07.html
index 28766e1..31eb920 100644
--- a/docs/2022/R/day07.html
+++ b/docs/2022/R/day07.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 7</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day08.html b/docs/2022/R/day08.html
index a604912..0a541d9 100644
--- a/docs/2022/R/day08.html
+++ b/docs/2022/R/day08.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 8</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day09.html b/docs/2022/R/day09.html
index 1556c0a..65093a0 100644
--- a/docs/2022/R/day09.html
+++ b/docs/2022/R/day09.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 9</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day10.html b/docs/2022/R/day10.html
index cf3807b..02c5858 100644
--- a/docs/2022/R/day10.html
+++ b/docs/2022/R/day10.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 10</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day11.html b/docs/2022/R/day11.html
index 1d9c97c..83cee1f 100644
--- a/docs/2022/R/day11.html
+++ b/docs/2022/R/day11.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 11</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day12.html b/docs/2022/R/day12.html
index c67d76c..6542dbf 100644
--- a/docs/2022/R/day12.html
+++ b/docs/2022/R/day12.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 12</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day13.html b/docs/2022/R/day13.html
index f5d449d..882f73c 100644
--- a/docs/2022/R/day13.html
+++ b/docs/2022/R/day13.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 13</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day14.html b/docs/2022/R/day14.html
index 4975e39..9c3dc81 100644
--- a/docs/2022/R/day14.html
+++ b/docs/2022/R/day14.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 14</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2022/R/day15.html b/docs/2022/R/day15.html
index ffa2bd6..22a5e48 100644
--- a/docs/2022/R/day15.html
+++ b/docs/2022/R/day15.html
@@ -250,6 +250,12 @@ <h1 class="quarto-secondary-nav-title">Day 15</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day01.html b/docs/2024/R/day01.html
index fd133ab..a5ca6c7 100644
--- a/docs/2024/R/day01.html
+++ b/docs/2024/R/day01.html
@@ -250,6 +250,12 @@ <h1 class="quarto-secondary-nav-title">Day 1</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day02.html b/docs/2024/R/day02.html
index 6547cdc..7914ddc 100644
--- a/docs/2024/R/day02.html
+++ b/docs/2024/R/day02.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 2</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day03.html b/docs/2024/R/day03.html
index ec614e9..2025130 100644
--- a/docs/2024/R/day03.html
+++ b/docs/2024/R/day03.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 3</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day04.html b/docs/2024/R/day04.html
index 00fd3bd..6fc9d45 100644
--- a/docs/2024/R/day04.html
+++ b/docs/2024/R/day04.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 4</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day05.html b/docs/2024/R/day05.html
index 59a216b..dad1568 100644
--- a/docs/2024/R/day05.html
+++ b/docs/2024/R/day05.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 5</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day06.html b/docs/2024/R/day06.html
index 1b60a0f..6c99af1 100644
--- a/docs/2024/R/day06.html
+++ b/docs/2024/R/day06.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 6</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day07.html b/docs/2024/R/day07.html
index 3455855..4a8fd29 100644
--- a/docs/2024/R/day07.html
+++ b/docs/2024/R/day07.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 7</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day08.html b/docs/2024/R/day08.html
index 065e7ee..9f52012 100644
--- a/docs/2024/R/day08.html
+++ b/docs/2024/R/day08.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 8</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day09.html b/docs/2024/R/day09.html
index 4e836a5..cb1801b 100644
--- a/docs/2024/R/day09.html
+++ b/docs/2024/R/day09.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 9</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day10.html b/docs/2024/R/day10.html
index 98f67de..9abb984 100644
--- a/docs/2024/R/day10.html
+++ b/docs/2024/R/day10.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 10</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day11.html b/docs/2024/R/day11.html
index 97a4bd2..dec79c5 100644
--- a/docs/2024/R/day11.html
+++ b/docs/2024/R/day11.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 11</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day12.html b/docs/2024/R/day12.html
index 396e3a3..c60c14b 100644
--- a/docs/2024/R/day12.html
+++ b/docs/2024/R/day12.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 12</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day13.html b/docs/2024/R/day13.html
index 03bcc34..e92c312 100644
--- a/docs/2024/R/day13.html
+++ b/docs/2024/R/day13.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 13</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day14.html b/docs/2024/R/day14.html
index 38cd77d..a0af92e 100644
--- a/docs/2024/R/day14.html
+++ b/docs/2024/R/day14.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 14</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day15.html b/docs/2024/R/day15.html
index 338c524..da510bf 100644
--- a/docs/2024/R/day15.html
+++ b/docs/2024/R/day15.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 15</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day16.html b/docs/2024/R/day16.html
index 2097d95..3396cdf 100644
--- a/docs/2024/R/day16.html
+++ b/docs/2024/R/day16.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 16</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day17.html b/docs/2024/R/day17.html
index bece660..384245f 100644
--- a/docs/2024/R/day17.html
+++ b/docs/2024/R/day17.html
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 17</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
diff --git a/docs/2024/R/day18.html b/docs/2024/R/day18.html
index bef56c1..05cbb33 100644
--- a/docs/2024/R/day18.html
+++ b/docs/2024/R/day18.html
@@ -66,7 +66,7 @@
 <script src="../../site_libs/quarto-search/fuse.min.js"></script>
 <script src="../../site_libs/quarto-search/quarto-search.js"></script>
 <meta name="quarto:offset" content="../../">
-<link href="../../2022/R/day01.html" rel="next">
+<link href="../../2024/R/day19.html" rel="next">
 <link href="../../2024/R/day17.html" rel="prev">
 <script src="../../site_libs/quarto-html/quarto.js"></script>
 <script src="../../site_libs/quarto-html/popper.min.js"></script>
@@ -251,6 +251,12 @@ <h1 class="quarto-secondary-nav-title">Day 18</h1>
   <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link active">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
@@ -935,8 +941,8 @@ <h2 class="anchored" data-anchor-id="part-2">Part 2</h2>
       </a>          
   </div>
   <div class="nav-page nav-page-next">
-      <a href="../../2022/R/day01.html" class="pagination-link" aria-label="Day 1">
-        <span class="nav-page-text">Day 1</span> <i class="bi bi-arrow-right-short"></i>
+      <a href="../../2024/R/day19.html" class="pagination-link" aria-label="Day 19">
+        <span class="nav-page-text">Day 19</span> <i class="bi bi-arrow-right-short"></i>
       </a>
   </div>
 </nav>
diff --git a/docs/2024/R/day19.html b/docs/2024/R/day19.html
new file mode 100644
index 0000000..1becd48
--- /dev/null
+++ b/docs/2024/R/day19.html
@@ -0,0 +1,878 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en" xml:lang="en"><head>
+
+<meta charset="utf-8">
+<meta name="generator" content="quarto-1.6.39">
+
+<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes">
+
+<meta name="author" content="https://adventofcode.com/2024/day/19">
+<meta name="dcterms.date" content="2024-12-19">
+
+<title>Day 19 – Advent of Code: Worked Solutions</title>
+<style>
+code{white-space: pre-wrap;}
+span.smallcaps{font-variant: small-caps;}
+div.columns{display: flex; gap: min(4vw, 1.5em);}
+div.column{flex: auto; overflow-x: auto;}
+div.hanging-indent{margin-left: 1.5em; text-indent: -1.5em;}
+ul.task-list{list-style: none;}
+ul.task-list li input[type="checkbox"] {
+  width: 0.8em;
+  margin: 0 0.8em 0.2em -1em; /* quarto-specific, see https://github.com/quarto-dev/quarto-cli/issues/4556 */ 
+  vertical-align: middle;
+}
+/* CSS for syntax highlighting */
+pre > code.sourceCode { white-space: pre; position: relative; }
+pre > code.sourceCode > span { line-height: 1.25; }
+pre > code.sourceCode > span:empty { height: 1.2em; }
+.sourceCode { overflow: visible; }
+code.sourceCode > span { color: inherit; text-decoration: inherit; }
+div.sourceCode { margin: 1em 0; }
+pre.sourceCode { margin: 0; }
+@media screen {
+div.sourceCode { overflow: auto; }
+}
+@media print {
+pre > code.sourceCode { white-space: pre-wrap; }
+pre > code.sourceCode > span { display: inline-block; text-indent: -5em; padding-left: 5em; }
+}
+pre.numberSource code
+  { counter-reset: source-line 0; }
+pre.numberSource code > span
+  { position: relative; left: -4em; counter-increment: source-line; }
+pre.numberSource code > span > a:first-child::before
+  { content: counter(source-line);
+    position: relative; left: -1em; text-align: right; vertical-align: baseline;
+    border: none; display: inline-block;
+    -webkit-touch-callout: none; -webkit-user-select: none;
+    -khtml-user-select: none; -moz-user-select: none;
+    -ms-user-select: none; user-select: none;
+    padding: 0 4px; width: 4em;
+  }
+pre.numberSource { margin-left: 3em;  padding-left: 4px; }
+div.sourceCode
+  {   }
+@media screen {
+pre > code.sourceCode > span > a:first-child::before { text-decoration: underline; }
+}
+</style>
+
+
+<script src="../../site_libs/quarto-nav/quarto-nav.js"></script>
+<script src="../../site_libs/quarto-nav/headroom.min.js"></script>
+<script src="../../site_libs/clipboard/clipboard.min.js"></script>
+<script src="../../site_libs/quarto-search/autocomplete.umd.js"></script>
+<script src="../../site_libs/quarto-search/fuse.min.js"></script>
+<script src="../../site_libs/quarto-search/quarto-search.js"></script>
+<meta name="quarto:offset" content="../../">
+<link href="../../2022/R/day01.html" rel="next">
+<link href="../../2024/R/day18.html" rel="prev">
+<script src="../../site_libs/quarto-html/quarto.js"></script>
+<script src="../../site_libs/quarto-html/popper.min.js"></script>
+<script src="../../site_libs/quarto-html/tippy.umd.min.js"></script>
+<script src="../../site_libs/quarto-html/anchor.min.js"></script>
+<link href="../../site_libs/quarto-html/tippy.css" rel="stylesheet">
+<link href="../../site_libs/quarto-html/quarto-syntax-highlighting-e26003cea8cd680ca0c55a263523d882.css" rel="stylesheet" id="quarto-text-highlighting-styles">
+<script src="../../site_libs/bootstrap/bootstrap.min.js"></script>
+<link href="../../site_libs/bootstrap/bootstrap-icons.css" rel="stylesheet">
+<link href="../../site_libs/bootstrap/bootstrap-6bd9cfa162949bde0a231f530c97869d.min.css" rel="stylesheet" append-hash="true" id="quarto-bootstrap" data-mode="light">
+<script id="quarto-search-options" type="application/json">{
+  "location": "sidebar",
+  "copy-button": false,
+  "collapse-after": 3,
+  "panel-placement": "start",
+  "type": "textbox",
+  "limit": 50,
+  "keyboard-shortcut": [
+    "f",
+    "/",
+    "s"
+  ],
+  "show-item-context": false,
+  "language": {
+    "search-no-results-text": "No results",
+    "search-matching-documents-text": "matching documents",
+    "search-copy-link-title": "Copy link to search",
+    "search-hide-matches-text": "Hide additional matches",
+    "search-more-match-text": "more match in this document",
+    "search-more-matches-text": "more matches in this document",
+    "search-clear-button-title": "Clear",
+    "search-text-placeholder": "",
+    "search-detached-cancel-button-title": "Cancel",
+    "search-submit-button-title": "Submit",
+    "search-label": "Search"
+  }
+}</script>
+
+
+<link rel="stylesheet" href="styles.css">
+</head>
+
+<body class="nav-sidebar floating">
+
+<div id="quarto-search-results"></div>
+  <header id="quarto-header" class="headroom fixed-top">
+  <nav class="quarto-secondary-nav">
+    <div class="container-fluid d-flex">
+      <button type="button" class="quarto-btn-toggle btn" data-bs-toggle="collapse" role="button" data-bs-target=".quarto-sidebar-collapse-item" aria-controls="quarto-sidebar" aria-expanded="false" aria-label="Toggle sidebar navigation" onclick="if (window.quartoToggleHeadroom) { window.quartoToggleHeadroom(); }">
+        <i class="bi bi-layout-text-sidebar-reverse"></i>
+      </button>
+        <a class="flex-grow-1 no-decor" role="navigation" data-bs-toggle="collapse" data-bs-target=".quarto-sidebar-collapse-item" aria-controls="quarto-sidebar" aria-expanded="false" aria-label="Toggle sidebar navigation" onclick="if (window.quartoToggleHeadroom) { window.quartoToggleHeadroom(); }">      
+          <h1 class="quarto-secondary-nav-title">Day 19</h1>
+        </a>     
+    </div>
+  </nav>
+</header>
+<!-- content -->
+<div id="quarto-content" class="quarto-container page-columns page-rows-contents page-layout-article">
+<!-- sidebar -->
+  <nav id="quarto-sidebar" class="sidebar collapse collapse-horizontal quarto-sidebar-collapse-item sidebar-navigation floating overflow-auto">
+    <div class="pt-lg-2 mt-2 text-left sidebar-header">
+    <div class="sidebar-title mb-0 py-0">
+      <a href="../../">Advent of Code: Worked Solutions</a> 
+    </div>
+      </div>
+    <div class="sidebar-menu-container"> 
+    <ul class="list-unstyled mt-1">
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-1" role="navigation" aria-expanded="true">
+ <span class="menu-text">2024</span></a>
+          <a class="sidebar-item-toggle text-start" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-1" role="navigation" aria-expanded="true" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-1" class="collapse list-unstyled sidebar-section depth1 show">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day01.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 1</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day02.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 2</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day03.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 3</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day04.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 4</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day05.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 5</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day06.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 6</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day07.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 7</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day08.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 8</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day09.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 9</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day10.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 10</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day11.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 11</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day12.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 12</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day13.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 13</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day14.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 14</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day15.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 15</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day16.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 16</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day17.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 17</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day18.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 18</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2024/R/day19.html" class="sidebar-item-text sidebar-link active">
+ <span class="menu-text">Day 19</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+        <li class="sidebar-item sidebar-item-section">
+      <div class="sidebar-item-container"> 
+            <a class="sidebar-item-text sidebar-link text-start collapsed" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-2" role="navigation" aria-expanded="false">
+ <span class="menu-text">2022</span></a>
+          <a class="sidebar-item-toggle text-start collapsed" data-bs-toggle="collapse" data-bs-target="#quarto-sidebar-section-2" role="navigation" aria-expanded="false" aria-label="Toggle section">
+            <i class="bi bi-chevron-right ms-2"></i>
+          </a> 
+      </div>
+      <ul id="quarto-sidebar-section-2" class="collapse list-unstyled sidebar-section depth1 ">  
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day01.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 1</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day02.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 2</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day03.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 3</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day04.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 4</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day05.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 5</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day06.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 6</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day07.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 7</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day08.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 8</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day09.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 9</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day10.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 10</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day11.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 11</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day12.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 12</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day13.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 13</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day14.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 14</span></a>
+  </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="../../2022/R/day15.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 15</span></a>
+  </div>
+</li>
+      </ul>
+  </li>
+    </ul>
+    </div>
+</nav>
+<div id="quarto-sidebar-glass" class="quarto-sidebar-collapse-item" data-bs-toggle="collapse" data-bs-target=".quarto-sidebar-collapse-item"></div>
+<!-- margin-sidebar -->
+    <div id="quarto-margin-sidebar" class="sidebar margin-sidebar">
+        <nav id="TOC" role="doc-toc" class="toc-active" data-toc-expanded="2">
+    <h2 id="toc-title">Contents</h2>
+   
+  <ul>
+  <li><a href="#setup" id="toc-setup" class="nav-link active" data-scroll-target="#setup">Setup</a></li>
+  <li><a href="#part-1" id="toc-part-1" class="nav-link" data-scroll-target="#part-1">Part 1</a></li>
+  </ul>
+<div class="toc-actions"><ul><li><a href="https://github.com/mimmackk/adventofcode/blob/main/2024/R/day19.qmd" class="toc-action"><i class="bi bi-github"></i>View source</a></li></ul></div></nav>
+    </div>
+<!-- main -->
+<main class="content" id="quarto-document-content">
+
+<header id="title-block-header" class="quarto-title-block default">
+<div class="quarto-title">
+<h1 class="title d-none d-lg-block">Day 19</h1>
+<p class="subtitle lead">Advent of Code: Worked Solutions</p>
+</div>
+
+
+
+<div class="quarto-title-meta">
+
+    <div>
+    <div class="quarto-title-meta-heading">About</div>
+    <div class="quarto-title-meta-contents">
+             <p><a href="https://adventofcode.com/2024/day/19">https://adventofcode.com/2024/day/19</a> </p>
+          </div>
+  </div>
+    
+    <div>
+    <div class="quarto-title-meta-heading">Date</div>
+    <div class="quarto-title-meta-contents">
+      <p class="date">December 19, 2024</p>
+    </div>
+  </div>
+  
+    
+  </div>
+  
+
+
+</header>
+
+
+<section id="setup" class="level2">
+<h2 class="anchored" data-anchor-id="setup">Setup</h2>
+<div class="cell">
+<div class="sourceCode cell-code" id="cb1"><pre class="sourceCode r code-with-copy"><code class="sourceCode r"><span id="cb1-1"><a href="#cb1-1" aria-hidden="true" tabindex="-1"></a><span class="co"># Libraries</span></span>
+<span id="cb1-2"><a href="#cb1-2" aria-hidden="true" tabindex="-1"></a><span class="fu">library</span>(tidyverse)</span>
+<span id="cb1-3"><a href="#cb1-3" aria-hidden="true" tabindex="-1"></a></span>
+<span id="cb1-4"><a href="#cb1-4" aria-hidden="true" tabindex="-1"></a><span class="co"># Read input from file</span></span>
+<span id="cb1-5"><a href="#cb1-5" aria-hidden="true" tabindex="-1"></a>available <span class="ot">&lt;-</span> <span class="fu">read_lines</span>(<span class="st">"../input/day19.txt"</span>, <span class="at">n_max =</span> <span class="dv">1</span>) <span class="sc">|&gt;</span> <span class="fu">str_split_1</span>(<span class="st">", "</span>)</span>
+<span id="cb1-6"><a href="#cb1-6" aria-hidden="true" tabindex="-1"></a>desired   <span class="ot">&lt;-</span> <span class="fu">read_lines</span>(<span class="st">"../input/day19.txt"</span>, <span class="at">skip =</span> <span class="dv">2</span>)</span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+</div>
+</section>
+<section id="part-1" class="level2">
+<h2 class="anchored" data-anchor-id="part-1">Part 1</h2>
+<div class="cell">
+<div class="sourceCode cell-code" id="cb2"><pre class="sourceCode r code-with-copy"><code class="sourceCode r"><span id="cb2-1"><a href="#cb2-1" aria-hidden="true" tabindex="-1"></a><span class="co"># Convert all possible available patterns into a regex string</span></span>
+<span id="cb2-2"><a href="#cb2-2" aria-hidden="true" tabindex="-1"></a>regex <span class="ot">&lt;-</span> <span class="fu">str_c</span>(<span class="st">"^("</span>, <span class="fu">str_c</span>(available, <span class="at">collapse =</span> <span class="st">"|"</span>), <span class="st">")+$"</span>)</span>
+<span id="cb2-3"><a href="#cb2-3" aria-hidden="true" tabindex="-1"></a></span>
+<span id="cb2-4"><a href="#cb2-4" aria-hidden="true" tabindex="-1"></a><span class="co"># Test each desired pattern for a regex match and count the number of matches</span></span>
+<span id="cb2-5"><a href="#cb2-5" aria-hidden="true" tabindex="-1"></a>desired <span class="sc">|&gt;</span> </span>
+<span id="cb2-6"><a href="#cb2-6" aria-hidden="true" tabindex="-1"></a>  <span class="fu">str_detect</span>(regex) <span class="sc">|&gt;</span> </span>
+<span id="cb2-7"><a href="#cb2-7" aria-hidden="true" tabindex="-1"></a>  <span class="fu">sum</span>()</span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
+<div class="cell-output cell-output-stdout">
+<pre><code>[1] 363</code></pre>
+</div>
+</div>
+
+
+</section>
+
+</main> <!-- /main -->
+<script id="quarto-html-after-body" type="application/javascript">
+window.document.addEventListener("DOMContentLoaded", function (event) {
+  const toggleBodyColorMode = (bsSheetEl) => {
+    const mode = bsSheetEl.getAttribute("data-mode");
+    const bodyEl = window.document.querySelector("body");
+    if (mode === "dark") {
+      bodyEl.classList.add("quarto-dark");
+      bodyEl.classList.remove("quarto-light");
+    } else {
+      bodyEl.classList.add("quarto-light");
+      bodyEl.classList.remove("quarto-dark");
+    }
+  }
+  const toggleBodyColorPrimary = () => {
+    const bsSheetEl = window.document.querySelector("link#quarto-bootstrap");
+    if (bsSheetEl) {
+      toggleBodyColorMode(bsSheetEl);
+    }
+  }
+  toggleBodyColorPrimary();  
+  const icon = "";
+  const anchorJS = new window.AnchorJS();
+  anchorJS.options = {
+    placement: 'right',
+    icon: icon
+  };
+  anchorJS.add('.anchored');
+  const isCodeAnnotation = (el) => {
+    for (const clz of el.classList) {
+      if (clz.startsWith('code-annotation-')) {                     
+        return true;
+      }
+    }
+    return false;
+  }
+  const onCopySuccess = function(e) {
+    // button target
+    const button = e.trigger;
+    // don't keep focus
+    button.blur();
+    // flash "checked"
+    button.classList.add('code-copy-button-checked');
+    var currentTitle = button.getAttribute("title");
+    button.setAttribute("title", "Copied!");
+    let tooltip;
+    if (window.bootstrap) {
+      button.setAttribute("data-bs-toggle", "tooltip");
+      button.setAttribute("data-bs-placement", "left");
+      button.setAttribute("data-bs-title", "Copied!");
+      tooltip = new bootstrap.Tooltip(button, 
+        { trigger: "manual", 
+          customClass: "code-copy-button-tooltip",
+          offset: [0, -8]});
+      tooltip.show();    
+    }
+    setTimeout(function() {
+      if (tooltip) {
+        tooltip.hide();
+        button.removeAttribute("data-bs-title");
+        button.removeAttribute("data-bs-toggle");
+        button.removeAttribute("data-bs-placement");
+      }
+      button.setAttribute("title", currentTitle);
+      button.classList.remove('code-copy-button-checked');
+    }, 1000);
+    // clear code selection
+    e.clearSelection();
+  }
+  const getTextToCopy = function(trigger) {
+      const codeEl = trigger.previousElementSibling.cloneNode(true);
+      for (const childEl of codeEl.children) {
+        if (isCodeAnnotation(childEl)) {
+          childEl.remove();
+        }
+      }
+      return codeEl.innerText;
+  }
+  const clipboard = new window.ClipboardJS('.code-copy-button:not([data-in-quarto-modal])', {
+    text: getTextToCopy
+  });
+  clipboard.on('success', onCopySuccess);
+  if (window.document.getElementById('quarto-embedded-source-code-modal')) {
+    const clipboardModal = new window.ClipboardJS('.code-copy-button[data-in-quarto-modal]', {
+      text: getTextToCopy,
+      container: window.document.getElementById('quarto-embedded-source-code-modal')
+    });
+    clipboardModal.on('success', onCopySuccess);
+  }
+    var localhostRegex = new RegExp(/^(?:http|https):\/\/localhost\:?[0-9]*\//);
+    var mailtoRegex = new RegExp(/^mailto:/);
+      var filterRegex = new RegExp('/' + window.location.host + '/');
+    var isInternal = (href) => {
+        return filterRegex.test(href) || localhostRegex.test(href) || mailtoRegex.test(href);
+    }
+    // Inspect non-navigation links and adorn them if external
+ 	var links = window.document.querySelectorAll('a[href]:not(.nav-link):not(.navbar-brand):not(.toc-action):not(.sidebar-link):not(.sidebar-item-toggle):not(.pagination-link):not(.no-external):not([aria-hidden]):not(.dropdown-item):not(.quarto-navigation-tool):not(.about-link)');
+    for (var i=0; i<links.length; i++) {
+      const link = links[i];
+      if (!isInternal(link.href)) {
+        // undo the damage that might have been done by quarto-nav.js in the case of
+        // links that we want to consider external
+        if (link.dataset.originalHref !== undefined) {
+          link.href = link.dataset.originalHref;
+        }
+      }
+    }
+  function tippyHover(el, contentFn, onTriggerFn, onUntriggerFn) {
+    const config = {
+      allowHTML: true,
+      maxWidth: 500,
+      delay: 100,
+      arrow: false,
+      appendTo: function(el) {
+          return el.parentElement;
+      },
+      interactive: true,
+      interactiveBorder: 10,
+      theme: 'quarto',
+      placement: 'bottom-start',
+    };
+    if (contentFn) {
+      config.content = contentFn;
+    }
+    if (onTriggerFn) {
+      config.onTrigger = onTriggerFn;
+    }
+    if (onUntriggerFn) {
+      config.onUntrigger = onUntriggerFn;
+    }
+    window.tippy(el, config); 
+  }
+  const noterefs = window.document.querySelectorAll('a[role="doc-noteref"]');
+  for (var i=0; i<noterefs.length; i++) {
+    const ref = noterefs[i];
+    tippyHover(ref, function() {
+      // use id or data attribute instead here
+      let href = ref.getAttribute('data-footnote-href') || ref.getAttribute('href');
+      try { href = new URL(href).hash; } catch {}
+      const id = href.replace(/^#\/?/, "");
+      const note = window.document.getElementById(id);
+      if (note) {
+        return note.innerHTML;
+      } else {
+        return "";
+      }
+    });
+  }
+  const xrefs = window.document.querySelectorAll('a.quarto-xref');
+  const processXRef = (id, note) => {
+    // Strip column container classes
+    const stripColumnClz = (el) => {
+      el.classList.remove("page-full", "page-columns");
+      if (el.children) {
+        for (const child of el.children) {
+          stripColumnClz(child);
+        }
+      }
+    }
+    stripColumnClz(note)
+    if (id === null || id.startsWith('sec-')) {
+      // Special case sections, only their first couple elements
+      const container = document.createElement("div");
+      if (note.children && note.children.length > 2) {
+        container.appendChild(note.children[0].cloneNode(true));
+        for (let i = 1; i < note.children.length; i++) {
+          const child = note.children[i];
+          if (child.tagName === "P" && child.innerText === "") {
+            continue;
+          } else {
+            container.appendChild(child.cloneNode(true));
+            break;
+          }
+        }
+        if (window.Quarto?.typesetMath) {
+          window.Quarto.typesetMath(container);
+        }
+        return container.innerHTML
+      } else {
+        if (window.Quarto?.typesetMath) {
+          window.Quarto.typesetMath(note);
+        }
+        return note.innerHTML;
+      }
+    } else {
+      // Remove any anchor links if they are present
+      const anchorLink = note.querySelector('a.anchorjs-link');
+      if (anchorLink) {
+        anchorLink.remove();
+      }
+      if (window.Quarto?.typesetMath) {
+        window.Quarto.typesetMath(note);
+      }
+      if (note.classList.contains("callout")) {
+        return note.outerHTML;
+      } else {
+        return note.innerHTML;
+      }
+    }
+  }
+  for (var i=0; i<xrefs.length; i++) {
+    const xref = xrefs[i];
+    tippyHover(xref, undefined, function(instance) {
+      instance.disable();
+      let url = xref.getAttribute('href');
+      let hash = undefined; 
+      if (url.startsWith('#')) {
+        hash = url;
+      } else {
+        try { hash = new URL(url).hash; } catch {}
+      }
+      if (hash) {
+        const id = hash.replace(/^#\/?/, "");
+        const note = window.document.getElementById(id);
+        if (note !== null) {
+          try {
+            const html = processXRef(id, note.cloneNode(true));
+            instance.setContent(html);
+          } finally {
+            instance.enable();
+            instance.show();
+          }
+        } else {
+          // See if we can fetch this
+          fetch(url.split('#')[0])
+          .then(res => res.text())
+          .then(html => {
+            const parser = new DOMParser();
+            const htmlDoc = parser.parseFromString(html, "text/html");
+            const note = htmlDoc.getElementById(id);
+            if (note !== null) {
+              const html = processXRef(id, note);
+              instance.setContent(html);
+            } 
+          }).finally(() => {
+            instance.enable();
+            instance.show();
+          });
+        }
+      } else {
+        // See if we can fetch a full url (with no hash to target)
+        // This is a special case and we should probably do some content thinning / targeting
+        fetch(url)
+        .then(res => res.text())
+        .then(html => {
+          const parser = new DOMParser();
+          const htmlDoc = parser.parseFromString(html, "text/html");
+          const note = htmlDoc.querySelector('main.content');
+          if (note !== null) {
+            // This should only happen for chapter cross references
+            // (since there is no id in the URL)
+            // remove the first header
+            if (note.children.length > 0 && note.children[0].tagName === "HEADER") {
+              note.children[0].remove();
+            }
+            const html = processXRef(null, note);
+            instance.setContent(html);
+          } 
+        }).finally(() => {
+          instance.enable();
+          instance.show();
+        });
+      }
+    }, function(instance) {
+    });
+  }
+      let selectedAnnoteEl;
+      const selectorForAnnotation = ( cell, annotation) => {
+        let cellAttr = 'data-code-cell="' + cell + '"';
+        let lineAttr = 'data-code-annotation="' +  annotation + '"';
+        const selector = 'span[' + cellAttr + '][' + lineAttr + ']';
+        return selector;
+      }
+      const selectCodeLines = (annoteEl) => {
+        const doc = window.document;
+        const targetCell = annoteEl.getAttribute("data-target-cell");
+        const targetAnnotation = annoteEl.getAttribute("data-target-annotation");
+        const annoteSpan = window.document.querySelector(selectorForAnnotation(targetCell, targetAnnotation));
+        const lines = annoteSpan.getAttribute("data-code-lines").split(",");
+        const lineIds = lines.map((line) => {
+          return targetCell + "-" + line;
+        })
+        let top = null;
+        let height = null;
+        let parent = null;
+        if (lineIds.length > 0) {
+            //compute the position of the single el (top and bottom and make a div)
+            const el = window.document.getElementById(lineIds[0]);
+            top = el.offsetTop;
+            height = el.offsetHeight;
+            parent = el.parentElement.parentElement;
+          if (lineIds.length > 1) {
+            const lastEl = window.document.getElementById(lineIds[lineIds.length - 1]);
+            const bottom = lastEl.offsetTop + lastEl.offsetHeight;
+            height = bottom - top;
+          }
+          if (top !== null && height !== null && parent !== null) {
+            // cook up a div (if necessary) and position it 
+            let div = window.document.getElementById("code-annotation-line-highlight");
+            if (div === null) {
+              div = window.document.createElement("div");
+              div.setAttribute("id", "code-annotation-line-highlight");
+              div.style.position = 'absolute';
+              parent.appendChild(div);
+            }
+            div.style.top = top - 2 + "px";
+            div.style.height = height + 4 + "px";
+            div.style.left = 0;
+            let gutterDiv = window.document.getElementById("code-annotation-line-highlight-gutter");
+            if (gutterDiv === null) {
+              gutterDiv = window.document.createElement("div");
+              gutterDiv.setAttribute("id", "code-annotation-line-highlight-gutter");
+              gutterDiv.style.position = 'absolute';
+              const codeCell = window.document.getElementById(targetCell);
+              const gutter = codeCell.querySelector('.code-annotation-gutter');
+              gutter.appendChild(gutterDiv);
+            }
+            gutterDiv.style.top = top - 2 + "px";
+            gutterDiv.style.height = height + 4 + "px";
+          }
+          selectedAnnoteEl = annoteEl;
+        }
+      };
+      const unselectCodeLines = () => {
+        const elementsIds = ["code-annotation-line-highlight", "code-annotation-line-highlight-gutter"];
+        elementsIds.forEach((elId) => {
+          const div = window.document.getElementById(elId);
+          if (div) {
+            div.remove();
+          }
+        });
+        selectedAnnoteEl = undefined;
+      };
+        // Handle positioning of the toggle
+    window.addEventListener(
+      "resize",
+      throttle(() => {
+        elRect = undefined;
+        if (selectedAnnoteEl) {
+          selectCodeLines(selectedAnnoteEl);
+        }
+      }, 10)
+    );
+    function throttle(fn, ms) {
+    let throttle = false;
+    let timer;
+      return (...args) => {
+        if(!throttle) { // first call gets through
+            fn.apply(this, args);
+            throttle = true;
+        } else { // all the others get throttled
+            if(timer) clearTimeout(timer); // cancel #2
+            timer = setTimeout(() => {
+              fn.apply(this, args);
+              timer = throttle = false;
+            }, ms);
+        }
+      };
+    }
+      // Attach click handler to the DT
+      const annoteDls = window.document.querySelectorAll('dt[data-target-cell]');
+      for (const annoteDlNode of annoteDls) {
+        annoteDlNode.addEventListener('click', (event) => {
+          const clickedEl = event.target;
+          if (clickedEl !== selectedAnnoteEl) {
+            unselectCodeLines();
+            const activeEl = window.document.querySelector('dt[data-target-cell].code-annotation-active');
+            if (activeEl) {
+              activeEl.classList.remove('code-annotation-active');
+            }
+            selectCodeLines(clickedEl);
+            clickedEl.classList.add('code-annotation-active');
+          } else {
+            // Unselect the line
+            unselectCodeLines();
+            clickedEl.classList.remove('code-annotation-active');
+          }
+        });
+      }
+  const findCites = (el) => {
+    const parentEl = el.parentElement;
+    if (parentEl) {
+      const cites = parentEl.dataset.cites;
+      if (cites) {
+        return {
+          el,
+          cites: cites.split(' ')
+        };
+      } else {
+        return findCites(el.parentElement)
+      }
+    } else {
+      return undefined;
+    }
+  };
+  var bibliorefs = window.document.querySelectorAll('a[role="doc-biblioref"]');
+  for (var i=0; i<bibliorefs.length; i++) {
+    const ref = bibliorefs[i];
+    const citeInfo = findCites(ref);
+    if (citeInfo) {
+      tippyHover(citeInfo.el, function() {
+        var popup = window.document.createElement('div');
+        citeInfo.cites.forEach(function(cite) {
+          var citeDiv = window.document.createElement('div');
+          citeDiv.classList.add('hanging-indent');
+          citeDiv.classList.add('csl-entry');
+          var biblioDiv = window.document.getElementById('ref-' + cite);
+          if (biblioDiv) {
+            citeDiv.innerHTML = biblioDiv.innerHTML;
+          }
+          popup.appendChild(citeDiv);
+        });
+        return popup.innerHTML;
+      });
+    }
+  }
+});
+</script>
+<nav class="page-navigation">
+  <div class="nav-page nav-page-previous">
+      <a href="../../2024/R/day18.html" class="pagination-link" aria-label="Day 18">
+        <i class="bi bi-arrow-left-short"></i> <span class="nav-page-text">Day 18</span>
+      </a>          
+  </div>
+  <div class="nav-page nav-page-next">
+      <a href="../../2022/R/day01.html" class="pagination-link" aria-label="Day 1">
+        <span class="nav-page-text">Day 1</span> <i class="bi bi-arrow-right-short"></i>
+      </a>
+  </div>
+</nav>
+</div> <!-- /content -->
+
+
+
+
+<footer class="footer"><div class="nav-footer"><div class="nav-footer-center"><div class="toc-actions d-sm-block d-md-none"><ul><li><a href="https://github.com/mimmackk/adventofcode/blob/main/2024/R/day19.qmd" class="toc-action"><i class="bi bi-github"></i>View source</a></li></ul></div></div></div></footer></body></html>
\ No newline at end of file
diff --git a/docs/index.html b/docs/index.html
index 475252f..24e6443 100644
--- a/docs/index.html
+++ b/docs/index.html
@@ -7,7 +7,7 @@
 <meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes">
 
 <meta name="author" content="https://adventofcode.com/about">
-<meta name="dcterms.date" content="2024-12-18">
+<meta name="dcterms.date" content="2024-12-19">
 
 <title>Advent of Code: Worked Solutions</title>
 <style>
@@ -215,6 +215,12 @@ <h1 class="quarto-secondary-nav-title">Advent of Code: Worked Solutions</h1>
   <a href="./2024/R/day18.html" class="sidebar-item-text sidebar-link">
  <span class="menu-text">Day 18</span></a>
   </div>
+</li>
+          <li class="sidebar-item">
+  <div class="sidebar-item-container"> 
+  <a href="./2024/R/day19.html" class="sidebar-item-text sidebar-link">
+ <span class="menu-text">Day 19</span></a>
+  </div>
 </li>
       </ul>
   </li>
@@ -350,7 +356,7 @@ <h1 class="title d-none d-lg-block">Advent of Code: Worked Solutions</h1>
     <div>
     <div class="quarto-title-meta-heading">Last Updated</div>
     <div class="quarto-title-meta-contents">
-      <p class="date">December 18, 2024</p>
+      <p class="date">December 19, 2024</p>
     </div>
   </div>
   
diff --git a/docs/search.json b/docs/search.json
index a28ece0..b4ddc7d 100644
--- a/docs/search.json
+++ b/docs/search.json
@@ -51,630 +51,652 @@
     ]
   },
   {
-    "objectID": "2024/R/day14.html",
-    "href": "2024/R/day14.html",
-    "title": "Day 14",
+    "objectID": "2024/R/day19.html",
+    "href": "2024/R/day19.html",
+    "title": "Day 19",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day14.txt\", skip_empty_rows = TRUE)\n\n# Parameters: dimensions of the room\nroom_w &lt;- 101\nroom_h &lt;- 103",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\navailable &lt;- read_lines(\"../input/day19.txt\", n_max = 1) |&gt; str_split_1(\", \")\ndesired   &lt;- read_lines(\"../input/day19.txt\", skip = 2)",
     "crumbs": [
       "2024",
-      "Day 14"
+      "Day 19"
     ]
   },
   {
-    "objectID": "2024/R/day14.html#setup",
-    "href": "2024/R/day14.html#setup",
-    "title": "Day 14",
+    "objectID": "2024/R/day19.html#setup",
+    "href": "2024/R/day19.html#setup",
+    "title": "Day 19",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day14.txt\", skip_empty_rows = TRUE)\n\n# Parameters: dimensions of the room\nroom_w &lt;- 101\nroom_h &lt;- 103",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\navailable &lt;- read_lines(\"../input/day19.txt\", n_max = 1) |&gt; str_split_1(\", \")\ndesired   &lt;- read_lines(\"../input/day19.txt\", skip = 2)",
     "crumbs": [
       "2024",
-      "Day 14"
+      "Day 19"
     ]
   },
   {
-    "objectID": "2024/R/day14.html#part-1",
-    "href": "2024/R/day14.html#part-1",
-    "title": "Day 14",
+    "objectID": "2024/R/day19.html#part-1",
+    "href": "2024/R/day19.html#part-1",
+    "title": "Day 19",
     "section": "Part 1",
-    "text": "Part 1\nExtract numerical values from input text:\n\ndf &lt;- input |&gt;\n  unglue_data(\"p={x},{y} v={vx},{vy}\") |&gt; \n  mutate(\n    across(everything(), parse_number),\n    robot_id = row_number(),\n    .before = everything()\n  )\n\nFor debugging: define a function to print the current state of the grid\n\nprint_grid &lt;- function(df, w = room_w, h = room_h) {\n  df |&gt; \n    summarize(n = as.character(n()), .by = c(x, y)) |&gt; \n    complete(\n      x = 0:(room_w - 1), \n      y = 0:(room_h - 1), \n      fill = list(n = \"\")\n    ) |&gt; \n    mutate(n = str_pad(n, width = max(str_length(n)), side = \"left\")) |&gt; \n    arrange(desc(y), x) |&gt; \n    group_split(y) |&gt; \n    map_chr(~ pull(.x, n) |&gt; str_c(collapse = \" \")) |&gt; \n    cat(sep = \"\\n\")\n}\n\nDefine a function which gives the location of the robots after n seconds. Multiply n by the velocity, add to the current position, and modulo the room dimensions.\n\npass_time &lt;- function(df, seconds, w = room_w, h = room_h) {\n  df |&gt; \n    mutate(\n      x = (x + vx * seconds) %% w,\n      y = (y + vy * seconds) %% h\n    )\n}\n\nDefine a function to get the current safety factor by counting the number of robots in each quadrant of the room:\n\nget_safety_score &lt;- function(df, w = room_w, h = room_h) {\n  mid_w &lt;- (room_w - 1) / 2\n  mid_h &lt;- (room_h - 1) / 2\n  \n  df |&gt; \n    mutate(\n      half_w = case_when(x &lt; mid_w ~ 0, x &gt; mid_w ~ 1),\n      half_h = case_when(y &lt; mid_h ~ 0, y &gt; mid_h ~ 1),\n      quadrant = half_w + 2 * half_h\n    ) |&gt; \n    drop_na(quadrant) |&gt; \n    summarize(num_robots = n(), .by = quadrant) |&gt; \n    pull(num_robots) |&gt; \n    prod()\n}\n\nCompute safety score of puzzle input:\n\ndf |&gt; \n  pass_time(100) |&gt; \n  get_safety_score()\n\n[1] 208437768",
-    "crumbs": [
-      "2024",
-      "Day 14"
-    ]
-  },
-  {
-    "objectID": "2024/R/day14.html#part-2",
-    "href": "2024/R/day14.html#part-2",
-    "title": "Day 14",
-    "section": "Part 2",
-    "text": "Part 2\nFirst, find the cycle of seconds where the robots’ positions repeat (no more than the least common multiple of the room width and room height)\n\ncycle &lt;- DescTools::LCM(room_w, room_h)\n\nFor each unique snapshot in the cycle, test for randomness vs structure in the X-Y coordinates.\n\nsimulations &lt;- map_dfr(\n  1:cycle,\n  \\(seconds) {\n    new &lt;- pass_time(df, seconds)\n    c(secs = seconds, xvar = var(new$x), yvar = var(new$y))\n  }\n)\n\nsimulations |&gt; \n  arrange(xvar, yvar, secs) |&gt; \n  filter(row_number() == 1) |&gt; \n  pull(secs)\n\n[1] 7492",
+    "text": "Part 1\n\n# Convert all possible available patterns into a regex string\nregex &lt;- str_c(\"^(\", str_c(available, collapse = \"|\"), \")+$\")\n\n# Test each desired pattern for a regex match and count the number of matches\ndesired |&gt; \n  str_detect(regex) |&gt; \n  sum()\n\n[1] 363",
     "crumbs": [
       "2024",
-      "Day 14"
+      "Day 19"
     ]
   },
   {
-    "objectID": "2024/R/day15.html",
-    "href": "2024/R/day15.html",
-    "title": "Day 15",
+    "objectID": "2024/R/day01.html",
+    "href": "2024/R/day01.html",
+    "title": "Day 1",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day15.txt\")\ninput_wh &lt;- keep(input, ~ str_detect(.x, \"#\"))\ninput_mv &lt;- keep(input, ~ str_detect(.x, \"&lt;|&gt;|\\\\^|v\"))",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\n  \"../input/day01.txt\", \n  col_names = c(\"x\", \"y\"), \n  show_col_types = FALSE\n)",
     "crumbs": [
       "2024",
-      "Day 15"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2024/R/day15.html#setup",
-    "href": "2024/R/day15.html#setup",
-    "title": "Day 15",
+    "objectID": "2024/R/day01.html#setup",
+    "href": "2024/R/day01.html#setup",
+    "title": "Day 1",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day15.txt\")\ninput_wh &lt;- keep(input, ~ str_detect(.x, \"#\"))\ninput_mv &lt;- keep(input, ~ str_detect(.x, \"&lt;|&gt;|\\\\^|v\"))",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\n  \"../input/day01.txt\", \n  col_names = c(\"x\", \"y\"), \n  show_col_types = FALSE\n)",
     "crumbs": [
       "2024",
-      "Day 15"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2024/R/day15.html#part-1",
-    "href": "2024/R/day15.html#part-1",
-    "title": "Day 15",
+    "objectID": "2024/R/day01.html#part-1",
+    "href": "2024/R/day01.html#part-1",
+    "title": "Day 1",
     "section": "Part 1",
-    "text": "Part 1\nConvert warehouse input to a row/column indexed dataframe\n\n# Convert WH input text to a matrix\nmtx &lt;- input_wh |&gt;\n  str_split(\"\") |&gt; \n  matrix() |&gt; \n  unlist() |&gt; \n  matrix(byrow = TRUE, nrow = length(input_wh))\n\n\n# Convert movement sequence to a seq of characters\nmove_seq &lt;- input_mv |&gt; \n  str_c(collapse = \"\") |&gt; \n  str_split_1(\"\")\n\nDefine function to update the map based on a single movement of the robot::\n\nmove_robot &lt;- function(mtx, dir) {\n  # Get the current coordinates of the robot\n  robot &lt;- which(mtx == \"@\", arr.ind = TRUE)\n  row &lt;- robot[1, \"row\"]\n  col &lt;- robot[1, \"col\"]\n  \n  # Define the range of matrix values to adjust according to the movement dir\n  row_end &lt;- case_match(dir, c(\"&lt;\", \"&gt;\") ~ row, \"^\" ~ 1, \"v\" ~ nrow(mtx))\n  col_end &lt;- case_match(dir, c(\"^\", \"v\") ~ col, \"&lt;\" ~ 1, \"&gt;\" ~ nrow(mtx))\n  \n  # Using obstacle logic, determine the set of new characters\n  new &lt;- tibble(\n    orig = mtx[row:row_end, col:col_end],\n    lag = lag(orig)\n  ) |&gt; \n    mutate(\n      is_empty = orig == \".\",\n      is_wall  = orig == \"#\",\n      is_blocked = accumulate(is_wall, `|`),\n      is_fillable = is_empty & !is_blocked,\n      first_fillable = is_fillable & !lag(accumulate(is_fillable, `|`)),\n      can_move = accumulate(first_fillable, `|`, .dir = \"backward\"),\n      new = if_else(can_move, coalesce(lag, \".\"), orig)\n    ) |&gt; \n    pull(new)\n  \n  # Replace the affected characters in the matrix and return\n  mtx[row:row_end, col:col_end] &lt;- new\n  return(mtx)\n}\n\nDefine a function to iteratively run the set of movements\n\nrun_simulation &lt;- function(mtx, move_seq) {\n  mtx_prv &lt;- mtx\n  for (dir in move_seq) {\n    mtx_new &lt;- move_robot(mtx_prv, dir)\n    mtx_prv &lt;- mtx_new\n  }\n  return(mtx_new)\n}\n\nDefine a function to determine the GPS coordinates of all boxes\n\nget_boxes_gps &lt;- function(mtx) {\n  which(mtx == \"O\", arr.ind = TRUE) |&gt; \n    as_tibble() |&gt; \n    mutate(\n      gps = 100 * (row - 1) + (col - 1)\n    ) |&gt; \n    pull(gps)\n}\n\nRun puzzle input:\n\nmtx |&gt; \n  run_simulation(move_seq) |&gt; \n  get_boxes_gps() |&gt;\n  sum()\n\n[1] 1457740",
+    "text": "Part 1\nSort each list independently, then sum the distances between each pair of ordered items.\n\ntibble(\n  x = sort(input$x), \n  y = sort(input$y),\n  dist = abs(y - x)\n) |&gt; \n  summarize(total = sum(dist)) |&gt; \n  pull()\n\n[1] 2285373",
     "crumbs": [
       "2024",
-      "Day 15"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2024/R/day15.html#part-2",
-    "href": "2024/R/day15.html#part-2",
-    "title": "Day 15",
+    "objectID": "2024/R/day01.html#part-2",
+    "href": "2024/R/day01.html#part-2",
+    "title": "Day 1",
     "section": "Part 2",
-    "text": "Part 2\nWiden the map:\n\n# Convert WH input text to a matrix\nmtx &lt;- input_wh |&gt; \n  str_replace_all(\"#\", \"##\") |&gt; \n  str_replace_all(\"O\", \"[]\") |&gt; \n  str_replace_all(\"\\\\.\", \"..\") |&gt; \n  str_replace_all(\"@\", \"@.\") |&gt;\n  str_split(\"\") |&gt; \n  matrix() |&gt; \n  unlist() |&gt; \n  matrix(byrow = TRUE, nrow = length(input_wh))\n\nDefine functions to move boxes around the map:\n\nget_box_coords &lt;- function(mtx, box_num) {\n  as_tibble(which(mtx == box_num, arr.ind = TRUE))\n}\n\nget_next_coords &lt;- function(cur_coords, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  cur_coords |&gt;\n    mutate(\n      row = row + case_match(dir, \"^\" ~ -1, \"v\" ~ 1, .default = 0),\n      col = col + case_match(dir, \"&lt;\" ~ -1, \"&gt;\" ~ 1, .default = 0),\n    )\n}\n\nget_next_chrs &lt;- function(mtx, cur_coords, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  # Pull the values of the next cells in the intended direction\n  cur_coords |&gt;\n    get_next_coords(dir) |&gt; \n    mutate(chr = map2_chr(row, col, ~ mtx[.x, .y])) |&gt; \n    anti_join(cur_coords, join_by(row, col)) |&gt; \n    pull(chr) |&gt; \n    unique()\n}\n\nis_blocked &lt;- function(mtx, box_num, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  \n  cur &lt;- get_box_coords(mtx, box_num)\n  nxt_chrs &lt;- get_next_chrs(mtx, cur, dir)\n  \n  # Test if the current box is completely blocked or completely free\n  if (any(nxt_chrs == '#')) \n    return(TRUE)\n  else if (all(nxt_chrs == '.')) \n    return(FALSE)\n  \n  # Recurse across all later boxes \n  nxt_chrs |&gt; \n    keep(~ str_detect(.x, \"^\\\\d+$\")) |&gt; \n    map_lgl(~ is_blocked(mtx, .x, dir)) |&gt; \n    any()\n}\n\nmove_box &lt;- function(mtx, box_num, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  # Get the coordinates of the current box and the place it'll move to\n  cur &lt;- get_box_coords(mtx, box_num)\n  nxt &lt;- get_next_coords(cur, dir)\n  \n  # Move all downstream boxes before moving self\n  next_boxes &lt;- get_next_chrs(mtx, cur, dir) |&gt; \n    keep(~ str_detect(.x, \"^\\\\d+$\"))\n  \n  for (box in next_boxes) {\n    mtx &lt;- move_box(mtx, box, dir)\n  }\n  \n  # # Replace the current coords with \".\" and the next coords with the box\n  mtx[cur$row, cur$col] &lt;- \".\"\n  mtx[nxt$row, nxt$col] &lt;- box_num\n  \n  return(mtx)\n}\n\nLoop through puzzle input:\n\nrun_simulation &lt;- function(mtx, move_seq) {\n  # Convert boxes from format \"[]\" into ID numbers unique to each box:\n  coords &lt;- list(l = which(mtx == \"[\"), r = which(mtx == \"]\"))\n  for (i in 1:length(coords$l)) {\n    mtx[coords$l[i]] &lt;- i\n    mtx[coords$r[i]] &lt;- i\n  }\n\n  # Loop through sequence of moves and apply to the map\n  mtx_prv &lt;- mtx\n  for (dir in move_seq) {\n    if (!is_blocked(mtx_prv, box_num = \"@\", dir = dir)) {\n      mtx_new &lt;- move_box(mtx_prv, box_num = \"@\", dir = dir)\n      mtx_prv &lt;- mtx_new\n    } \n  }\n  \n  return(mtx_new)\n}\n\noutput &lt;- run_simulation(mtx, move_seq)\n\nConvert the result to GPS coordinates:\n\noutput |&gt; \n  as_tibble() |&gt; \n  mutate(row = row_number(), .before = everything()) |&gt; \n  pivot_longer(\n    -row, \n    names_to = \"col\", \n    names_prefix = \"V\", \n    names_transform = as.integer\n  ) |&gt; \n  # Select only the leftmost cell of each boxes\n  filter(str_detect(value, \"\\\\d+\")) |&gt; \n  slice_min(col, by = value) |&gt; \n  mutate(\n    dist_top = row - 1,\n    dist_left = col - 1,\n    gps = 100 * dist_top + dist_left\n  ) |&gt; \n  pull(gps) |&gt; \n  sum()\n\n[1] 1467145",
+    "text": "Part 2\nFor each item in list x, multiply its value by its number of occurrences in list y, then sum the total.\n\ninput |&gt; \n  mutate(\n    x_match_count = map_int(x, ~ sum(.x == y)),\n    similarity_score = x * x_match_count\n  ) |&gt; \n  summarize(total = sum(similarity_score)) |&gt; \n  pull()\n\n[1] 21142653",
     "crumbs": [
       "2024",
-      "Day 15"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2024/R/day17.html",
-    "href": "2024/R/day17.html",
-    "title": "Day 17",
+    "objectID": "2024/R/day03.html",
+    "href": "2024/R/day03.html",
+    "title": "Day 3",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day17.txt\", skip_empty_rows = TRUE) |&gt; \n  unglue_data(patterns = c(\n    \"{label}: {value}\"\n  ))",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day03.txt\") |&gt; \n  str_c(collapse = \"\")",
     "crumbs": [
       "2024",
-      "Day 17"
+      "Day 3"
     ]
   },
   {
-    "objectID": "2024/R/day17.html#setup",
-    "href": "2024/R/day17.html#setup",
-    "title": "Day 17",
+    "objectID": "2024/R/day03.html#setup",
+    "href": "2024/R/day03.html#setup",
+    "title": "Day 3",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day17.txt\", skip_empty_rows = TRUE) |&gt; \n  unglue_data(patterns = c(\n    \"{label}: {value}\"\n  ))",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day03.txt\") |&gt; \n  str_c(collapse = \"\")",
     "crumbs": [
       "2024",
-      "Day 17"
+      "Day 3"
     ]
   },
   {
-    "objectID": "2024/R/day17.html#part-1",
-    "href": "2024/R/day17.html#part-1",
-    "title": "Day 17",
+    "objectID": "2024/R/day03.html#part-1",
+    "href": "2024/R/day03.html#part-1",
+    "title": "Day 3",
     "section": "Part 1",
-    "text": "Part 1\nInitialize the machine from the text input:\n\nprogram &lt;- input |&gt; \n  filter(label == \"Program\") |&gt; \n  pull(value) |&gt; \n  str_split_1(\",\") |&gt; \n  as.integer()\n\nA &lt;- input |&gt; \n  filter(label == \"Register A\") |&gt; \n  pull(value) |&gt; \n  as.integer()\n\nB &lt;- input |&gt; \n  filter(label == \"Register B\") |&gt; \n  pull(value) |&gt; \n  as.integer()\n\nC &lt;- input |&gt; \n  filter(label == \"Register C\") |&gt; \n  pull(value) |&gt; \n  as.integer()\n\nmachine &lt;- list(program = program, A = A, B = B, C = C, pointer = 0L, output = NULL)\n\nDefine machine’s helper functions:\n\ncombo &lt;- function(machine, operand) {\n  case_match(operand,\n    0 ~ 0,\n    1 ~ 1,\n    2 ~ 2,\n    3 ~ 3,\n    4 ~ machine$A,\n    5 ~ machine$B,\n    6 ~ machine$C\n   )\n}\n\nrun_opcode &lt;- function(machine, opcode, operand) {\n  func &lt;- case_match(opcode, \n    0 ~ \"adv\",\n    1 ~ \"bxl\",\n    2 ~ \"bst\",\n    3 ~ \"jnz\",\n    4 ~ \"bxc\",\n    5 ~ \"out\",\n    6 ~ \"bdv\",\n    7 ~ \"cdv\"\n  )\n  \n  get(func)(machine, operand)\n}\n\nrun_machine &lt;- function(machine) {\n  while (machine$pointer &lt; length(machine$program)) {\n    opcode  &lt;- machine$program[machine$pointer + 1]\n    operand &lt;- machine$program[machine$pointer + 2]\n    machine &lt;- run_opcode(machine, opcode, operand)\n  }\n  print(machine$output)\n}\n\nDefine the opcode functions:\n\nadv &lt;- function(machine, operand) {\n  machine$A &lt;- floor(machine$A / 2^combo(machine, operand))\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbxl &lt;- function(machine, operand) {\n  machine$B &lt;- bitwXor(machine$B, operand)\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbst &lt;- function(machine, operand) {\n  machine$B &lt;- combo(machine, operand) %% 8\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\njnz &lt;- function(machine, operand) {\n  if (machine$A != 0) \n    machine$pointer &lt;- operand\n  else \n    machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbxc &lt;- function(machine, operand) {\n  machine$B &lt;- bitwXor(machine$B, machine$C)\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nout &lt;- function(machine, operand) {\n  machine$output &lt;- str_c(\n    machine$output, \n    combo(machine, operand) %% 8, \n    sep = \",\"\n  )\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbdv &lt;- function(machine, operand) {\n  machine$B &lt;- floor(machine$A / 2^combo(machine, operand))\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\ncdv &lt;- function(machine, operand) {\n  machine$C &lt;- floor(machine$A / 2^combo(machine, operand))\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nRun on puzzle input:\n\nrun_machine(machine)\n\n[1] \"3,1,4,3,1,7,1,6,3\"",
+    "text": "Part 1\n\nuncorrupt &lt;- function(str) {\n  \n  str |&gt; \n    \n    # Extract all text of the format `mul(a,b)` where a, b are valid integers\n    str_extract_all(\"mul\\\\(\\\\d+,\\\\d+\\\\)\") |&gt; \n    unlist() |&gt; \n    \n    # Extract both integers from the mul sequences and multiply them together\n    str_extract_all(\"\\\\d+\") |&gt; \n    map(parse_number) |&gt; \n    map(reduce, prod) |&gt; \n    \n    # Sum up the total of all results\n    reduce(sum)\n  \n}\n\nuncorrupt(input)\n\n[1] 178538786",
     "crumbs": [
       "2024",
-      "Day 17"
+      "Day 3"
     ]
   },
   {
-    "objectID": "2024/R/day02.html",
-    "href": "2024/R/day02.html",
-    "title": "Day 2",
+    "objectID": "2024/R/day03.html#part-2",
+    "href": "2024/R/day03.html#part-2",
+    "title": "Day 3",
+    "section": "Part 2",
+    "text": "Part 2\n\n# Remove all text between `don't()` and `do()`, then uncorrupt the result\ninput |&gt; \n  str_remove_all(\"don't\\\\(\\\\).*?do\\\\(\\\\)\") |&gt;   \n  uncorrupt()\n\n[1] 102467299",
+    "crumbs": [
+      "2024",
+      "Day 3"
+    ]
+  },
+  {
+    "objectID": "2024/R/day16.html",
+    "href": "2024/R/day16.html",
+    "title": "Day 16",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day02.txt\") |&gt; \n  map(~parse_number(str_split_1(.x, \" \")))",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day16.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 2"
+      "Day 16"
     ]
   },
   {
-    "objectID": "2024/R/day02.html#setup",
-    "href": "2024/R/day02.html#setup",
-    "title": "Day 2",
+    "objectID": "2024/R/day16.html#setup",
+    "href": "2024/R/day16.html#setup",
+    "title": "Day 16",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day02.txt\") |&gt; \n  map(~parse_number(str_split_1(.x, \" \")))",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day16.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 2"
+      "Day 16"
     ]
   },
   {
-    "objectID": "2024/R/day02.html#part-1",
-    "href": "2024/R/day02.html#part-1",
-    "title": "Day 2",
+    "objectID": "2024/R/day16.html#part-1",
+    "href": "2024/R/day16.html#part-1",
+    "title": "Day 16",
     "section": "Part 1",
-    "text": "Part 1\n\n# Compute difference between consecutive integers\nseq_gaps &lt;- function(seq)\n  head(lead(seq) - seq, -1)\n\n# Check whether the sequence is incr/decr with gaps between 1 and 3\ngaps_are_valid &lt;- function(gaps)\n  (all(gaps &lt; 0) | all(gaps &gt; 0)) & all(between(abs(gaps), 1, 3))\n\n# Count number of safe reports\ninput |&gt; \n  map(seq_gaps) |&gt; \n  map_lgl(gaps_are_valid) |&gt; \n  sum()\n\n[1] 306",
+    "text": "Part 1\nConvert text input into a weighted, undirected graph\n\n# Convert input to a data frame\ndf &lt;- input |&gt; \n  str_split(\"\") |&gt; \n  unlist() |&gt; \n  as_tibble_col(column_name = \"cell\") |&gt; \n  mutate(\n    input_id  = row_number() - 1,\n    row = floor(input_id / length(input)),\n    col = floor(input_id %% length(input))\n  )\n\n# Convert borders between grid cells to graph vertices and map edges by cell\nborders &lt;- df |&gt; \n  mutate(border_e = (cell != \"#\" & lead(cell) != \"#\"), .by = row) |&gt; \n  mutate(border_s = (cell != \"#\" & lead(cell) != \"#\"), .by = col) |&gt; \n  mutate(\n    vtx_id_e = case_when(border_e ~ cumsum(border_e)),\n    vtx_id_s = case_when(border_s ~ cumsum(border_s) + max(vtx_id_e, na.rm = T))\n  ) |&gt; \n  mutate(vtx_id_n = lag(vtx_id_s), .by = col) |&gt; \n  mutate(vtx_id_w = lag(vtx_id_e), .by = row) |&gt; \n  mutate(\n    conn_ns = map2(vtx_id_n, vtx_id_s, ~ na.omit(c(.x, .y))),\n    conn_ew = map2(vtx_id_e, vtx_id_w, ~ na.omit(c(.x, .y))),\n    conn_ne = map2(vtx_id_n, vtx_id_e, ~ na.omit(c(.x, .y))),\n    conn_nw = map2(vtx_id_n, vtx_id_w, ~ na.omit(c(.x, .y))),\n    conn_se = map2(vtx_id_s, vtx_id_e, ~ na.omit(c(.x, .y))),\n    conn_sw = map2(vtx_id_s, vtx_id_w, ~ na.omit(c(.x, .y))),\n  )\n\n# Extract the list of all vertices\nvertices &lt;- c(borders$vtx_id_e, borders$vtx_id_s) |&gt; \n  na.omit() |&gt; \n  sort()\n\n# Convert vertices and edges to an adjacency matrix\nmtx &lt;- borders |&gt; \n  # Unnest lists of edge connections between vertices\n  select(starts_with(\"conn\")) |&gt; \n  pivot_longer(everything(), names_to = \"conn\", names_prefix = \"conn_\") |&gt; \n  unnest_wider(value, names_sep = \"_\") |&gt; \n  drop_na(value_1, value_2) |&gt; \n  # Rotations get an extra 1k added to the weight\n  mutate(weight = case_match(conn, c(\"ns\", \"ew\") ~ 1, .default = 1001)) |&gt; \n  select(-conn) |&gt; \n  # Convert to matrix format, where unconnected vertices have weight 0\n  complete(value_1 = vertices, value_2 = vertices, fill = list(weight = 0)) |&gt; \n  arrange(value_1, value_2) |&gt; \n  pivot_wider(names_from = value_2, values_from = weight) |&gt; \n  column_to_rownames(var = \"value_1\") |&gt; \n  as.matrix()\n\n# Make matrix symmetric (for an undirected graph)\nsym_mtx &lt;- pmax(mtx, t(mtx))\n\n# Convert adjacency matrix to a graph\ng &lt;- graph_from_adjacency_matrix(sym_mtx, mode = \"undirected\", weighted = TRUE)\n\nDetermine possible starting and ending locations from the input\n\nspecial_cells &lt;- borders |&gt; \n  filter(cell %in% c(\"S\", \"E\")) |&gt; \n  select(cell, starts_with(\"vtx_id\")) |&gt; \n  pivot_longer(\n    starts_with(\"vtx_id\"), \n    names_prefix = \"vtx_id_\",\n    names_to = \"dir\",\n    values_to = \"vertex\"\n  ) |&gt; \n  drop_na(vertex)\n\n# Create all combinations of start & end cell borders\ncombos &lt;- special_cells |&gt; \n  filter(cell == \"S\") |&gt; \n  mutate(\n    init_rotation = case_match(dir, \"e\" ~ 0, c(\"n\", \"s\") ~ 1, \"w\" ~ 2) * 1000\n  ) |&gt;\n  select(start_vertex = vertex, init_rotation) |&gt; \n  cross_join(\n    special_cells |&gt; \n      filter(cell == \"E\") |&gt; \n      select(end_vertex = vertex)\n  )\n\nFind the minimum path distance for each start/end vertex combo:\n\nmin_dist &lt;- combos |&gt; \n  mutate(\n    dist = map2_int(\n      start_vertex, \n      end_vertex, \n      ~ distances(g, .x, .y)) + init_rotation + 1\n  ) |&gt; \n  slice_min(dist)\n\nmin_dist |&gt; \n  pull(dist)\n\n[1] 102504",
     "crumbs": [
       "2024",
-      "Day 2"
+      "Day 16"
     ]
   },
   {
-    "objectID": "2024/R/day02.html#part-2",
-    "href": "2024/R/day02.html#part-2",
-    "title": "Day 2",
+    "objectID": "2024/R/day16.html#part-2",
+    "href": "2024/R/day16.html#part-2",
+    "title": "Day 16",
     "section": "Part 2",
-    "text": "Part 2\n\ntibble(input) |&gt; \n  \n  # For each report, create a set of versions where each level is removed\n  mutate(\n    id = row_number(),\n    mod = map(input, \\(seq) map(1:length(seq), \\(n) seq[-c(n)])),\n  ) |&gt; \n  unnest(mod) |&gt; \n  \n  # Check validity of each report and its altered versions\n  mutate(\n    report_is_safe = map_lgl(input, ~ gaps_are_valid(seq_gaps(.x))),\n    mod_is_safe    = map_lgl(mod,   ~ gaps_are_valid(seq_gaps(.x))),\n    is_safe = report_is_safe | mod_is_safe\n  ) |&gt; \n  summarize(is_safe = any(is_safe), .by = id) |&gt; \n  \n  # Count all safe reports\n  summarize(total = sum(is_safe)) |&gt; \n  pull()\n\n[1] 366",
+    "text": "Part 2\nPull all paths that have the minimum distance from start to end:\n\nshortest_paths &lt;- min_dist |&gt; \n  pmap(function(start_vertex, init_rotation, end_vertex, ...) {\n    all_shortest_paths(g, start_vertex, end_vertex)$vpaths\n  }) |&gt; \n  flatten() |&gt; \n  map(as.integer)\n\n\npath_vertices &lt;- shortest_paths |&gt; \n  unlist() |&gt; \n  unique() |&gt; \n  sort()\n\nCount all non-wall cells with a border in the shortest path vertex list:\n\nborders |&gt; \n  select(cell, input_id, starts_with(\"vtx_id\")) |&gt; \n  pivot_longer(starts_with(\"vtx_id\")) |&gt; \n  drop_na(value) |&gt; \n  filter(map_lgl(value, ~ .x %in% path_vertices)) |&gt; \n  filter(cell != \"#\") |&gt; \n  distinct(input_id) |&gt; \n  nrow()\n\n[1] 535",
     "crumbs": [
       "2024",
-      "Day 2"
+      "Day 16"
     ]
   },
   {
-    "objectID": "2024/R/day12.html",
-    "href": "2024/R/day12.html",
-    "title": "Day 12",
+    "objectID": "2024/R/day06.html",
+    "href": "2024/R/day06.html",
+    "title": "Day 6",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file into a data frame\ninput &lt;- read_table(\"../input/day12.txt\", col_names = \"chr\") |&gt; \n  mutate(\n    row = row_number(),\n    chr = str_split(chr, \"\")\n  ) |&gt; \n  unnest(chr) |&gt; \n  mutate(col = row_number(), .by = row) |&gt; \n  mutate(idx = row_number(), .before = everything())",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 12"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2024/R/day12.html#setup",
-    "href": "2024/R/day12.html#setup",
-    "title": "Day 12",
+    "objectID": "2024/R/day06.html#setup",
+    "href": "2024/R/day06.html#setup",
+    "title": "Day 6",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file into a data frame\ninput &lt;- read_table(\"../input/day12.txt\", col_names = \"chr\") |&gt; \n  mutate(\n    row = row_number(),\n    chr = str_split(chr, \"\")\n  ) |&gt; \n  unnest(chr) |&gt; \n  mutate(col = row_number(), .by = row) |&gt; \n  mutate(idx = row_number(), .before = everything())",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 12"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2024/R/day12.html#part-1",
-    "href": "2024/R/day12.html#part-1",
-    "title": "Day 12",
+    "objectID": "2024/R/day06.html#part-1",
+    "href": "2024/R/day06.html#part-1",
+    "title": "Day 6",
     "section": "Part 1",
-    "text": "Part 1\nFormat the input as a graph, with edges connecting neighbors of the same type:\n\n# Flag neighboring characters of the same value that border one other\nedges_wide &lt;- input |&gt; \n  mutate(v = case_when(row + 1 == lead(row) ~ lead(idx)), .by = c(chr, col)) |&gt; \n  mutate(h = case_when(col + 1 == lead(col) ~ lead(idx)), .by = c(chr, row))\n\nedges_long &lt;- edges_wide |&gt; \n  pivot_longer(\n    c(v, h), \n    names_to = NULL, \n    values_to = \"target\", \n    values_drop_na = TRUE\n  )\n\n# Format neighbors as a list of edges and add to add a graph\ng &lt;- edges_long |&gt; \n  transmute(\n    edge_id = row_number(),\n    src = idx, \n    target\n  ) |&gt; \n  pivot_longer(c(src, target)) |&gt; \n  arrange(edge_id, value) |&gt; \n  pull(value) |&gt; \n  make_graph(n = nrow(input), directed = FALSE)\n\nV(g)$name &lt;- 1:nrow(input)\n\n# Separate out the resulting graph into sub-graphs of innerconnected regions\ndg &lt;- decompose(g)\n\nCompute the perimeter, area, and cost of each subgraph then sum the total:\n\ndg |&gt; \n  map_int(\\(subgraph) {\n    perim &lt;- sum(4 - degree(subgraph))\n    area  &lt;- gorder(subgraph)\n    perim * area\n  }) |&gt; \n  sum()\n\n[1] 1433460",
+    "text": "Part 1\n\n# Guard functions --------------------------------------------------------------\nguards &lt;- c(\"^\", \"&gt;\", \"v\", \"&lt;\")\nguard_shift &lt;- c(tail(guards, -1), head(guards, 1))\n\nrotate_guard &lt;- function(cur) guard_shift[guards == cur]\n\nguard_dir &lt;- function(char) {\n  case_match(char,\n    \"^\" ~ matrix(c(-1,  0), nrow = 1),\n    \"&gt;\" ~ matrix(c( 0,  1), nrow = 1),\n    \"v\" ~ matrix(c( 1,  0), nrow = 1),\n    \"&lt;\" ~ matrix(c( 0, -1), nrow = 1)\n  )\n}\n\nin_bounds &lt;- function(coord, mtx) {\n  between(coord[1], 1, nrow(mtx)) & between(coord[2], 1, ncol(mtx))\n}\n\nmap_path &lt;- function(mtx) {\n\n  # Initiate guard's starting position and direction\n  cur_char  &lt;- keep(mtx, ~ .x %in% guards)\n  cur_coord &lt;- which(mtx == cur_char, arr.ind = TRUE)\n  cur_dir   &lt;- guard_dir(cur_char)\n  \n  # As long as the guard is in bounds, iteratively update its coords and direction\n  repeat {\n    next_coord &lt;- cur_coord + cur_dir\n    \n    # If next step is out-of-bounds, update matrix and exit\n    if (!in_bounds(next_coord, mtx)) {\n      mtx[cur_coord] &lt;- \"X\"\n      break\n    }\n    # If next step is an obstacle, rotate the guard\n    else if (mtx[next_coord] == '#') {\n      cur_char &lt;- rotate_guard(cur_char)\n      cur_dir  &lt;- guard_dir(cur_char)\n    }\n    # Otherwise advance the guard forward\n    else {\n      mtx[cur_coord] &lt;- \"X\"\n      cur_coord &lt;- next_coord\n    }\n  }\n  \n  mtx\n}\n\n\n# Convert input into a matrix\nmtx &lt;- input |&gt; \n  str_split(\"\") |&gt; \n  unlist() |&gt; \n  matrix(nrow = length(input), byrow = TRUE)\n\n# Map the guard's path\nguard_path &lt;- map_path(mtx)\n\n# Count distinct positions visited\nsum(guard_path == \"X\")",
     "crumbs": [
       "2024",
-      "Day 12"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2024/R/day12.html#part-2",
-    "href": "2024/R/day12.html#part-2",
-    "title": "Day 12",
+    "objectID": "2024/R/day06.html#part-2",
+    "href": "2024/R/day06.html#part-2",
+    "title": "Day 6",
     "section": "Part 2",
-    "text": "Part 2\nUsed a hint from reddit: the number of corners is equal to the number of sides.\nA plot can have a convex corner or a concave corner.\n\nA cell has a convex corner for each pair of adjacent borders\nA cell has a concave corner if it has two adjacent cells of its same group, but its diagonal cell between the two has a different group.\n\n\n# Get original row/column input and join on the group output from the graph\ngroups &lt;- left_join(\n  input,\n  imap_dfr(dg, \\(g, grp_idx) tibble(grp = grp_idx, idx = V(g)$name)),\n  join_by(idx)\n) |&gt; \n  select(idx, grp, row, col)\n\n# For each of a cell's neighbors, flag if they're in the same group\nneighbors &lt;- groups |&gt; \n  # Get group number of each adjacent cell (N/S/E/W)\n  left_join(transmute(groups, n = grp, row = row + 1, col), join_by(row, col)) |&gt; \n  left_join(transmute(groups, w = grp, col = col + 1, row), join_by(row, col)) |&gt; \n  left_join(transmute(groups, s = grp, row = row - 1, col), join_by(row, col)) |&gt; \n  left_join(transmute(groups, e = grp, col = col - 1, row), join_by(row, col)) |&gt; \n  # Get group number of each diagonal cell (NW/NE/SW/SE)\n  left_join(transmute(groups, nw = grp, row = row + 1, col = col + 1), join_by(row, col)) |&gt; \n  left_join(transmute(groups, ne = grp, row = row + 1, col = col - 1), join_by(row, col)) |&gt; \n  left_join(transmute(groups, sw = grp, row = row - 1, col = col + 1), join_by(row, col)) |&gt; \n  left_join(transmute(groups, se = grp, row = row - 1, col = col - 1), join_by(row, col)) |&gt; \n  select(-c(row, col)) |&gt; \n  # Compare group numbers of adjacent/diagonal cells to the current cell\n  mutate(across(c(n, w, s, e, nw, ne, sw, se), ~ replace_na(.x == grp, FALSE)))\n\n# Compute total number of concave/convex corners for each cell\ncorners &lt;- neighbors |&gt; \n  mutate(\n    convex = (!n & !w) + (!s & !w) + (!s & !e) + (!n & !e),\n    concave = (n & w & !nw) + (s & w & !sw) + (s & e & !se) + (n & e & !ne)\n  )\n\nTotal the number of corners per group and multiply by the group’s area to get the total cost:\n\ncorners |&gt; \n  summarize(\n    area = n(),\n    num_sides = sum(convex + concave), \n    .by = grp\n  ) |&gt; \n  mutate(cost = area * num_sides) |&gt; \n  pull(cost) |&gt; \n  sum()\n\n[1] 855082",
+    "text": "Part 2\nChange the path mapping function to test for loops\n\npath_loops &lt;- function(mtx) {\n\n  # Initiate guard's starting position and direction\n  cur_char  &lt;- keep(mtx, ~ .x %in% guards)\n  cur_coord &lt;- which(mtx == cur_char, arr.ind = TRUE)\n  cur_dir   &lt;- guard_dir(cur_char)\n  path_hist &lt;- matrix(\"\", nrow(mtx), ncol(mtx))\n\n  # As long as the guard is in bounds, iteratively update its coords and direction\n  repeat {\n    next_coord &lt;- cur_coord + cur_dir\n    \n    # Check if the guard is looping or if they have left the area\n    if (str_detect(path_hist[cur_coord], fixed(cur_char))) \n      return(TRUE)\n    else if (!in_bounds(next_coord, mtx)) \n      return(FALSE)\n    \n    # If next step is an obstacle, rotate the guard\n    else if (mtx[next_coord] == '#') {\n      # Update path history\n      path_hist[cur_coord] &lt;- str_c(path_hist[cur_coord], cur_char)\n      # Update guard\n      cur_char &lt;- rotate_guard(cur_char)\n      cur_dir  &lt;- guard_dir(cur_char)\n    }\n    # Otherwise advance the guard forward\n    else {\n      # Update path history\n      path_hist[cur_coord] &lt;- str_c(path_hist[cur_coord], cur_char)\n      # Update guard\n      cur_coord &lt;- next_coord\n    }\n  }\n}\n\n\n# Create a variation of the map for each possible obstacle location\nobstacles &lt;- which(guard_path == \"X\" & !(mtx %in% guards))\n\n# Test each obstacle location for loops and sum result\nobstacles |&gt; \n  map(~ replace(mtx, .x, \"#\")) |&gt; \n  map_lgl(path_loops) |&gt; \n  sum()",
     "crumbs": [
       "2024",
-      "Day 12"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2024/R/day07.html",
-    "href": "2024/R/day07.html",
-    "title": "Day 7",
+    "objectID": "2024/R/day13.html",
+    "href": "2024/R/day13.html",
+    "title": "Day 13",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split(\" \") |&gt; \n  map(parse_number)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day13.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 7"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2024/R/day07.html#setup",
-    "href": "2024/R/day07.html#setup",
-    "title": "Day 7",
+    "objectID": "2024/R/day13.html#setup",
+    "href": "2024/R/day13.html#setup",
+    "title": "Day 13",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split(\" \") |&gt; \n  map(parse_number)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day13.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 7"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2024/R/day07.html#part-1",
-    "href": "2024/R/day07.html#part-1",
-    "title": "Day 7",
+    "objectID": "2024/R/day13.html#part-1",
+    "href": "2024/R/day13.html#part-1",
+    "title": "Day 13",
     "section": "Part 1",
-    "text": "Part 1\nDefine calibration functions:\n\ncalibrate_operators &lt;- function(seq, target, operators) {\n  \n  # If the end of the list has been reached or the target is already overshot, exit\n  if (length(seq) == 1) \n    return(seq == target)\n  else if (seq[1] &gt; target)\n    return(FALSE)\n  \n  # Recursively compare the first two items of the seq using each operator\n  map_lgl(\n    operators,\n    \\(f) {\n      new_start &lt;- get(f)(seq[1], seq[2])\n      new_seq &lt;- c(new_start, tail(seq, -2))\n      calibrate_operators(new_seq, target, operators)\n    }\n  ) |&gt; \n    # If any output is true, the output has been calibrated.\n    any()\n}\n\ncalibration_value &lt;- function(input, output, operators) {\n  # Compute calibration for each input-output pair\n  is_calibrated &lt;- map2_lgl(\n    input, \n    output, \n    ~ calibrate_operators(.x, .y, operators = operators)\n  )\n  \n  # Sum the calibrated outputs\n  output |&gt; \n    keep(is_calibrated) |&gt; \n    sum() |&gt; \n    format(scientific = FALSE)\n}\n\nCompute calibration of the puzzle input:\n\ninput_values  &lt;- map(input, tail, -1)\noutput_values &lt;- map_dbl(input, head, 1)\n  \ncalibration_value(input_values, output_values, c(\"+\", \"*\"))\n\n[1] \"12940396350192\"",
+    "text": "Part 1\nExtract numerical values from input text:\n\ndf &lt;- input |&gt; \n  unglue_data(c(\n    \"Button {button}: X+{x=\\\\d+}, Y+{y=\\\\d+}\",\n    \"{button}: X={x=\\\\d+}, Y={y=\\\\d+}\"\n  )) |&gt; \n  mutate(\n    machine_id = floor((row_number() - 1) / 3),\n    across(c(x, y), parse_number),\n    .before = everything()\n  ) |&gt; \n  pivot_wider(names_from = button, values_from = c(x, y))\n\nDefine a function to convert numeric equation input and output token counts:\n\ncompute_tokens &lt;- function(df) {\n  \n  # Convert each machine's properties into a system of equations and solve.\n  soln &lt;- df |&gt; \n    nest(coeff = c(x_A, x_B, y_A, y_B)) |&gt; \n    nest(intercept = c(x_Prize, y_Prize)) |&gt; \n    mutate(\n      coeff = map(coeff, ~ matrix(as.numeric(.x), nrow = 2, byrow = TRUE)),\n      intercept = map(intercept, as.numeric),\n      soln = map2(\n        coeff, \n        intercept, \n        ~ solve(.x, .y) |&gt; \n          set_names(\"A\", \"B\") |&gt; \n          as_tibble_row()\n      )\n    ) |&gt; \n    unnest(soln) |&gt; \n    select(machine_id, A, B)\n  \n  \n  # Check that the solution is two whole numbers, then sum the token cost\n  soln |&gt; \n    mutate(\n      across(\n        c(A, B), \n        ~ near(.x, abs(round(.x)), tol = 0.001), \n        .names = \"{.col}_valid\"\n      ),\n      win = A_valid & B_valid,\n      tokens = if_else(win, 3 * A + B, 0)\n    ) |&gt; \n    pull(tokens) |&gt; \n    sum()\n}\n\nRun function on puzzle input:\n\ncompute_tokens(df)\n\n[1] 31623",
     "crumbs": [
       "2024",
-      "Day 7"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2024/R/day07.html#part-2",
-    "href": "2024/R/day07.html#part-2",
-    "title": "Day 7",
+    "objectID": "2024/R/day13.html#part-2",
+    "href": "2024/R/day13.html#part-2",
+    "title": "Day 13",
     "section": "Part 2",
-    "text": "Part 2\nAdd a new concatenation operator and re-run the calibration on the puzzle input\n\nconcat &lt;- function(x, y) as.numeric(str_c(x, y))\n\ncalibration_value(input_values, output_values, c(\"+\", \"*\", \"concat\"))\n\n[1] \"106016735664498\"",
+    "text": "Part 2\nAdd 10000000000000 to each prize intercept and re-compute:\n\ndf |&gt; \n  mutate(across(c(x_Prize, y_Prize), ~ .x + 10000000000000)) |&gt; \n  compute_tokens() |&gt; \n  format(scientific = FALSE)\n\n[1] \"93209116744825\"",
     "crumbs": [
       "2024",
-      "Day 7"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2024/R/day05.html",
-    "href": "2024/R/day05.html",
-    "title": "Day 5",
+    "objectID": "2024/R/day11.html",
+    "href": "2024/R/day11.html",
+    "title": "Day 11",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day05.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split_1(\" \") |&gt; \n  as.integer()",
     "crumbs": [
       "2024",
-      "Day 5"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2024/R/day05.html#setup",
-    "href": "2024/R/day05.html#setup",
-    "title": "Day 5",
+    "objectID": "2024/R/day11.html#setup",
+    "href": "2024/R/day11.html#setup",
+    "title": "Day 11",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day05.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split_1(\" \") |&gt; \n  as.integer()",
     "crumbs": [
       "2024",
-      "Day 5"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2024/R/day05.html#part-1",
-    "href": "2024/R/day05.html#part-1",
-    "title": "Day 5",
+    "objectID": "2024/R/day11.html#part-1",
+    "href": "2024/R/day11.html#part-1",
+    "title": "Day 11",
     "section": "Part 1",
-    "text": "Part 1\n\n# Extract page ordering rules from input\nrule_list &lt;- input |&gt; \n  keep(~ str_detect(.x, \"\\\\|\")) |&gt; \n  as_tibble_col(column_name = \"rule\") |&gt; \n  separate(rule, into = c(\"p1\", \"p2\")) |&gt; \n  mutate(rule_num = row_number(), .before = everything()) |&gt; \n  mutate(across(c(p1, p2), parse_number))\n\n# Extract page sequences from input\npages &lt;- input |&gt; \n  discard(~ str_detect(.x, \"\\\\|\")) |&gt; \n  str_split(\",\") |&gt; \n  map(parse_number) |&gt; \n  as_tibble_col(column_name = \"update\")\n\n# Sort a given vector by its applicable rules\nsort_by_rules &lt;- function(seq) {\n  active_rules &lt;- rule_list |&gt; \n    filter(p1 %in% seq & p2 %in% seq)\n  \n  repeat {\n    swap_occurred &lt;- FALSE\n    for (i in 1:nrow(active_rules)) {\n      rule &lt;- filter(active_rules, row_number() == i)\n      idx1 &lt;- which(seq == rule$p1)\n      idx2 &lt;- which(seq == rule$p2)\n      \n      if (idx1 &gt; idx2) {\n        seq[[idx1]] &lt;- rule$p2\n        seq[[idx2]] &lt;- rule$p1\n        swap_occurred &lt;- TRUE\n      }\n    }\n    if (!swap_occurred) return(seq)\n  }\n}\n\n# Sort all page sequences and extract the center page of each result\noutput &lt;- pages |&gt; \n  mutate(\n    resorted = map(update, sort_by_rules),\n    is_sorted = map2_lgl(update, resorted, identical),\n    center_page = map_int(resorted, ~ .x[(length(.x) + 1) / 2])\n  )\n\n\n# For the properly-ordered updates, sum the center page numbers\noutput |&gt;\n  filter(is_sorted) |&gt; \n  pull(center_page) |&gt; \n  sum()\n\n[1] 6505",
+    "text": "Part 1\nCreate blink functions:\n\nblink &lt;- function(x) {\n  char &lt;- format(x, scientific = FALSE)\n  n &lt;- str_length(char)\n  \n  if (x == 0) \n    1\n  else if (n %% 2 == 0)\n    parse_number(c(\n      str_sub(char, 1, n / 2),\n      str_sub(char, n / 2 + 1, n)\n    ))\n  else \n    x * 2024\n}\n\nblink_n &lt;- function(df, n) {\n  if (n == 0)\n    return(sum(df$n))\n  \n  df |&gt; \n    mutate(stones = map(stones, blink)) |&gt; \n    unnest(stones) |&gt; \n    summarize(n = sum(n), .by = stones) |&gt; \n    blink_n(n - 1)\n}\n\nRun blink function 25 times on puzzle input:\n\ndf &lt;- tibble(stones = input, n = 1)\n\nblink_n(df, 25)\n\n[1] 193899",
     "crumbs": [
       "2024",
-      "Day 5"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2024/R/day05.html#part-2",
-    "href": "2024/R/day05.html#part-2",
-    "title": "Day 5",
+    "objectID": "2024/R/day11.html#part-2",
+    "href": "2024/R/day11.html#part-2",
+    "title": "Day 11",
     "section": "Part 2",
-    "text": "Part 2\n\n# For the improperly-ordered updates, sum their sorted center pages\noutput |&gt;\n  filter(!is_sorted) |&gt; \n  pull(center_page) |&gt; \n  sum()\n\n[1] 6897",
+    "text": "Part 2\nRun blink function 75 times on puzzle input:\n\nblink_n(df, 75) |&gt; \n  format(scientific = FALSE)\n\n[1] \"229682160383225\"",
     "crumbs": [
       "2024",
-      "Day 5"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2024/R/day10.html",
-    "href": "2024/R/day10.html",
-    "title": "Day 10",
+    "objectID": "2024/R/day04.html",
+    "href": "2024/R/day04.html",
+    "title": "Day 4",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day10.txt\", skip_empty_rows = TRUE)\n\n# Convert input to matrix format\nmtx &lt;- input |&gt; \n  str_split(\"\") |&gt;\n  unlist() |&gt; \n  as.integer() |&gt; \n  matrix(nrow = length(input), byrow = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day04.txt\")",
     "crumbs": [
       "2024",
-      "Day 10"
+      "Day 4"
     ]
   },
   {
-    "objectID": "2024/R/day10.html#setup",
-    "href": "2024/R/day10.html#setup",
-    "title": "Day 10",
+    "objectID": "2024/R/day04.html#setup",
+    "href": "2024/R/day04.html#setup",
+    "title": "Day 4",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day10.txt\", skip_empty_rows = TRUE)\n\n# Convert input to matrix format\nmtx &lt;- input |&gt; \n  str_split(\"\") |&gt;\n  unlist() |&gt; \n  as.integer() |&gt; \n  matrix(nrow = length(input), byrow = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day04.txt\")",
     "crumbs": [
       "2024",
-      "Day 10"
+      "Day 4"
     ]
   },
   {
-    "objectID": "2024/R/day10.html#part-1",
-    "href": "2024/R/day10.html#part-1",
-    "title": "Day 10",
+    "objectID": "2024/R/day04.html#part-1",
+    "href": "2024/R/day04.html#part-1",
+    "title": "Day 4",
     "section": "Part 1",
-    "text": "Part 1\nDefine custom functions:\n\n# North / South / East / West\ndirs &lt;- list(c(0,  1), c(0, -1), c(1,  0), c(-1,  0))\n\n# Check if a coordinate is in the bounds of the map\nin_bounds &lt;- function(x, map) {\n  between(x[1], 1, nrow(map)) & between(x[2], 1, ncol(map))\n}\n\nfind_trail_ends &lt;- function(cur_coord, map) {\n  \n  # If the trailhead has been reached, return its coordinate.\n  if (map[cur_coord] == 9)\n    return(list(cur_coord))\n  \n  # Define the possible next steps within the map bounds\n  next_steps &lt;- dirs |&gt; \n    map(~ cur_coord + .x) |&gt; \n    keep(~ in_bounds(.x, map))\n  \n  trail_ends &lt;- list()\n  \n  # If the next step leads to a valid path, add its terminal to the list\n  for (next_coord in next_steps) {\n    if (map[next_coord] == map[cur_coord] + 1) \n      trail_ends &lt;- c(trail_ends, find_trail_ends(next_coord, map))\n  }\n  \n  return(unique(trail_ends))\n}\n\nscore_trail &lt;- function(trailhead, map) length(find_trail_ends(trailhead, map))\n\n\n# Get a list of coordinates of all of the trailheads\ntrailheads &lt;- which(mtx == 0, arr.ind = TRUE)\ntrailheads_list &lt;- map(\n  1:nrow(trailheads), \n  ~ array(trailheads[.x,], dim = c(1, 2))\n)\n\n# Score each trailhead and sum the total\ntrailheads_list |&gt; \n  map_int(~ score_trail(.x, mtx)) |&gt; \n  sum()\n\n[1] 531",
+    "text": "Part 1\n\n# Convert vector of text to matrix\ntxt_to_mtx &lt;- function(txt) {\n  txt |&gt; \n    str_split(\"\") |&gt; \n    unlist() |&gt; \n    matrix(nrow = length(txt), byrow = TRUE)\n}\n\n# Convert matrix to vector of text\nmtx_to_txt &lt;- function(mtx) {\n  mtx |&gt; \n    t() |&gt; \n    as_tibble() |&gt; \n    as.list() |&gt; \n    map(str_flatten) |&gt; \n    unlist() |&gt; \n    unname()\n}\n\n# Transpose a vector of text\ntranspose_txt &lt;- function(txt) {\n  txt |&gt; \n    txt_to_mtx() |&gt; \n    t() |&gt; \n    mtx_to_txt()\n}\n\n# Get rows and columns of input as individual text vectors\nrows &lt;- input\ncols &lt;- transpose_txt(rows)\n\n# Convert diagonals of input as individual text vectors\npad &lt;- map_chr(\n  1:length(rows), \n  ~ str_c(rep_len(\" \", .x - 1), collapse = \"\")\n)\n\ndiag1 &lt;- str_c(pad, rows, rev(pad)) |&gt; \n  transpose_txt()\ndiag2 &lt;- str_c(rev(pad), rows, pad) |&gt; \n  transpose_txt()\n\n# Loop over rows, columns, and diagnoals and count occurrences of \"XMAS\"\nmap_int(\n  list(rows, cols, diag1, diag2),\n  ~ sum(str_count(.x, \"XMAS\") + str_count(.x, \"SAMX\"))\n) |&gt; \n  sum()\n\n[1] 2599",
     "crumbs": [
       "2024",
-      "Day 10"
+      "Day 4"
     ]
   },
   {
-    "objectID": "2024/R/day10.html#part-2",
-    "href": "2024/R/day10.html#part-2",
-    "title": "Day 10",
+    "objectID": "2024/R/day04.html#part-2",
+    "href": "2024/R/day04.html#part-2",
+    "title": "Day 4",
     "section": "Part 2",
-    "text": "Part 2\nModify the trail rating function:\n\nrate_trail &lt;- function(cur_coord, map) {\n  # If the trailhead has been reached, increment the score and exit.\n  if (map[cur_coord] == 9)\n    return(1)\n  \n  # Define the possible next steps within the map bounds\n  next_steps &lt;- dirs |&gt; \n    map(~ cur_coord + .x) |&gt; \n    keep(~ in_bounds(.x, map))\n  \n  # Sum the trail ratings of all valid next steps\n  map_int(\n    next_steps,\n    ~ if (map[.x] == map[cur_coord] + 1) rate_trail(.x, map) else 0\n  ) |&gt; \n    sum()\n}\n\nRe-run the puzzle input:\n\ntrailheads_list |&gt; \n  map_int(~ rate_trail(.x, mtx)) |&gt; \n  sum()\n\n[1] 1210",
+    "text": "Part 2\n\n# Define the four possible XMAS patterns in a 3x3 grid as a regex string\nxmas1 &lt;- \"M.S.A.M.S\"\nxmas4 &lt;- \"S.M.A.S.M\"\nxmas2 &lt;- \"S.S.A.M.M\"\nxmas3 &lt;- \"M.M.A.S.S\"\nxmas_regex &lt;- glue::glue(\"{xmas1}|{xmas2}|{xmas3}|{xmas4}\")\n\n# Convert input into a matrix\nmtx &lt;- txt_to_mtx(input)\n\n# Extract every 3x3 submatrix in the input text block as a text string\nmap(\n  1:(nrow(mtx) - 2),\n  function(row_start) {\n    map_chr(\n      1:(ncol(mtx) - 2),\n      function(col_start) {\n        mtx[row_start:(row_start + 2), col_start:(col_start + 2)] |&gt; \n          mtx_to_txt() |&gt; \n          str_flatten()\n      }\n    )\n  }\n) |&gt; \n  unlist() |&gt; \n  \n  # Count the text strings with a valid XMAS pattern\n  str_detect(xmas_regex) |&gt; \n  sum()\n\n[1] 1948",
     "crumbs": [
       "2024",
-      "Day 10"
+      "Day 4"
     ]
   },
   {
-    "objectID": "2022/R/day08.html",
-    "href": "2022/R/day08.html",
-    "title": "Day 8",
+    "objectID": "2022/R/day09.html",
+    "href": "2022/R/day09.html",
+    "title": "Day 9",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file and format as a matrix\ninput &lt;- read_fwf(\"../input/day08.txt\") |&gt; \n  transmute(x = str_split(X1, \"\")) |&gt;\n  unnest_wider(x, names_sep = \"\") |&gt;\n  mutate(across(everything(), as.integer)) |&gt;\n  as.matrix()",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(ctmle, include.only = \"bound\")\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day09.txt\") |&gt;\n  str_split(\" \")",
     "crumbs": [
       "2022",
-      "Day 8"
+      "Day 9"
     ]
   },
   {
-    "objectID": "2022/R/day08.html#setup",
-    "href": "2022/R/day08.html#setup",
-    "title": "Day 8",
+    "objectID": "2022/R/day09.html#setup",
+    "href": "2022/R/day09.html#setup",
+    "title": "Day 9",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file and format as a matrix\ninput &lt;- read_fwf(\"../input/day08.txt\") |&gt; \n  transmute(x = str_split(X1, \"\")) |&gt;\n  unnest_wider(x, names_sep = \"\") |&gt;\n  mutate(across(everything(), as.integer)) |&gt;\n  as.matrix()",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(ctmle, include.only = \"bound\")\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day09.txt\") |&gt;\n  str_split(\" \")",
     "crumbs": [
       "2022",
-      "Day 8"
+      "Day 9"
     ]
   },
   {
-    "objectID": "2022/R/day08.html#parts-1-2",
-    "href": "2022/R/day08.html#parts-1-2",
-    "title": "Day 8",
-    "section": "Parts 1 & 2",
-    "text": "Parts 1 & 2\n\n# Create df with one row per tree and variables for its containing row & col\nexpand_grid(\n  col_pos = 1:nrow(input),\n  row_pos = 1:ncol(input)\n) |&gt;\n  mutate(\n    tree_idx = row_number(),\n    row_list = map(col_pos, ~ unname(as.matrix(input)[.x, ])),\n    col_list = map(row_pos, ~ unname(as.matrix(input)[, .x])),\n  ) |&gt;\n\n  # For each tree, construct its treeline looking outward in each direction\n  pivot_longer(\n    c(col_pos, row_pos, col_list, row_list),\n    names_to = c(\"axis\", \".value\"),\n    names_sep = \"_\"\n  ) |&gt;\n  mutate(\n    split = map2(\n      list,\n      pos,\n      ~ split(.x, c(rep(\"bwd\", .y - 1), \"curr_tree\", rep(\"fwd\", length(.x) - .y)))\n    )\n  ) |&gt;\n  unnest_wider(split) |&gt;\n  mutate(bwd = map(bwd, rev)) |&gt;\n  pivot_longer(c(fwd, bwd), names_to = \"dir\", values_to = \"treeline\") |&gt;\n\n  # Check if each is the tallest tree in each direction & count visible trees\n  mutate(\n    is_tallest = map2_lgl(curr_tree, treeline, ~ all(.x &gt; .y)),\n    num_visible = map2_int(curr_tree, treeline, function(curr_tree, treeline) {\n      ifelse(\n        every(treeline, ~.x &lt; curr_tree),\n        length(treeline),\n        detect_index(treeline, ~ .x &gt;= curr_tree)\n      )\n    })\n  ) |&gt;\n\n  # Summarize visibility & scenic scores from all 4 directions for each tree\n  group_by(tree_idx) |&gt;\n  summarize(\n    is_visible = any(is_tallest),\n    scenic_score = prod(num_visible)\n  ) |&gt;\n  ungroup() |&gt;\n\n  # Compute total trees visible from forest edge & max scenic score in forest\n  summarize(\n    total_visible = sum(is_visible),\n    max_scenic_score = max(scenic_score)\n  )\n\n# A tibble: 1 × 2\n  total_visible max_scenic_score\n          &lt;int&gt;            &lt;dbl&gt;\n1          1690           535680",
+    "objectID": "2022/R/day09.html#part-1",
+    "href": "2022/R/day09.html#part-1",
+    "title": "Day 9",
+    "section": "Part 1",
+    "text": "Part 1\n\n# Convert head movements to sequence of locations on complex plane\nhead_path &lt;- input |&gt;\n  map(~ rep(.x[[1]], .x[[2]])) |&gt;\n  reduce(c) |&gt;\n  recode(\"R\" = 1 + 0i, \"L\" = -1 + 0i, \"U\" = 0 + 1i, \"D\" = 0 - 1i) |&gt;\n  accumulate(.init = 0 + 0i, .f = sum)\n\n# Find path of next knot given path of previous knot.\nmove_next_knot &lt;- function(prev_knot_path) {\n  accumulate(\n    .x = prev_knot_path,\n    .f = function(tail = .x, head = .y) {\n      diff &lt;- head - tail\n      if_else(\n        max(abs(Re(diff)), abs(Im(diff))) &lt;= 1,\n        tail,\n        tail + bound(Re(diff), c(-1, 1)) + bound(Im(diff), c(-1, 1)) * 1i\n      )\n    }\n  )\n}\n\n\nunique_tail_spots &lt;- function(path, num_knots) {\n  # Iteratively compute path of each knot from head & to tail\n  move_tail &lt;- reduce(map(1:(num_knots - 1), ~ move_next_knot), compose)\n\n  # Find number of unique locations in the tail's path\n  length(unique(move_tail(path)))\n}\n\n\nunique_tail_spots(head_path, num_knots = 2)\n\n[1] 6197",
     "crumbs": [
       "2022",
-      "Day 8"
+      "Day 9"
     ]
   },
   {
-    "objectID": "2022/R/day01.html",
-    "href": "2022/R/day01.html",
-    "title": "Day 1",
+    "objectID": "2022/R/day09.html#part-2",
+    "href": "2022/R/day09.html#part-2",
+    "title": "Day 9",
+    "section": "Part 2",
+    "text": "Part 2\n\nunique_tail_spots(head_path, num_knots = 10)\n\n[1] 2562",
+    "crumbs": [
+      "2022",
+      "Day 9"
+    ]
+  },
+  {
+    "objectID": "2022/R/day14.html",
+    "href": "2022/R/day14.html",
+    "title": "Day 14",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day01.txt\") |&gt; \n  as.integer()",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from text\ninput &lt;- read_lines(\"../input/day14.txt\")",
     "crumbs": [
       "2022",
-      "Day 1"
+      "Day 14"
     ]
   },
   {
-    "objectID": "2022/R/day01.html#setup",
-    "href": "2022/R/day01.html#setup",
-    "title": "Day 1",
+    "objectID": "2022/R/day14.html#setup",
+    "href": "2022/R/day14.html#setup",
+    "title": "Day 14",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day01.txt\") |&gt; \n  as.integer()",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from text\ninput &lt;- read_lines(\"../input/day14.txt\")",
     "crumbs": [
       "2022",
-      "Day 1"
+      "Day 14"
     ]
   },
   {
-    "objectID": "2022/R/day01.html#part-1",
-    "href": "2022/R/day01.html#part-1",
-    "title": "Day 1",
+    "objectID": "2022/R/day14.html#part-1",
+    "href": "2022/R/day14.html#part-1",
+    "title": "Day 14",
     "section": "Part 1",
-    "text": "Part 1\n\n# Format input as a data frame and number the elves\ndf &lt;- tibble(\n  cal = input,\n  elf_id = cumsum(is.na(cal)) + 1\n) |&gt;\n  filter(!is.na(cal))\n\n# Compute calorie sum for each elf, get the top n elves, and combine totals\ncount_max &lt;- function(df, num_top_elves) {\n  df |&gt; \n    group_by(elf_id) |&gt;\n    summarize(total_cal = sum(cal)) |&gt;\n    slice_max(total_cal, n = num_top_elves) |&gt;\n    pull(total_cal) |&gt;\n    sum()\n}\n\nRun puzzle input:\n\ncount_max(df, 1)\n\n[1] 68787",
+    "text": "Part 1\nConvert input from rows of text lines to a list of obstacle coordinates:\n\n# Extract numeric values from the input text\ndf &lt;- input |&gt; \n  str_split(\" -&gt; \") |&gt; \n  imap_dfr(\\(input, idx) tibble(idx, input)) |&gt; \n  unglue_unnest(input, \"{x},{y}\", convert = TRUE)\n\n\n# Expand the endpoints into a list of coordinates of every obstacle\nobstacles &lt;- df |&gt; \n  mutate(\n    seq_x = map2(x, lead(x), ~ if (!is.na(.x) & !is.na(.y)) .x:.y),\n    seq_y = map2(y, lead(y), ~ if (!is.na(.x) & !is.na(.y)) .x:.y),\n    .by = idx\n  ) |&gt; \n  unnest(c(seq_x, seq_y)) |&gt; \n  distinct(x = seq_x, y = seq_y) |&gt; \n  mutate(chr = '#')\n\nDefine a function to recursively drop a grain of sand until it comes to rest:\n\ndrop_grain &lt;- function(scan, x_cur, y_cur) {\n  y_new &lt;- y_cur + 1\n  \n  # Check if new y-coordinate is out of bounds\n  if (y_new &gt; max(scan$y))\n    return(scan)\n  \n  for (x_new in c(x_cur, x_cur - 1, x_cur + 1)) {\n    # Check if next x-coordinate is out of bounds\n    if (!between(x_new, min(scan$x), max(scan$x)))\n      return(scan)\n    # If grain can flow into the next spot, recurse into next spot\n    else if (nrow(filter(scan, x == x_new, y == y_new)) == 0)\n      return(drop_grain(scan, x_new, y_new))\n  }\n\n  # If grain has nowhere to go, drop the grain in its current place and exit\n  return(add_row(scan, x = x_cur, y = y_cur, chr = \"o\"))\n}\n\nDefine a function that fills the map with sand one grain at a time, starting from the designated point, until all sand comes to rest:\n\nfill_sand &lt;- function(scan, grain_func) {\n  repeat {\n    scan_new &lt;- grain_func(scan)\n    \n    # If the scan is unchanged after dropping the grain, the sand is at rest. \n    if (nrow(scan_new) == nrow(scan)) break\n    \n    scan &lt;- scan_new\n  }\n  scan\n}\n\ncount_grains &lt;- function(scan) {\n  scan |&gt; \n    filter(chr == \"o\") |&gt; \n    nrow()\n}\n\nCount the grains using the puzzle input:\n\nobstacles |&gt; \n  fill_sand(grain_func = partial(drop_grain, x_cur = 500, y_cur = 0)) |&gt; \n  count_grains()\n\n[1] 862",
     "crumbs": [
       "2022",
-      "Day 1"
+      "Day 14"
     ]
   },
   {
-    "objectID": "2022/R/day01.html#part-2",
-    "href": "2022/R/day01.html#part-2",
-    "title": "Day 1",
+    "objectID": "2022/R/day14.html#part-2",
+    "href": "2022/R/day14.html#part-2",
+    "title": "Day 14",
     "section": "Part 2",
-    "text": "Part 2\n\ncount_max(df, 3)\n\n[1] 198041",
+    "text": "Part 2\nRe-define the drop_grain function to allow for the boundless floor:\n\ndrop_grain &lt;- function(scan, x_cur, y_cur, floor) {\n  y_new &lt;- y_cur + 1\n  \n  # Check if current location already has a grain of sand (entry blocked)\n  if (nrow(filter(scan, x == x_cur, y == y_cur)) &gt; 0)\n    return(scan)\n  \n  # Check if the current sand grain is sitting on top of the floor\n  if (y_new == floor)\n    return(add_row(scan, x = x_cur, y = y_cur, chr = \"o\"))\n  \n  # If grain can flow into the next spot, recurse into next spot\n  for (x_new in c(x_cur, x_cur - 1, x_cur + 1)) {\n    if (nrow(filter(scan, x == x_new, y == y_new)) == 0)\n      return(drop_grain(scan, x_new, y_new, floor))\n  }\n\n  # If grain has nowhere to go, drop the grain in its current place and exit\n  return(add_row(scan, x = x_cur, y = y_cur, chr = \"o\"))\n}\n\nCount the grains using the puzzle input:\n\nobstacles |&gt; \n  fill_sand(\n    grain_func = partial(\n      drop_grain, \n      x_cur = 500, \n      y_cur = 0, \n      floor = max(obstacles$y) + 2\n    )\n  ) |&gt; \n  count_grains()\n\n[1] 28744",
     "crumbs": [
       "2022",
-      "Day 1"
+      "Day 14"
     ]
   },
   {
-    "objectID": "2022/R/day03.html",
-    "href": "2022/R/day03.html",
-    "title": "Day 3",
+    "objectID": "2022/R/day15.html",
+    "href": "2022/R/day15.html",
+    "title": "Day 15",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\"../input/day03.txt\", col_names = \"str\")",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\nlibrary(sf)\n\ntheme_set(theme_bw())\n\n# Read input from text and extract numeric values into a data frame\ninput &lt;- read_lines(\"../input/day15.txt\") |&gt; \n  unglue_data(\n    \"Sensor at x={s_x}, y={s_y}: closest beacon is at x={b_x}, y={b_y}\",\n    convert = TRUE\n  )",
     "crumbs": [
       "2022",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2022/R/day03.html#setup",
-    "href": "2022/R/day03.html#setup",
-    "title": "Day 3",
+    "objectID": "2022/R/day15.html#setup",
+    "href": "2022/R/day15.html#setup",
+    "title": "Day 15",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\"../input/day03.txt\", col_names = \"str\")",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\nlibrary(sf)\n\ntheme_set(theme_bw())\n\n# Read input from text and extract numeric values into a data frame\ninput &lt;- read_lines(\"../input/day15.txt\") |&gt; \n  unglue_data(\n    \"Sensor at x={s_x}, y={s_y}: closest beacon is at x={b_x}, y={b_y}\",\n    convert = TRUE\n  )",
     "crumbs": [
       "2022",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2022/R/day03.html#part-1",
-    "href": "2022/R/day03.html#part-1",
-    "title": "Day 3",
+    "objectID": "2022/R/day15.html#part-1",
+    "href": "2022/R/day15.html#part-1",
+    "title": "Day 15",
     "section": "Part 1",
-    "text": "Part 1\n\ninput |&gt;\n  mutate(\n    # Separate each line into two compartments\n    str_length = str_length(str) / 2,\n    str_1 = str_sub(str, start = 1L, end = str_length),\n    str_2 = str_sub(str, start = str_length + 1, end = -1L),\n\n    # Find the letter in common between each pair of compartments\n    across(c(str_1, str_2), ~ str_split(.x, \"\")),\n    dup = map2_chr(str_1, str_2, ~ intersect(.x, .y)),\n\n    # Convert to priority value\n    priority = match(dup, c(letters, LETTERS))\n  ) |&gt;\n\n  # Compute total sum\n  pull(priority) |&gt;\n  sum()\n\n[1] 8252",
+    "text": "Part 1\nConvert input into a list of beacons, sensors, and total detection distances:\n\nsensors &lt;- input |&gt; \n  distinct(\n    s_x, \n    s_y, \n    max_dist = abs(b_x - s_x) + abs(b_y - s_y)\n  )\n\nbeacons &lt;- input |&gt; \n  distinct(x = b_x, y = b_y)\n\nGenerate a set of polygons that defines the regions detectible by each sensor:\n\n# Convert each sensor's detection distance into a region defined by a polygon\npoly &lt;- sensors |&gt; \n  mutate(\n    polygon = pmap(list(s_x, s_y, max_dist), function(x, y, dist) {\n      rbind(\n        c(x - dist, y),\n        c(x, y - dist),\n        c(x + dist, y),\n        c(x, y + dist),\n        c(x - dist, y)\n      ) |&gt; \n        list() |&gt; \n        st_polygon()\n    }),\n    geometry = st_sfc(polygon)\n  ) |&gt; \n  transmute(idx = row_number(), geometry) |&gt; \n  st_as_sf()\n\n# Merge all polygons into a single geometric shape\npoly_union &lt;- st_union(poly)\n\nVisualize:\n\n# Overlapping regions\nggplot() + \n  geom_sf(data = poly, aes(fill = factor(idx))) + \n  scale_fill_viridis_d(guide = \"none\")\n\n\n\n\n\n\n\n# Merged region\nggplot() + \n  geom_sf(data = poly_union)\n\n\n\n\n\n\n\n\nDefine a set of functions to count the number of integer points that cannot have a beacon within the detection region\n\n# Convert a set of x/y boundaries to a spatial rectangle object\npoly_rect &lt;- function(xmin, xmax, ymin, ymax) {\n  rbind(\n    c(xmin, ymax), \n    c(xmin, ymin), \n    c(xmax, ymin), \n    c(xmax, ymax), \n    c(xmin, ymax)\n  ) |&gt; \n    list() |&gt; \n    st_polygon() |&gt; \n    st_sfc()\n}\n\n# Get the coordinates within a poly, optionally limited within x/y bounds\nsf_points_in_poly &lt;- function(poly, xlim = NULL, ylim = NULL) {\n  \n  # Define a rectangular region within which to generate grid points\n  points_region &lt;- poly_rect(\n    xmin = (if (is_null(xlim)) st_bbox(poly)$xmin else head(xlim, 1)) - 0.5, \n    xmax = (if (is_null(xlim)) st_bbox(poly)$xmax else tail(xlim, 1)) + 0.5, \n    ymin = (if (is_null(ylim)) st_bbox(poly)$ymin else head(ylim, 1)) - 0.5,\n    ymax = (if (is_null(ylim)) st_bbox(poly)$ymax else tail(ylim, 1)) + 0.5\n  )\n  \n  # Generate the grid points that sit within the polygon\n  points_region |&gt; \n    st_make_grid(cellsize = 1, what = \"centers\") |&gt; \n    st_intersection(poly) |&gt; \n    \n    # Convert the set of points from spatial objects to x-y coordinates\n    st_coordinates() |&gt; \n    as_tibble() |&gt; \n    mutate(across(everything(), as.integer)) |&gt; \n    rename_with(tolower)\n}\n\n# Count the points in a sf region (with optional x/y lims) that can't be a beacon\ncount_nonbeacon &lt;- function(detection_region, known_beacons, x = NULL, y = NULL) {\n  \n  # Get the set of integer points within the polygon and x-y region specified\n  detection_region |&gt; \n    sf_points_in_poly(xlim = x, ylim = y) |&gt;\n  \n    # Remove known beacons from the list of points and count\n    anti_join(known_beacons, join_by(x, y)) |&gt;\n    nrow()\n}\n\nRun puzzle input:\n\ncount_nonbeacon(poly_union, beacons, y = 2000000)\n\n[1] 5367037",
     "crumbs": [
       "2022",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2022/R/day03.html#part-2",
-    "href": "2022/R/day03.html#part-2",
-    "title": "Day 3",
+    "objectID": "2022/R/day15.html#part-2",
+    "href": "2022/R/day15.html#part-2",
+    "title": "Day 15",
     "section": "Part 2",
-    "text": "Part 2\n\ninput |&gt;\n\n  # Reshape to one row per group, one column per elf\n  mutate(\n    str = str_split(str, \"\"),\n    group_num = floor((row_number() - 1) / 3),\n    elf_num = as.character(row_number() %% 3)\n  ) |&gt;\n  pivot_wider(names_from = elf_num, values_from = str, names_prefix = \"elf_\") |&gt;\n\n  # Find the character in common between all 3 elves & convert to priority val\n  mutate(\n    dup = pmap_chr(\n      list(elf_0, elf_1, elf_2),\n      ~ reduce(list(..1, ..2, ..3), intersect)\n    ),\n    priority = match(dup, c(letters, LETTERS))\n  ) |&gt;\n\n  # Compute total sum\n  pull(priority) |&gt;\n  sum()\n\n[1] 2828",
+    "text": "Part 2\nDefine a function to get the location of an undetected beacon within a viewport:\n\nfind_undetected_beacon &lt;- function(detection_region, xlim, ylim) {\n  boundary &lt;- poly_rect(xlim[1], xlim[2], ylim[1], ylim[2])\n  \n  # Find the polygon region where an undetected beacon could occur\n  undetected_region &lt;- st_difference(boundary, detection_region)\n  \n  # Get all integer points in the region\n  points &lt;- sf_points_in_poly(undetected_region)\n  \n  # Compute the region's boundary points to exclude\n  undetected_region_boundary &lt;- undetected_region |&gt;\n    st_bbox() |&gt;\n    as.list() |&gt;\n    pmap(\\(xmin, xmax, ymin, ymax) poly_rect(xmin, xmax, ymin, ymax)) |&gt;\n    pluck(1) |&gt; \n    st_difference(undetected_region) |&gt; \n    sf_points_in_poly()\n  \n  # Exclude all boundary points from the region\n  anti_join(points, undetected_region_boundary, join_by(x, y))\n  \n}\n\ntuning_freq &lt;- function(x, y) format(4000000 * x + y, scientific = FALSE)\n\nRun on puzzle input:\n\npoint &lt;- find_undetected_beacon(poly_union, c(0, 4000000), c(0, 4000000))\n\ntuning_freq(point$x, point$y)\n\n[1] \"11914583249288\"",
     "crumbs": [
       "2022",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2022/R/day06.html",
-    "href": "2022/R/day06.html",
-    "title": "Day 6",
+    "objectID": "2022/R/day02.html",
+    "href": "2022/R/day02.html",
+    "title": "Day 2",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\") |&gt;\n  str_split_1(\"\") |&gt;\n  enframe(name = \"idx\", value = \"char\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_fwf(\"../input/day02.txt\", col_types = \"c\")",
     "crumbs": [
       "2022",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2022/R/day06.html#setup",
-    "href": "2022/R/day06.html#setup",
-    "title": "Day 6",
+    "objectID": "2022/R/day02.html#setup",
+    "href": "2022/R/day02.html#setup",
+    "title": "Day 2",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\") |&gt;\n  str_split_1(\"\") |&gt;\n  enframe(name = \"idx\", value = \"char\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_fwf(\"../input/day02.txt\", col_types = \"c\")",
     "crumbs": [
       "2022",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2022/R/day06.html#part-1",
-    "href": "2022/R/day06.html#part-1",
-    "title": "Day 6",
+    "objectID": "2022/R/day02.html#part-1",
+    "href": "2022/R/day02.html#part-1",
+    "title": "Day 2",
     "section": "Part 1",
-    "text": "Part 1\n\nfind_marker &lt;- function(df, marker_length) {\n  df |&gt; \n    # Construct sequences of next n chars and count # of unique chars in each\n    transmute(\n      marker_idx = idx + marker_length - 1,\n      char_seq = reduce(\n        .x = map(0:(marker_length - 1), ~ lead(char, n = .x)),\n        .f = str_c\n      ),\n      n_unique = map_int(\n        char_seq,\n        ~ .x |&gt;\n          str_split(\"\") |&gt;\n          unlist() |&gt;\n          unique() |&gt;\n          length()\n      )\n    ) |&gt;\n\n    # Extract first instance where all n chars are unique\n    filter(n_unique == marker_length) |&gt;\n    pull(marker_idx) |&gt;\n    min()\n}\n\n\nfind_marker(input, marker_length = 4)\n\n[1] 1802",
+    "text": "Part 1\n\n# Format shapes/strategies as numbers 1-3 for modular arithmetic\ndf &lt;- tibble(\n  opponent = as.numeric(factor(input$X1, levels = c(\"A\", \"B\", \"C\"))),\n  strategy = as.numeric(factor(input$X2, levels = c(\"X\", \"Y\", \"Z\")))\n)\n\nscore_shape &lt;- function(df) {\n  df |&gt; \n    mutate(\n      self = strategy,\n      outcome = (self - opponent + 1) %% 3 * 3,\n      score = self + outcome\n    ) |&gt;\n    pull(score) |&gt;\n    sum()\n}\n\nRun puzzle input:\n\nscore_shape(df)\n\n[1] 15422",
     "crumbs": [
       "2022",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2022/R/day06.html#part-2",
-    "href": "2022/R/day06.html#part-2",
-    "title": "Day 6",
+    "objectID": "2022/R/day02.html#part-2",
+    "href": "2022/R/day02.html#part-2",
+    "title": "Day 2",
     "section": "Part 2",
-    "text": "Part 2\n\nfind_marker(input, marker_length = 14)\n\n[1] 3551",
+    "text": "Part 2\n\nscore_outcome &lt;- function(df) {\n  df |&gt; \n    mutate(\n      self = (opponent + strategy) %% 3 + 1,\n      outcome = (strategy - 1) * 3,\n      score = self + outcome\n    ) |&gt;\n    pull(score) |&gt;\n    sum()\n}\n\n\nscore_outcome(df)\n\n[1] 15442",
     "crumbs": [
       "2022",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2022/R/day13.html",
-    "href": "2022/R/day13.html",
-    "title": "Day 13",
+    "objectID": "2022/R/day12.html",
+    "href": "2022/R/day12.html",
+    "title": "Day 12",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input into a data frame and convert to indexed nested lists\ndf &lt;- read_table(\"../input/day13.txt\", col_names = \"txt\") |&gt; \n  mutate(\n    row_id   = row_number(),\n    group_id = floor((row_id - 1) / 2) + 1,\n    item_id  = (row_id - 1) %% 2 + 1,\n    lst      = map(txt, jsonlite::fromJSON, simplifyVector = FALSE)\n  )",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day12.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2022",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2022/R/day13.html#setup",
-    "href": "2022/R/day13.html#setup",
-    "title": "Day 13",
+    "objectID": "2022/R/day12.html#setup",
+    "href": "2022/R/day12.html#setup",
+    "title": "Day 12",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input into a data frame and convert to indexed nested lists\ndf &lt;- read_table(\"../input/day13.txt\", col_names = \"txt\") |&gt; \n  mutate(\n    row_id   = row_number(),\n    group_id = floor((row_id - 1) / 2) + 1,\n    item_id  = (row_id - 1) %% 2 + 1,\n    lst      = map(txt, jsonlite::fromJSON, simplifyVector = FALSE)\n  )",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day12.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2022",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2022/R/day13.html#part-1",
-    "href": "2022/R/day13.html#part-1",
-    "title": "Day 13",
+    "objectID": "2022/R/day12.html#part-1",
+    "href": "2022/R/day12.html#part-1",
+    "title": "Day 12",
     "section": "Part 1",
-    "text": "Part 1\nDefine a function to compare nested lists:\n\ncompare_nested &lt;- function(a, b) {\n\n  # Compare if both inputs are numeric\n  if (is.numeric(a) & is.numeric(b)) {\n    if (a &lt; b)  return(-1)\n    if (a &gt; b)  return(1)\n    if (a == b) return(0)\n  }\n\n  # Compare if only one input is numeric\n  if (is.numeric(a) != is.numeric(b)) {\n    if (is.numeric(a))\n      return(compare_nested(list(a), b))\n    if (is.numeric(b))\n      return(compare_nested(a, list(b)))\n  }\n\n  # Compare if both inputs are lists\n  i &lt;- 1\n  while (i &lt;= min(length(a), length(b))) {\n    result &lt;- compare_nested(a[[i]], b[[i]])\n    if (result %in% c(1, -1))\n      return(result)\n    i &lt;- i + 1\n  }\n  # When all comparable values are equal, compare lengths\n  return(compare_nested(length(a), length(b)))\n}\n\nSum the indices of packet pairs that are in order:\n\ndf |&gt;\n  select(group_id, item_id, lst) |&gt;\n  pivot_wider(\n    names_from = item_id,\n    names_prefix = \"item_\",\n    values_from = lst\n  ) |&gt;\n  mutate(comparison = map2_int(item_1, item_2, compare_nested)) |&gt;\n  filter(comparison == -1) |&gt;\n  pull(group_id) |&gt; \n  sum()\n\n[1] 5684",
+    "text": "Part 1\nReformat input as a data frame of coordinates and elevations:\n\ndf &lt;- input |&gt;\n  str_split(\"\") |&gt;\n  unlist() |&gt;\n  as_tibble() |&gt;\n  transmute(\n    id = row_number(),\n    letter = value,\n    elevation = case_when(\n      letter == \"S\" ~  Inf,\n      letter == \"E\" ~ -Inf,\n      .default = match(letter, letters)\n    ),\n    row = floor((id - 1) / str_length(input[1]) + 1),\n    col = (id - 1) %% str_length(input[1]) + 1\n  )\n\n\ndf_to_graph &lt;- function(df) {\n\n  # Flag whether each neighbor of each vertex is walkable\n  neighbors &lt;- df |&gt;\n    mutate(up   = lag(id), down  = lead(id), .by = col) |&gt;\n    mutate(left = lag(id), right = lead(id), .by = row) |&gt;\n    mutate(\n      across(\n        c(up, down, left, right),\n        ~ elevation[.x],\n        .names = \"{.col}_elev\"\n      ),\n      across(\n        ends_with(\"_elev\"),\n        ~ (.x - elevation) &lt;= 1,\n        .names = \"{str_remove(.col, '_elev')}_walkable\"\n      )\n    ) |&gt;\n    rename_with(.cols = c(up, down, left, right), ~ str_c(.x, \"_idx\")) |&gt;\n    select(source_idx = id, ends_with(c(\"idx\", \"walkable\")))\n\n  # Construct a list of edges\n  edge_list &lt;- neighbors |&gt;\n    pivot_longer(\n      !source_idx,\n      names_to = c(\"target_dir\", \".value\"),\n      names_sep = \"_\"\n    ) |&gt;\n    rename(\n      target_idx = idx,\n      target_walkable = walkable\n    ) |&gt;\n    filter(target_walkable == TRUE) |&gt;\n    pmap(function(source_idx, target_idx, ...) { c(source_idx, target_idx) }) |&gt;\n    unlist()\n\n  # Convert to a directed graph\n  g &lt;- make_empty_graph() |&gt;\n    add_vertices(length(df$id)) |&gt;\n    add_edges(edge_list)\n\n}\n\nshortest_path_length &lt;- function(g, source_idx, target_idx) {\n  shortest_paths(g, from = source_idx, to = target_idx)$vpath[[1]] |&gt;\n    length() - 1\n}\n\n\ng &lt;- df_to_graph(df)\n\n\n# Get the indices of the start and end vertices\nidx_start &lt;- match(\"S\", df$letter)\nidx_end   &lt;- match(\"E\", df$letter)\n\n# Compute shortest path from start to end\nshortest_path_length(g, idx_start, idx_end)\n\n[1] 462",
     "crumbs": [
       "2022",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2022/R/day13.html#part-2",
-    "href": "2022/R/day13.html#part-2",
-    "title": "Day 13",
+    "objectID": "2022/R/day12.html#part-2",
+    "href": "2022/R/day12.html#part-2",
+    "title": "Day 12",
     "section": "Part 2",
-    "text": "Part 2\nDefine a function to determine the pairwise order of nested lists:\n\nsort_nested &lt;- function(lst) {\n  n &lt;- length(lst)\n  indices &lt;- 1:n\n\n  if (n == 0) return()\n  if (n == 1) return(indices)\n\n  # Bubble sort: loop through list and swap elements until sorted\n  repeat {\n    swap_occurred &lt;- FALSE\n    for (i in 1:(n - 1)) {\n      j1 &lt;- which(indices == i)\n      j2 &lt;- which(indices == i + 1)\n      if (compare_nested(lst[[j1]], lst[[j2]]) == 1) {\n        indices[j1] &lt;- i + 1\n        indices[j2] &lt;- i\n        swap_occurred &lt;- TRUE\n      }\n    }\n    if (!swap_occurred) break\n  }\n  return(indices)\n}\n\nAdd new flagged packets, sort all, and multiply flagged indices:\n\nnew_packets &lt;- list(\"[[2]]\", \"[[6]]\") |&gt;\n  map(jsonlite::fromJSON, simplifyVector = FALSE) |&gt;\n  as_tibble_col(column_name = \"lst\")\n\ndf |&gt;\n  transmute(lst, flag = FALSE) |&gt;\n  add_row(new_packets, flag = TRUE) |&gt;\n  mutate(ord = sort_nested(lst)) |&gt;\n  filter(flag) |&gt;\n  pull(ord) |&gt; \n  prod()\n\n[1] 22932",
+    "text": "Part 2\n\n# Loop over all starting locations and find the shortest path to the end\nmin_dist &lt;- Inf\nfor (i in c(idx_start, which(df$letter == \"a\"))) {\n  cur &lt;- shortest_path_length(g, i, idx_end)\n  if (cur &gt;= 0 & cur &lt; min_dist) {\n    min_dist &lt;- cur\n  }\n}\nmin_dist\n\n[1] 451",
     "crumbs": [
       "2022",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2022/R/day11.html",
-    "href": "2022/R/day11.html",
-    "title": "Day 11",
+    "objectID": "2022/R/day07.html",
+    "href": "2022/R/day07.html",
+    "title": "Day 7",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\") |&gt;\n  trimws() |&gt;\n  discard(~ .x == \"\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\") |&gt; \n  enframe(name = NULL)",
     "crumbs": [
       "2022",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2022/R/day11.html#setup",
-    "href": "2022/R/day11.html#setup",
-    "title": "Day 11",
+    "objectID": "2022/R/day07.html#setup",
+    "href": "2022/R/day07.html#setup",
+    "title": "Day 7",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\") |&gt;\n  trimws() |&gt;\n  discard(~ .x == \"\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\") |&gt; \n  enframe(name = NULL)",
     "crumbs": [
       "2022",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2022/R/day11.html#part-1",
-    "href": "2022/R/day11.html#part-1",
-    "title": "Day 11",
+    "objectID": "2022/R/day07.html#part-1",
+    "href": "2022/R/day07.html#part-1",
+    "title": "Day 7",
     "section": "Part 1",
-    "text": "Part 1\n\n# Reformat input\nitems &lt;- str_match(input, \"Starting items:(.*)\")[,2] |&gt;\n  discard(is.na) |&gt;\n  str_split(\",\") |&gt;\n  map(parse_number)\n\noperations &lt;- input |&gt;\n  keep(~ str_detect(.x, \"Operation:\")) |&gt;\n  str_replace(\"Operation: new = \", \"~ \") |&gt;\n  str_replace_all(\"old\", \".x\") |&gt;\n  map(~ rlang::as_function(as.formula(.x)))\n\ndiv  &lt;- parse_number(keep(input, ~ str_detect(.x, \"Test:\")))\ndivt &lt;- parse_number(keep(input, ~ str_detect(.x, \"If true:\")))\ndivf &lt;- parse_number(keep(input, ~ str_detect(.x, \"If false:\")))\n\ntest &lt;- pmap(\n  list(div, divt, divf),\n  ~ function(x) if_else(x %% ..1 == 0, ..2 + 1, ..3 + 1)\n)\n\nnum_monkeys &lt;- length(input) / 6\n\n\ncompute_monkey_business &lt;- function(num_rounds, worry_func) {\n  # Initialize\n  activity &lt;- rep(0, num_monkeys)\n\n  # Perform the tosses\n  for (round in 1:num_rounds) {\n    for (monkey in 1:num_monkeys) {\n      for (item in items[[monkey]]) {\n        worry &lt;- worry_func(operations[[monkey]](item))\n        toss  &lt;- test[[monkey]](worry)\n        items[[toss]] &lt;- c(items[[toss]], worry)\n      }\n      activity[[monkey]] &lt;- activity[[monkey]] + length(items[[monkey]])\n      items[[monkey]] &lt;- numeric(0)\n    }\n  }\n\n  # Compute monkey business score\n  activity |&gt;\n    sort() |&gt;\n    tail(2) |&gt;\n    reduce(`*`)\n}\n\n\ncompute_monkey_business(num_rounds = 20, worry_func = \\(x) floor(x / 3))\n\n[1] 78678",
+    "text": "Part 1\n\ndir_sizes &lt;- input |&gt; \n  mutate(\n\n    # Determine path of each file by accumulating preceding cd terms\n    path = value |&gt;\n      str_extract(\"(?&lt;=^\\\\$ cd ).*\") |&gt;\n      str_c(\"/\") |&gt;\n      replace_na(\"\") |&gt;\n      accumulate(\n        ~ if (.y == \"../\") {\n          str_remove(.x, \"(?&lt;=/)[a-z]+/$\")\n        } else {\n          str_c(.x, .y)\n        }\n      ) |&gt;\n      str_remove_all(\"^/|/$\"),\n\n    # Convert paths to lists of all containing directories\n    dirs = path |&gt;\n      str_split(\"/\") |&gt;\n      map(~accumulate(.x, str_c, sep = \"/\"))\n  ) |&gt;\n\n  # Remove commands & directories from output and format file info as cols\n  filter(!str_detect(value, \"^\\\\$|dir \")) |&gt;\n  separate(value, into = c(\"size\", \"file\"), sep = \" \") |&gt;\n  mutate(size = as.integer(size)) |&gt;\n\n  # Convert nested lists of directories to long-format\n  unnest_wider(dirs, names_sep = \"_\") |&gt;\n  mutate(dirs_1 = \"/\") |&gt;\n  pivot_longer(\n    cols = matches(\"dirs_\\\\d+\"),\n    names_to = NULL,\n    values_to = \"dir\",\n    values_drop_na = TRUE\n  ) |&gt;\n\n  # Compute size of each directory\n  group_by(dir) |&gt;\n  summarize(size = sum(size)) |&gt;\n  ungroup()\n\nSum sizes of all directories with maximum size 100000:\n\ndir_sizes |&gt;\n  filter(size &lt;= 100000) |&gt;\n  pull(size) |&gt;\n  sum()\n\n[1] 1243729",
     "crumbs": [
       "2022",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2022/R/day11.html#part-2",
-    "href": "2022/R/day11.html#part-2",
-    "title": "Day 11",
+    "objectID": "2022/R/day07.html#part-2",
+    "href": "2022/R/day07.html#part-2",
+    "title": "Day 7",
     "section": "Part 2",
-    "text": "Part 2\n\nlcm &lt;- DescTools::LCM(div)\ncompute_monkey_business(num_rounds = 10000, worry_func = \\(x) x %% lcm)\n\n[1] 15333249714",
+    "text": "Part 2\nFind size of the smallest necessary directory to delete:\n\ncurr_system_size &lt;- dir_sizes |&gt;\n  filter(dir == \"/\") |&gt;\n  pull(size)\n\ndir_sizes |&gt;\n  filter(size &gt;= (30000000 - (70000000 - curr_system_size))) |&gt;\n  slice_min(size) |&gt;\n  pull(size)\n\n[1] 4443914",
     "crumbs": [
       "2022",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2022/R/day04.html",
-    "href": "2022/R/day04.html",
-    "title": "Day 4",
+    "objectID": "2022/R/day05.html",
+    "href": "2022/R/day05.html",
+    "title": "Day 5",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_csv(\"../input/day04.txt\", col_names = FALSE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\npath &lt;- \"../input/day05.txt\"\ninput &lt;- read_lines(path)",
     "crumbs": [
       "2022",
-      "Day 4"
+      "Day 5"
     ]
   },
   {
-    "objectID": "2022/R/day04.html#setup",
-    "href": "2022/R/day04.html#setup",
-    "title": "Day 4",
+    "objectID": "2022/R/day05.html#setup",
+    "href": "2022/R/day05.html#setup",
+    "title": "Day 5",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_csv(\"../input/day04.txt\", col_names = FALSE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\npath &lt;- \"../input/day05.txt\"\ninput &lt;- read_lines(path)",
     "crumbs": [
       "2022",
-      "Day 4"
+      "Day 5"
     ]
   },
   {
-    "objectID": "2022/R/day04.html#parts-1-2",
-    "href": "2022/R/day04.html#parts-1-2",
-    "title": "Day 4",
-    "section": "Parts 1 & 2",
-    "text": "Parts 1 & 2\n\ninput |&gt;  \n  separate(X1, into = c(\"start1\", \"end1\"), sep = \"-\", convert = TRUE) |&gt;\n  separate(X2, into = c(\"start2\", \"end2\"), sep = \"-\", convert = TRUE) |&gt;\n  mutate(\n    range1 = map2(start1, end1, ~ .x:.y),\n    range2 = map2(start2, end2, ~ .x:.y),\n    contained = map2_lgl(range1, range2, ~ all(.x %in% .y) | all(.y %in% .x)),\n    overlap   = map2_lgl(range1, range2, ~ length(intersect(.x, .y)) &gt; 0)\n  ) |&gt;\n  summarize(num_contained = sum(contained), num_overlap = sum(overlap))\n\n# A tibble: 1 × 2\n  num_contained num_overlap\n          &lt;int&gt;       &lt;int&gt;\n1           550         931",
+    "objectID": "2022/R/day05.html#part-1",
+    "href": "2022/R/day05.html#part-1",
+    "title": "Day 5",
+    "section": "Part 1",
+    "text": "Part 1\n\n# Format raw input\nmoves &lt;- input |&gt;\n  tail_while(~ .x != \"\") |&gt;\n  str_extract_all(\"\\\\d+\") |&gt;\n  map(as.integer)\n\nstacks &lt;- read_fwf(\n  path,\n  n_max = length(input) - length(moves) - 2,\n  col_types = \"c\"\n) |&gt;\n  mutate(across(everything(), ~ str_extract(.x, \"[A-Z]\"))) |&gt;\n  as.list() |&gt;\n  map(discard, is.na) |&gt;\n  map(rev)\n\nmove_crates &lt;- function(moves, stacks, func) {\n  \n  # Execute moves\n  for (curr_move in moves) {\n    count &lt;- curr_move[1]\n    from  &lt;- curr_move[2]\n    to    &lt;- curr_move[3]\n    \n    crates &lt;- func(tail(stacks[[from]], count))\n\n    stacks[[to]]   &lt;- append(stacks[[to]], crates)\n    stacks[[from]] &lt;- head(stacks[[from]], -1 * count)\n  }\n\n  # Examine final top row of crates\n  stacks |&gt;\n    map(~ tail(.x, 1)) |&gt;\n    str_c(collapse = \"\")\n}\n\n\nmove_crates(moves, stacks, rev)\n\n[1] \"RLFNRTNFB\"",
     "crumbs": [
       "2022",
-      "Day 4"
+      "Day 5"
+    ]
+  },
+  {
+    "objectID": "2022/R/day05.html#part-2",
+    "href": "2022/R/day05.html#part-2",
+    "title": "Day 5",
+    "section": "Part 2",
+    "text": "Part 2\n\nmove_crates(moves, stacks, identity)\n\n[1] \"MHQTLJRLB\"",
+    "crumbs": [
+      "2022",
+      "Day 5"
     ]
   },
   {
@@ -722,619 +744,630 @@
     ]
   },
   {
-    "objectID": "2022/R/day05.html",
-    "href": "2022/R/day05.html",
-    "title": "Day 5",
+    "objectID": "2022/R/day04.html",
+    "href": "2022/R/day04.html",
+    "title": "Day 4",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\npath &lt;- \"../input/day05.txt\"\ninput &lt;- read_lines(path)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_csv(\"../input/day04.txt\", col_names = FALSE)",
     "crumbs": [
       "2022",
-      "Day 5"
+      "Day 4"
     ]
   },
   {
-    "objectID": "2022/R/day05.html#setup",
-    "href": "2022/R/day05.html#setup",
-    "title": "Day 5",
+    "objectID": "2022/R/day04.html#setup",
+    "href": "2022/R/day04.html#setup",
+    "title": "Day 4",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\npath &lt;- \"../input/day05.txt\"\ninput &lt;- read_lines(path)",
-    "crumbs": [
-      "2022",
-      "Day 5"
-    ]
-  },
-  {
-    "objectID": "2022/R/day05.html#part-1",
-    "href": "2022/R/day05.html#part-1",
-    "title": "Day 5",
-    "section": "Part 1",
-    "text": "Part 1\n\n# Format raw input\nmoves &lt;- input |&gt;\n  tail_while(~ .x != \"\") |&gt;\n  str_extract_all(\"\\\\d+\") |&gt;\n  map(as.integer)\n\nstacks &lt;- read_fwf(\n  path,\n  n_max = length(input) - length(moves) - 2,\n  col_types = \"c\"\n) |&gt;\n  mutate(across(everything(), ~ str_extract(.x, \"[A-Z]\"))) |&gt;\n  as.list() |&gt;\n  map(discard, is.na) |&gt;\n  map(rev)\n\nmove_crates &lt;- function(moves, stacks, func) {\n  \n  # Execute moves\n  for (curr_move in moves) {\n    count &lt;- curr_move[1]\n    from  &lt;- curr_move[2]\n    to    &lt;- curr_move[3]\n    \n    crates &lt;- func(tail(stacks[[from]], count))\n\n    stacks[[to]]   &lt;- append(stacks[[to]], crates)\n    stacks[[from]] &lt;- head(stacks[[from]], -1 * count)\n  }\n\n  # Examine final top row of crates\n  stacks |&gt;\n    map(~ tail(.x, 1)) |&gt;\n    str_c(collapse = \"\")\n}\n\n\nmove_crates(moves, stacks, rev)\n\n[1] \"RLFNRTNFB\"",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_csv(\"../input/day04.txt\", col_names = FALSE)",
     "crumbs": [
       "2022",
-      "Day 5"
+      "Day 4"
     ]
   },
   {
-    "objectID": "2022/R/day05.html#part-2",
-    "href": "2022/R/day05.html#part-2",
-    "title": "Day 5",
-    "section": "Part 2",
-    "text": "Part 2\n\nmove_crates(moves, stacks, identity)\n\n[1] \"MHQTLJRLB\"",
+    "objectID": "2022/R/day04.html#parts-1-2",
+    "href": "2022/R/day04.html#parts-1-2",
+    "title": "Day 4",
+    "section": "Parts 1 & 2",
+    "text": "Parts 1 & 2\n\ninput |&gt;  \n  separate(X1, into = c(\"start1\", \"end1\"), sep = \"-\", convert = TRUE) |&gt;\n  separate(X2, into = c(\"start2\", \"end2\"), sep = \"-\", convert = TRUE) |&gt;\n  mutate(\n    range1 = map2(start1, end1, ~ .x:.y),\n    range2 = map2(start2, end2, ~ .x:.y),\n    contained = map2_lgl(range1, range2, ~ all(.x %in% .y) | all(.y %in% .x)),\n    overlap   = map2_lgl(range1, range2, ~ length(intersect(.x, .y)) &gt; 0)\n  ) |&gt;\n  summarize(num_contained = sum(contained), num_overlap = sum(overlap))\n\n# A tibble: 1 × 2\n  num_contained num_overlap\n          &lt;int&gt;       &lt;int&gt;\n1           550         931",
     "crumbs": [
       "2022",
-      "Day 5"
+      "Day 4"
     ]
   },
   {
-    "objectID": "2022/R/day07.html",
-    "href": "2022/R/day07.html",
-    "title": "Day 7",
+    "objectID": "2022/R/day11.html",
+    "href": "2022/R/day11.html",
+    "title": "Day 11",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\") |&gt; \n  enframe(name = NULL)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\") |&gt;\n  trimws() |&gt;\n  discard(~ .x == \"\")",
     "crumbs": [
       "2022",
-      "Day 7"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2022/R/day07.html#setup",
-    "href": "2022/R/day07.html#setup",
-    "title": "Day 7",
+    "objectID": "2022/R/day11.html#setup",
+    "href": "2022/R/day11.html#setup",
+    "title": "Day 11",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\") |&gt; \n  enframe(name = NULL)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\") |&gt;\n  trimws() |&gt;\n  discard(~ .x == \"\")",
     "crumbs": [
       "2022",
-      "Day 7"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2022/R/day07.html#part-1",
-    "href": "2022/R/day07.html#part-1",
-    "title": "Day 7",
+    "objectID": "2022/R/day11.html#part-1",
+    "href": "2022/R/day11.html#part-1",
+    "title": "Day 11",
     "section": "Part 1",
-    "text": "Part 1\n\ndir_sizes &lt;- input |&gt; \n  mutate(\n\n    # Determine path of each file by accumulating preceding cd terms\n    path = value |&gt;\n      str_extract(\"(?&lt;=^\\\\$ cd ).*\") |&gt;\n      str_c(\"/\") |&gt;\n      replace_na(\"\") |&gt;\n      accumulate(\n        ~ if (.y == \"../\") {\n          str_remove(.x, \"(?&lt;=/)[a-z]+/$\")\n        } else {\n          str_c(.x, .y)\n        }\n      ) |&gt;\n      str_remove_all(\"^/|/$\"),\n\n    # Convert paths to lists of all containing directories\n    dirs = path |&gt;\n      str_split(\"/\") |&gt;\n      map(~accumulate(.x, str_c, sep = \"/\"))\n  ) |&gt;\n\n  # Remove commands & directories from output and format file info as cols\n  filter(!str_detect(value, \"^\\\\$|dir \")) |&gt;\n  separate(value, into = c(\"size\", \"file\"), sep = \" \") |&gt;\n  mutate(size = as.integer(size)) |&gt;\n\n  # Convert nested lists of directories to long-format\n  unnest_wider(dirs, names_sep = \"_\") |&gt;\n  mutate(dirs_1 = \"/\") |&gt;\n  pivot_longer(\n    cols = matches(\"dirs_\\\\d+\"),\n    names_to = NULL,\n    values_to = \"dir\",\n    values_drop_na = TRUE\n  ) |&gt;\n\n  # Compute size of each directory\n  group_by(dir) |&gt;\n  summarize(size = sum(size)) |&gt;\n  ungroup()\n\nSum sizes of all directories with maximum size 100000:\n\ndir_sizes |&gt;\n  filter(size &lt;= 100000) |&gt;\n  pull(size) |&gt;\n  sum()\n\n[1] 1243729",
+    "text": "Part 1\n\n# Reformat input\nitems &lt;- str_match(input, \"Starting items:(.*)\")[,2] |&gt;\n  discard(is.na) |&gt;\n  str_split(\",\") |&gt;\n  map(parse_number)\n\noperations &lt;- input |&gt;\n  keep(~ str_detect(.x, \"Operation:\")) |&gt;\n  str_replace(\"Operation: new = \", \"~ \") |&gt;\n  str_replace_all(\"old\", \".x\") |&gt;\n  map(~ rlang::as_function(as.formula(.x)))\n\ndiv  &lt;- parse_number(keep(input, ~ str_detect(.x, \"Test:\")))\ndivt &lt;- parse_number(keep(input, ~ str_detect(.x, \"If true:\")))\ndivf &lt;- parse_number(keep(input, ~ str_detect(.x, \"If false:\")))\n\ntest &lt;- pmap(\n  list(div, divt, divf),\n  ~ function(x) if_else(x %% ..1 == 0, ..2 + 1, ..3 + 1)\n)\n\nnum_monkeys &lt;- length(input) / 6\n\n\ncompute_monkey_business &lt;- function(num_rounds, worry_func) {\n  # Initialize\n  activity &lt;- rep(0, num_monkeys)\n\n  # Perform the tosses\n  for (round in 1:num_rounds) {\n    for (monkey in 1:num_monkeys) {\n      for (item in items[[monkey]]) {\n        worry &lt;- worry_func(operations[[monkey]](item))\n        toss  &lt;- test[[monkey]](worry)\n        items[[toss]] &lt;- c(items[[toss]], worry)\n      }\n      activity[[monkey]] &lt;- activity[[monkey]] + length(items[[monkey]])\n      items[[monkey]] &lt;- numeric(0)\n    }\n  }\n\n  # Compute monkey business score\n  activity |&gt;\n    sort() |&gt;\n    tail(2) |&gt;\n    reduce(`*`)\n}\n\n\ncompute_monkey_business(num_rounds = 20, worry_func = \\(x) floor(x / 3))\n\n[1] 78678",
     "crumbs": [
       "2022",
-      "Day 7"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2022/R/day07.html#part-2",
-    "href": "2022/R/day07.html#part-2",
-    "title": "Day 7",
+    "objectID": "2022/R/day11.html#part-2",
+    "href": "2022/R/day11.html#part-2",
+    "title": "Day 11",
     "section": "Part 2",
-    "text": "Part 2\nFind size of the smallest necessary directory to delete:\n\ncurr_system_size &lt;- dir_sizes |&gt;\n  filter(dir == \"/\") |&gt;\n  pull(size)\n\ndir_sizes |&gt;\n  filter(size &gt;= (30000000 - (70000000 - curr_system_size))) |&gt;\n  slice_min(size) |&gt;\n  pull(size)\n\n[1] 4443914",
+    "text": "Part 2\n\nlcm &lt;- DescTools::LCM(div)\ncompute_monkey_business(num_rounds = 10000, worry_func = \\(x) x %% lcm)\n\n[1] 15333249714",
     "crumbs": [
       "2022",
-      "Day 7"
+      "Day 11"
     ]
   },
   {
-    "objectID": "2022/R/day12.html",
-    "href": "2022/R/day12.html",
-    "title": "Day 12",
+    "objectID": "2022/R/day13.html",
+    "href": "2022/R/day13.html",
+    "title": "Day 13",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day12.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input into a data frame and convert to indexed nested lists\ndf &lt;- read_table(\"../input/day13.txt\", col_names = \"txt\") |&gt; \n  mutate(\n    row_id   = row_number(),\n    group_id = floor((row_id - 1) / 2) + 1,\n    item_id  = (row_id - 1) %% 2 + 1,\n    lst      = map(txt, jsonlite::fromJSON, simplifyVector = FALSE)\n  )",
     "crumbs": [
       "2022",
-      "Day 12"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2022/R/day12.html#setup",
-    "href": "2022/R/day12.html#setup",
-    "title": "Day 12",
+    "objectID": "2022/R/day13.html#setup",
+    "href": "2022/R/day13.html#setup",
+    "title": "Day 13",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day12.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input into a data frame and convert to indexed nested lists\ndf &lt;- read_table(\"../input/day13.txt\", col_names = \"txt\") |&gt; \n  mutate(\n    row_id   = row_number(),\n    group_id = floor((row_id - 1) / 2) + 1,\n    item_id  = (row_id - 1) %% 2 + 1,\n    lst      = map(txt, jsonlite::fromJSON, simplifyVector = FALSE)\n  )",
     "crumbs": [
       "2022",
-      "Day 12"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2022/R/day12.html#part-1",
-    "href": "2022/R/day12.html#part-1",
-    "title": "Day 12",
+    "objectID": "2022/R/day13.html#part-1",
+    "href": "2022/R/day13.html#part-1",
+    "title": "Day 13",
     "section": "Part 1",
-    "text": "Part 1\nReformat input as a data frame of coordinates and elevations:\n\ndf &lt;- input |&gt;\n  str_split(\"\") |&gt;\n  unlist() |&gt;\n  as_tibble() |&gt;\n  transmute(\n    id = row_number(),\n    letter = value,\n    elevation = case_when(\n      letter == \"S\" ~  Inf,\n      letter == \"E\" ~ -Inf,\n      .default = match(letter, letters)\n    ),\n    row = floor((id - 1) / str_length(input[1]) + 1),\n    col = (id - 1) %% str_length(input[1]) + 1\n  )\n\n\ndf_to_graph &lt;- function(df) {\n\n  # Flag whether each neighbor of each vertex is walkable\n  neighbors &lt;- df |&gt;\n    mutate(up   = lag(id), down  = lead(id), .by = col) |&gt;\n    mutate(left = lag(id), right = lead(id), .by = row) |&gt;\n    mutate(\n      across(\n        c(up, down, left, right),\n        ~ elevation[.x],\n        .names = \"{.col}_elev\"\n      ),\n      across(\n        ends_with(\"_elev\"),\n        ~ (.x - elevation) &lt;= 1,\n        .names = \"{str_remove(.col, '_elev')}_walkable\"\n      )\n    ) |&gt;\n    rename_with(.cols = c(up, down, left, right), ~ str_c(.x, \"_idx\")) |&gt;\n    select(source_idx = id, ends_with(c(\"idx\", \"walkable\")))\n\n  # Construct a list of edges\n  edge_list &lt;- neighbors |&gt;\n    pivot_longer(\n      !source_idx,\n      names_to = c(\"target_dir\", \".value\"),\n      names_sep = \"_\"\n    ) |&gt;\n    rename(\n      target_idx = idx,\n      target_walkable = walkable\n    ) |&gt;\n    filter(target_walkable == TRUE) |&gt;\n    pmap(function(source_idx, target_idx, ...) { c(source_idx, target_idx) }) |&gt;\n    unlist()\n\n  # Convert to a directed graph\n  g &lt;- make_empty_graph() |&gt;\n    add_vertices(length(df$id)) |&gt;\n    add_edges(edge_list)\n\n}\n\nshortest_path_length &lt;- function(g, source_idx, target_idx) {\n  shortest_paths(g, from = source_idx, to = target_idx)$vpath[[1]] |&gt;\n    length() - 1\n}\n\n\ng &lt;- df_to_graph(df)\n\n\n# Get the indices of the start and end vertices\nidx_start &lt;- match(\"S\", df$letter)\nidx_end   &lt;- match(\"E\", df$letter)\n\n# Compute shortest path from start to end\nshortest_path_length(g, idx_start, idx_end)\n\n[1] 462",
+    "text": "Part 1\nDefine a function to compare nested lists:\n\ncompare_nested &lt;- function(a, b) {\n\n  # Compare if both inputs are numeric\n  if (is.numeric(a) & is.numeric(b)) {\n    if (a &lt; b)  return(-1)\n    if (a &gt; b)  return(1)\n    if (a == b) return(0)\n  }\n\n  # Compare if only one input is numeric\n  if (is.numeric(a) != is.numeric(b)) {\n    if (is.numeric(a))\n      return(compare_nested(list(a), b))\n    if (is.numeric(b))\n      return(compare_nested(a, list(b)))\n  }\n\n  # Compare if both inputs are lists\n  i &lt;- 1\n  while (i &lt;= min(length(a), length(b))) {\n    result &lt;- compare_nested(a[[i]], b[[i]])\n    if (result %in% c(1, -1))\n      return(result)\n    i &lt;- i + 1\n  }\n  # When all comparable values are equal, compare lengths\n  return(compare_nested(length(a), length(b)))\n}\n\nSum the indices of packet pairs that are in order:\n\ndf |&gt;\n  select(group_id, item_id, lst) |&gt;\n  pivot_wider(\n    names_from = item_id,\n    names_prefix = \"item_\",\n    values_from = lst\n  ) |&gt;\n  mutate(comparison = map2_int(item_1, item_2, compare_nested)) |&gt;\n  filter(comparison == -1) |&gt;\n  pull(group_id) |&gt; \n  sum()\n\n[1] 5684",
     "crumbs": [
       "2022",
-      "Day 12"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2022/R/day12.html#part-2",
-    "href": "2022/R/day12.html#part-2",
-    "title": "Day 12",
+    "objectID": "2022/R/day13.html#part-2",
+    "href": "2022/R/day13.html#part-2",
+    "title": "Day 13",
     "section": "Part 2",
-    "text": "Part 2\n\n# Loop over all starting locations and find the shortest path to the end\nmin_dist &lt;- Inf\nfor (i in c(idx_start, which(df$letter == \"a\"))) {\n  cur &lt;- shortest_path_length(g, i, idx_end)\n  if (cur &gt;= 0 & cur &lt; min_dist) {\n    min_dist &lt;- cur\n  }\n}\nmin_dist\n\n[1] 451",
+    "text": "Part 2\nDefine a function to determine the pairwise order of nested lists:\n\nsort_nested &lt;- function(lst) {\n  n &lt;- length(lst)\n  indices &lt;- 1:n\n\n  if (n == 0) return()\n  if (n == 1) return(indices)\n\n  # Bubble sort: loop through list and swap elements until sorted\n  repeat {\n    swap_occurred &lt;- FALSE\n    for (i in 1:(n - 1)) {\n      j1 &lt;- which(indices == i)\n      j2 &lt;- which(indices == i + 1)\n      if (compare_nested(lst[[j1]], lst[[j2]]) == 1) {\n        indices[j1] &lt;- i + 1\n        indices[j2] &lt;- i\n        swap_occurred &lt;- TRUE\n      }\n    }\n    if (!swap_occurred) break\n  }\n  return(indices)\n}\n\nAdd new flagged packets, sort all, and multiply flagged indices:\n\nnew_packets &lt;- list(\"[[2]]\", \"[[6]]\") |&gt;\n  map(jsonlite::fromJSON, simplifyVector = FALSE) |&gt;\n  as_tibble_col(column_name = \"lst\")\n\ndf |&gt;\n  transmute(lst, flag = FALSE) |&gt;\n  add_row(new_packets, flag = TRUE) |&gt;\n  mutate(ord = sort_nested(lst)) |&gt;\n  filter(flag) |&gt;\n  pull(ord) |&gt; \n  prod()\n\n[1] 22932",
     "crumbs": [
       "2022",
-      "Day 12"
+      "Day 13"
     ]
   },
   {
-    "objectID": "2022/R/day02.html",
-    "href": "2022/R/day02.html",
-    "title": "Day 2",
+    "objectID": "2022/R/day06.html",
+    "href": "2022/R/day06.html",
+    "title": "Day 6",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_fwf(\"../input/day02.txt\", col_types = \"c\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\") |&gt;\n  str_split_1(\"\") |&gt;\n  enframe(name = \"idx\", value = \"char\")",
     "crumbs": [
       "2022",
-      "Day 2"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2022/R/day02.html#setup",
-    "href": "2022/R/day02.html#setup",
-    "title": "Day 2",
+    "objectID": "2022/R/day06.html#setup",
+    "href": "2022/R/day06.html#setup",
+    "title": "Day 6",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_fwf(\"../input/day02.txt\", col_types = \"c\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\") |&gt;\n  str_split_1(\"\") |&gt;\n  enframe(name = \"idx\", value = \"char\")",
     "crumbs": [
       "2022",
-      "Day 2"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2022/R/day02.html#part-1",
-    "href": "2022/R/day02.html#part-1",
-    "title": "Day 2",
+    "objectID": "2022/R/day06.html#part-1",
+    "href": "2022/R/day06.html#part-1",
+    "title": "Day 6",
     "section": "Part 1",
-    "text": "Part 1\n\n# Format shapes/strategies as numbers 1-3 for modular arithmetic\ndf &lt;- tibble(\n  opponent = as.numeric(factor(input$X1, levels = c(\"A\", \"B\", \"C\"))),\n  strategy = as.numeric(factor(input$X2, levels = c(\"X\", \"Y\", \"Z\")))\n)\n\nscore_shape &lt;- function(df) {\n  df |&gt; \n    mutate(\n      self = strategy,\n      outcome = (self - opponent + 1) %% 3 * 3,\n      score = self + outcome\n    ) |&gt;\n    pull(score) |&gt;\n    sum()\n}\n\nRun puzzle input:\n\nscore_shape(df)\n\n[1] 15422",
+    "text": "Part 1\n\nfind_marker &lt;- function(df, marker_length) {\n  df |&gt; \n    # Construct sequences of next n chars and count # of unique chars in each\n    transmute(\n      marker_idx = idx + marker_length - 1,\n      char_seq = reduce(\n        .x = map(0:(marker_length - 1), ~ lead(char, n = .x)),\n        .f = str_c\n      ),\n      n_unique = map_int(\n        char_seq,\n        ~ .x |&gt;\n          str_split(\"\") |&gt;\n          unlist() |&gt;\n          unique() |&gt;\n          length()\n      )\n    ) |&gt;\n\n    # Extract first instance where all n chars are unique\n    filter(n_unique == marker_length) |&gt;\n    pull(marker_idx) |&gt;\n    min()\n}\n\n\nfind_marker(input, marker_length = 4)\n\n[1] 1802",
     "crumbs": [
       "2022",
-      "Day 2"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2022/R/day02.html#part-2",
-    "href": "2022/R/day02.html#part-2",
-    "title": "Day 2",
+    "objectID": "2022/R/day06.html#part-2",
+    "href": "2022/R/day06.html#part-2",
+    "title": "Day 6",
     "section": "Part 2",
-    "text": "Part 2\n\nscore_outcome &lt;- function(df) {\n  df |&gt; \n    mutate(\n      self = (opponent + strategy) %% 3 + 1,\n      outcome = (strategy - 1) * 3,\n      score = self + outcome\n    ) |&gt;\n    pull(score) |&gt;\n    sum()\n}\n\n\nscore_outcome(df)\n\n[1] 15442",
+    "text": "Part 2\n\nfind_marker(input, marker_length = 14)\n\n[1] 3551",
     "crumbs": [
       "2022",
-      "Day 2"
+      "Day 6"
     ]
   },
   {
-    "objectID": "2022/R/day15.html",
-    "href": "2022/R/day15.html",
-    "title": "Day 15",
+    "objectID": "2022/R/day03.html",
+    "href": "2022/R/day03.html",
+    "title": "Day 3",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\nlibrary(sf)\n\ntheme_set(theme_bw())\n\n# Read input from text and extract numeric values into a data frame\ninput &lt;- read_lines(\"../input/day15.txt\") |&gt; \n  unglue_data(\n    \"Sensor at x={s_x}, y={s_y}: closest beacon is at x={b_x}, y={b_y}\",\n    convert = TRUE\n  )",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\"../input/day03.txt\", col_names = \"str\")",
     "crumbs": [
       "2022",
-      "Day 15"
+      "Day 3"
     ]
   },
   {
-    "objectID": "2022/R/day15.html#setup",
-    "href": "2022/R/day15.html#setup",
-    "title": "Day 15",
+    "objectID": "2022/R/day03.html#setup",
+    "href": "2022/R/day03.html#setup",
+    "title": "Day 3",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\nlibrary(sf)\n\ntheme_set(theme_bw())\n\n# Read input from text and extract numeric values into a data frame\ninput &lt;- read_lines(\"../input/day15.txt\") |&gt; \n  unglue_data(\n    \"Sensor at x={s_x}, y={s_y}: closest beacon is at x={b_x}, y={b_y}\",\n    convert = TRUE\n  )",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\"../input/day03.txt\", col_names = \"str\")",
     "crumbs": [
       "2022",
-      "Day 15"
+      "Day 3"
     ]
   },
   {
-    "objectID": "2022/R/day15.html#part-1",
-    "href": "2022/R/day15.html#part-1",
-    "title": "Day 15",
+    "objectID": "2022/R/day03.html#part-1",
+    "href": "2022/R/day03.html#part-1",
+    "title": "Day 3",
     "section": "Part 1",
-    "text": "Part 1\nConvert input into a list of beacons, sensors, and total detection distances:\n\nsensors &lt;- input |&gt; \n  distinct(\n    s_x, \n    s_y, \n    max_dist = abs(b_x - s_x) + abs(b_y - s_y)\n  )\n\nbeacons &lt;- input |&gt; \n  distinct(x = b_x, y = b_y)\n\nGenerate a set of polygons that defines the regions detectible by each sensor:\n\n# Convert each sensor's detection distance into a region defined by a polygon\npoly &lt;- sensors |&gt; \n  mutate(\n    polygon = pmap(list(s_x, s_y, max_dist), function(x, y, dist) {\n      rbind(\n        c(x - dist, y),\n        c(x, y - dist),\n        c(x + dist, y),\n        c(x, y + dist),\n        c(x - dist, y)\n      ) |&gt; \n        list() |&gt; \n        st_polygon()\n    }),\n    geometry = st_sfc(polygon)\n  ) |&gt; \n  transmute(idx = row_number(), geometry) |&gt; \n  st_as_sf()\n\n# Merge all polygons into a single geometric shape\npoly_union &lt;- st_union(poly)\n\nVisualize:\n\n# Overlapping regions\nggplot() + \n  geom_sf(data = poly, aes(fill = factor(idx))) + \n  scale_fill_viridis_d(guide = \"none\")\n\n\n\n\n\n\n\n# Merged region\nggplot() + \n  geom_sf(data = poly_union)\n\n\n\n\n\n\n\n\nDefine a set of functions to count the number of integer points that cannot have a beacon within the detection region\n\n# Convert a set of x/y boundaries to a spatial rectangle object\npoly_rect &lt;- function(xmin, xmax, ymin, ymax) {\n  rbind(\n    c(xmin, ymax), \n    c(xmin, ymin), \n    c(xmax, ymin), \n    c(xmax, ymax), \n    c(xmin, ymax)\n  ) |&gt; \n    list() |&gt; \n    st_polygon() |&gt; \n    st_sfc()\n}\n\n# Get the coordinates within a poly, optionally limited within x/y bounds\nsf_points_in_poly &lt;- function(poly, xlim = NULL, ylim = NULL) {\n  \n  # Define a rectangular region within which to generate grid points\n  points_region &lt;- poly_rect(\n    xmin = (if (is_null(xlim)) st_bbox(poly)$xmin else head(xlim, 1)) - 0.5, \n    xmax = (if (is_null(xlim)) st_bbox(poly)$xmax else tail(xlim, 1)) + 0.5, \n    ymin = (if (is_null(ylim)) st_bbox(poly)$ymin else head(ylim, 1)) - 0.5,\n    ymax = (if (is_null(ylim)) st_bbox(poly)$ymax else tail(ylim, 1)) + 0.5\n  )\n  \n  # Generate the grid points that sit within the polygon\n  points_region |&gt; \n    st_make_grid(cellsize = 1, what = \"centers\") |&gt; \n    st_intersection(poly) |&gt; \n    \n    # Convert the set of points from spatial objects to x-y coordinates\n    st_coordinates() |&gt; \n    as_tibble() |&gt; \n    mutate(across(everything(), as.integer)) |&gt; \n    rename_with(tolower)\n}\n\n# Count the points in a sf region (with optional x/y lims) that can't be a beacon\ncount_nonbeacon &lt;- function(detection_region, known_beacons, x = NULL, y = NULL) {\n  \n  # Get the set of integer points within the polygon and x-y region specified\n  detection_region |&gt; \n    sf_points_in_poly(xlim = x, ylim = y) |&gt;\n  \n    # Remove known beacons from the list of points and count\n    anti_join(known_beacons, join_by(x, y)) |&gt;\n    nrow()\n}\n\nRun puzzle input:\n\ncount_nonbeacon(poly_union, beacons, y = 2000000)\n\n[1] 5367037",
+    "text": "Part 1\n\ninput |&gt;\n  mutate(\n    # Separate each line into two compartments\n    str_length = str_length(str) / 2,\n    str_1 = str_sub(str, start = 1L, end = str_length),\n    str_2 = str_sub(str, start = str_length + 1, end = -1L),\n\n    # Find the letter in common between each pair of compartments\n    across(c(str_1, str_2), ~ str_split(.x, \"\")),\n    dup = map2_chr(str_1, str_2, ~ intersect(.x, .y)),\n\n    # Convert to priority value\n    priority = match(dup, c(letters, LETTERS))\n  ) |&gt;\n\n  # Compute total sum\n  pull(priority) |&gt;\n  sum()\n\n[1] 8252",
     "crumbs": [
       "2022",
-      "Day 15"
+      "Day 3"
     ]
   },
   {
-    "objectID": "2022/R/day15.html#part-2",
-    "href": "2022/R/day15.html#part-2",
-    "title": "Day 15",
+    "objectID": "2022/R/day03.html#part-2",
+    "href": "2022/R/day03.html#part-2",
+    "title": "Day 3",
     "section": "Part 2",
-    "text": "Part 2\nDefine a function to get the location of an undetected beacon within a viewport:\n\nfind_undetected_beacon &lt;- function(detection_region, xlim, ylim) {\n  boundary &lt;- poly_rect(xlim[1], xlim[2], ylim[1], ylim[2])\n  \n  # Find the polygon region where an undetected beacon could occur\n  undetected_region &lt;- st_difference(boundary, detection_region)\n  \n  # Get all integer points in the region\n  points &lt;- sf_points_in_poly(undetected_region)\n  \n  # Compute the region's boundary points to exclude\n  undetected_region_boundary &lt;- undetected_region |&gt;\n    st_bbox() |&gt;\n    as.list() |&gt;\n    pmap(\\(xmin, xmax, ymin, ymax) poly_rect(xmin, xmax, ymin, ymax)) |&gt;\n    pluck(1) |&gt; \n    st_difference(undetected_region) |&gt; \n    sf_points_in_poly()\n  \n  # Exclude all boundary points from the region\n  anti_join(points, undetected_region_boundary, join_by(x, y))\n  \n}\n\ntuning_freq &lt;- function(x, y) format(4000000 * x + y, scientific = FALSE)\n\nRun on puzzle input:\n\npoint &lt;- find_undetected_beacon(poly_union, c(0, 4000000), c(0, 4000000))\n\ntuning_freq(point$x, point$y)\n\n[1] \"11914583249288\"",
+    "text": "Part 2\n\ninput |&gt;\n\n  # Reshape to one row per group, one column per elf\n  mutate(\n    str = str_split(str, \"\"),\n    group_num = floor((row_number() - 1) / 3),\n    elf_num = as.character(row_number() %% 3)\n  ) |&gt;\n  pivot_wider(names_from = elf_num, values_from = str, names_prefix = \"elf_\") |&gt;\n\n  # Find the character in common between all 3 elves & convert to priority val\n  mutate(\n    dup = pmap_chr(\n      list(elf_0, elf_1, elf_2),\n      ~ reduce(list(..1, ..2, ..3), intersect)\n    ),\n    priority = match(dup, c(letters, LETTERS))\n  ) |&gt;\n\n  # Compute total sum\n  pull(priority) |&gt;\n  sum()\n\n[1] 2828",
     "crumbs": [
       "2022",
-      "Day 15"
+      "Day 3"
     ]
   },
   {
-    "objectID": "2022/R/day14.html",
-    "href": "2022/R/day14.html",
-    "title": "Day 14",
+    "objectID": "2022/R/day01.html",
+    "href": "2022/R/day01.html",
+    "title": "Day 1",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from text\ninput &lt;- read_lines(\"../input/day14.txt\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day01.txt\") |&gt; \n  as.integer()",
     "crumbs": [
       "2022",
-      "Day 14"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2022/R/day14.html#setup",
-    "href": "2022/R/day14.html#setup",
-    "title": "Day 14",
+    "objectID": "2022/R/day01.html#setup",
+    "href": "2022/R/day01.html#setup",
+    "title": "Day 1",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from text\ninput &lt;- read_lines(\"../input/day14.txt\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day01.txt\") |&gt; \n  as.integer()",
     "crumbs": [
       "2022",
-      "Day 14"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2022/R/day14.html#part-1",
-    "href": "2022/R/day14.html#part-1",
-    "title": "Day 14",
+    "objectID": "2022/R/day01.html#part-1",
+    "href": "2022/R/day01.html#part-1",
+    "title": "Day 1",
     "section": "Part 1",
-    "text": "Part 1\nConvert input from rows of text lines to a list of obstacle coordinates:\n\n# Extract numeric values from the input text\ndf &lt;- input |&gt; \n  str_split(\" -&gt; \") |&gt; \n  imap_dfr(\\(input, idx) tibble(idx, input)) |&gt; \n  unglue_unnest(input, \"{x},{y}\", convert = TRUE)\n\n\n# Expand the endpoints into a list of coordinates of every obstacle\nobstacles &lt;- df |&gt; \n  mutate(\n    seq_x = map2(x, lead(x), ~ if (!is.na(.x) & !is.na(.y)) .x:.y),\n    seq_y = map2(y, lead(y), ~ if (!is.na(.x) & !is.na(.y)) .x:.y),\n    .by = idx\n  ) |&gt; \n  unnest(c(seq_x, seq_y)) |&gt; \n  distinct(x = seq_x, y = seq_y) |&gt; \n  mutate(chr = '#')\n\nDefine a function to recursively drop a grain of sand until it comes to rest:\n\ndrop_grain &lt;- function(scan, x_cur, y_cur) {\n  y_new &lt;- y_cur + 1\n  \n  # Check if new y-coordinate is out of bounds\n  if (y_new &gt; max(scan$y))\n    return(scan)\n  \n  for (x_new in c(x_cur, x_cur - 1, x_cur + 1)) {\n    # Check if next x-coordinate is out of bounds\n    if (!between(x_new, min(scan$x), max(scan$x)))\n      return(scan)\n    # If grain can flow into the next spot, recurse into next spot\n    else if (nrow(filter(scan, x == x_new, y == y_new)) == 0)\n      return(drop_grain(scan, x_new, y_new))\n  }\n\n  # If grain has nowhere to go, drop the grain in its current place and exit\n  return(add_row(scan, x = x_cur, y = y_cur, chr = \"o\"))\n}\n\nDefine a function that fills the map with sand one grain at a time, starting from the designated point, until all sand comes to rest:\n\nfill_sand &lt;- function(scan, grain_func) {\n  repeat {\n    scan_new &lt;- grain_func(scan)\n    \n    # If the scan is unchanged after dropping the grain, the sand is at rest. \n    if (nrow(scan_new) == nrow(scan)) break\n    \n    scan &lt;- scan_new\n  }\n  scan\n}\n\ncount_grains &lt;- function(scan) {\n  scan |&gt; \n    filter(chr == \"o\") |&gt; \n    nrow()\n}\n\nCount the grains using the puzzle input:\n\nobstacles |&gt; \n  fill_sand(grain_func = partial(drop_grain, x_cur = 500, y_cur = 0)) |&gt; \n  count_grains()\n\n[1] 862",
+    "text": "Part 1\n\n# Format input as a data frame and number the elves\ndf &lt;- tibble(\n  cal = input,\n  elf_id = cumsum(is.na(cal)) + 1\n) |&gt;\n  filter(!is.na(cal))\n\n# Compute calorie sum for each elf, get the top n elves, and combine totals\ncount_max &lt;- function(df, num_top_elves) {\n  df |&gt; \n    group_by(elf_id) |&gt;\n    summarize(total_cal = sum(cal)) |&gt;\n    slice_max(total_cal, n = num_top_elves) |&gt;\n    pull(total_cal) |&gt;\n    sum()\n}\n\nRun puzzle input:\n\ncount_max(df, 1)\n\n[1] 68787",
     "crumbs": [
       "2022",
-      "Day 14"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2022/R/day14.html#part-2",
-    "href": "2022/R/day14.html#part-2",
-    "title": "Day 14",
+    "objectID": "2022/R/day01.html#part-2",
+    "href": "2022/R/day01.html#part-2",
+    "title": "Day 1",
     "section": "Part 2",
-    "text": "Part 2\nRe-define the drop_grain function to allow for the boundless floor:\n\ndrop_grain &lt;- function(scan, x_cur, y_cur, floor) {\n  y_new &lt;- y_cur + 1\n  \n  # Check if current location already has a grain of sand (entry blocked)\n  if (nrow(filter(scan, x == x_cur, y == y_cur)) &gt; 0)\n    return(scan)\n  \n  # Check if the current sand grain is sitting on top of the floor\n  if (y_new == floor)\n    return(add_row(scan, x = x_cur, y = y_cur, chr = \"o\"))\n  \n  # If grain can flow into the next spot, recurse into next spot\n  for (x_new in c(x_cur, x_cur - 1, x_cur + 1)) {\n    if (nrow(filter(scan, x == x_new, y == y_new)) == 0)\n      return(drop_grain(scan, x_new, y_new, floor))\n  }\n\n  # If grain has nowhere to go, drop the grain in its current place and exit\n  return(add_row(scan, x = x_cur, y = y_cur, chr = \"o\"))\n}\n\nCount the grains using the puzzle input:\n\nobstacles |&gt; \n  fill_sand(\n    grain_func = partial(\n      drop_grain, \n      x_cur = 500, \n      y_cur = 0, \n      floor = max(obstacles$y) + 2\n    )\n  ) |&gt; \n  count_grains()\n\n[1] 28744",
+    "text": "Part 2\n\ncount_max(df, 3)\n\n[1] 198041",
     "crumbs": [
       "2022",
-      "Day 14"
+      "Day 1"
     ]
   },
   {
-    "objectID": "2022/R/day09.html",
-    "href": "2022/R/day09.html",
-    "title": "Day 9",
+    "objectID": "2022/R/day08.html",
+    "href": "2022/R/day08.html",
+    "title": "Day 8",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(ctmle, include.only = \"bound\")\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day09.txt\") |&gt;\n  str_split(\" \")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file and format as a matrix\ninput &lt;- read_fwf(\"../input/day08.txt\") |&gt; \n  transmute(x = str_split(X1, \"\")) |&gt;\n  unnest_wider(x, names_sep = \"\") |&gt;\n  mutate(across(everything(), as.integer)) |&gt;\n  as.matrix()",
     "crumbs": [
       "2022",
-      "Day 9"
+      "Day 8"
     ]
   },
   {
-    "objectID": "2022/R/day09.html#setup",
-    "href": "2022/R/day09.html#setup",
-    "title": "Day 9",
+    "objectID": "2022/R/day08.html#setup",
+    "href": "2022/R/day08.html#setup",
+    "title": "Day 8",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(ctmle, include.only = \"bound\")\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day09.txt\") |&gt;\n  str_split(\" \")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file and format as a matrix\ninput &lt;- read_fwf(\"../input/day08.txt\") |&gt; \n  transmute(x = str_split(X1, \"\")) |&gt;\n  unnest_wider(x, names_sep = \"\") |&gt;\n  mutate(across(everything(), as.integer)) |&gt;\n  as.matrix()",
     "crumbs": [
       "2022",
-      "Day 9"
+      "Day 8"
     ]
   },
   {
-    "objectID": "2022/R/day09.html#part-1",
-    "href": "2022/R/day09.html#part-1",
-    "title": "Day 9",
-    "section": "Part 1",
-    "text": "Part 1\n\n# Convert head movements to sequence of locations on complex plane\nhead_path &lt;- input |&gt;\n  map(~ rep(.x[[1]], .x[[2]])) |&gt;\n  reduce(c) |&gt;\n  recode(\"R\" = 1 + 0i, \"L\" = -1 + 0i, \"U\" = 0 + 1i, \"D\" = 0 - 1i) |&gt;\n  accumulate(.init = 0 + 0i, .f = sum)\n\n# Find path of next knot given path of previous knot.\nmove_next_knot &lt;- function(prev_knot_path) {\n  accumulate(\n    .x = prev_knot_path,\n    .f = function(tail = .x, head = .y) {\n      diff &lt;- head - tail\n      if_else(\n        max(abs(Re(diff)), abs(Im(diff))) &lt;= 1,\n        tail,\n        tail + bound(Re(diff), c(-1, 1)) + bound(Im(diff), c(-1, 1)) * 1i\n      )\n    }\n  )\n}\n\n\nunique_tail_spots &lt;- function(path, num_knots) {\n  # Iteratively compute path of each knot from head & to tail\n  move_tail &lt;- reduce(map(1:(num_knots - 1), ~ move_next_knot), compose)\n\n  # Find number of unique locations in the tail's path\n  length(unique(move_tail(path)))\n}\n\n\nunique_tail_spots(head_path, num_knots = 2)\n\n[1] 6197",
+    "objectID": "2022/R/day08.html#parts-1-2",
+    "href": "2022/R/day08.html#parts-1-2",
+    "title": "Day 8",
+    "section": "Parts 1 & 2",
+    "text": "Parts 1 & 2\n\n# Create df with one row per tree and variables for its containing row & col\nexpand_grid(\n  col_pos = 1:nrow(input),\n  row_pos = 1:ncol(input)\n) |&gt;\n  mutate(\n    tree_idx = row_number(),\n    row_list = map(col_pos, ~ unname(as.matrix(input)[.x, ])),\n    col_list = map(row_pos, ~ unname(as.matrix(input)[, .x])),\n  ) |&gt;\n\n  # For each tree, construct its treeline looking outward in each direction\n  pivot_longer(\n    c(col_pos, row_pos, col_list, row_list),\n    names_to = c(\"axis\", \".value\"),\n    names_sep = \"_\"\n  ) |&gt;\n  mutate(\n    split = map2(\n      list,\n      pos,\n      ~ split(.x, c(rep(\"bwd\", .y - 1), \"curr_tree\", rep(\"fwd\", length(.x) - .y)))\n    )\n  ) |&gt;\n  unnest_wider(split) |&gt;\n  mutate(bwd = map(bwd, rev)) |&gt;\n  pivot_longer(c(fwd, bwd), names_to = \"dir\", values_to = \"treeline\") |&gt;\n\n  # Check if each is the tallest tree in each direction & count visible trees\n  mutate(\n    is_tallest = map2_lgl(curr_tree, treeline, ~ all(.x &gt; .y)),\n    num_visible = map2_int(curr_tree, treeline, function(curr_tree, treeline) {\n      ifelse(\n        every(treeline, ~.x &lt; curr_tree),\n        length(treeline),\n        detect_index(treeline, ~ .x &gt;= curr_tree)\n      )\n    })\n  ) |&gt;\n\n  # Summarize visibility & scenic scores from all 4 directions for each tree\n  group_by(tree_idx) |&gt;\n  summarize(\n    is_visible = any(is_tallest),\n    scenic_score = prod(num_visible)\n  ) |&gt;\n  ungroup() |&gt;\n\n  # Compute total trees visible from forest edge & max scenic score in forest\n  summarize(\n    total_visible = sum(is_visible),\n    max_scenic_score = max(scenic_score)\n  )\n\n# A tibble: 1 × 2\n  total_visible max_scenic_score\n          &lt;int&gt;            &lt;dbl&gt;\n1          1690           535680",
     "crumbs": [
       "2022",
-      "Day 9"
+      "Day 8"
     ]
   },
   {
-    "objectID": "2022/R/day09.html#part-2",
-    "href": "2022/R/day09.html#part-2",
-    "title": "Day 9",
+    "objectID": "2024/R/day10.html",
+    "href": "2024/R/day10.html",
+    "title": "Day 10",
+    "section": "",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day10.txt\", skip_empty_rows = TRUE)\n\n# Convert input to matrix format\nmtx &lt;- input |&gt; \n  str_split(\"\") |&gt;\n  unlist() |&gt; \n  as.integer() |&gt; \n  matrix(nrow = length(input), byrow = TRUE)",
+    "crumbs": [
+      "2024",
+      "Day 10"
+    ]
+  },
+  {
+    "objectID": "2024/R/day10.html#setup",
+    "href": "2024/R/day10.html#setup",
+    "title": "Day 10",
+    "section": "",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day10.txt\", skip_empty_rows = TRUE)\n\n# Convert input to matrix format\nmtx &lt;- input |&gt; \n  str_split(\"\") |&gt;\n  unlist() |&gt; \n  as.integer() |&gt; \n  matrix(nrow = length(input), byrow = TRUE)",
+    "crumbs": [
+      "2024",
+      "Day 10"
+    ]
+  },
+  {
+    "objectID": "2024/R/day10.html#part-1",
+    "href": "2024/R/day10.html#part-1",
+    "title": "Day 10",
+    "section": "Part 1",
+    "text": "Part 1\nDefine custom functions:\n\n# North / South / East / West\ndirs &lt;- list(c(0,  1), c(0, -1), c(1,  0), c(-1,  0))\n\n# Check if a coordinate is in the bounds of the map\nin_bounds &lt;- function(x, map) {\n  between(x[1], 1, nrow(map)) & between(x[2], 1, ncol(map))\n}\n\nfind_trail_ends &lt;- function(cur_coord, map) {\n  \n  # If the trailhead has been reached, return its coordinate.\n  if (map[cur_coord] == 9)\n    return(list(cur_coord))\n  \n  # Define the possible next steps within the map bounds\n  next_steps &lt;- dirs |&gt; \n    map(~ cur_coord + .x) |&gt; \n    keep(~ in_bounds(.x, map))\n  \n  trail_ends &lt;- list()\n  \n  # If the next step leads to a valid path, add its terminal to the list\n  for (next_coord in next_steps) {\n    if (map[next_coord] == map[cur_coord] + 1) \n      trail_ends &lt;- c(trail_ends, find_trail_ends(next_coord, map))\n  }\n  \n  return(unique(trail_ends))\n}\n\nscore_trail &lt;- function(trailhead, map) length(find_trail_ends(trailhead, map))\n\n\n# Get a list of coordinates of all of the trailheads\ntrailheads &lt;- which(mtx == 0, arr.ind = TRUE)\ntrailheads_list &lt;- map(\n  1:nrow(trailheads), \n  ~ array(trailheads[.x,], dim = c(1, 2))\n)\n\n# Score each trailhead and sum the total\ntrailheads_list |&gt; \n  map_int(~ score_trail(.x, mtx)) |&gt; \n  sum()\n\n[1] 531",
+    "crumbs": [
+      "2024",
+      "Day 10"
+    ]
+  },
+  {
+    "objectID": "2024/R/day10.html#part-2",
+    "href": "2024/R/day10.html#part-2",
+    "title": "Day 10",
     "section": "Part 2",
-    "text": "Part 2\n\nunique_tail_spots(head_path, num_knots = 10)\n\n[1] 2562",
+    "text": "Part 2\nModify the trail rating function:\n\nrate_trail &lt;- function(cur_coord, map) {\n  # If the trailhead has been reached, increment the score and exit.\n  if (map[cur_coord] == 9)\n    return(1)\n  \n  # Define the possible next steps within the map bounds\n  next_steps &lt;- dirs |&gt; \n    map(~ cur_coord + .x) |&gt; \n    keep(~ in_bounds(.x, map))\n  \n  # Sum the trail ratings of all valid next steps\n  map_int(\n    next_steps,\n    ~ if (map[.x] == map[cur_coord] + 1) rate_trail(.x, map) else 0\n  ) |&gt; \n    sum()\n}\n\nRe-run the puzzle input:\n\ntrailheads_list |&gt; \n  map_int(~ rate_trail(.x, mtx)) |&gt; \n  sum()\n\n[1] 1210",
     "crumbs": [
-      "2022",
-      "Day 9"
+      "2024",
+      "Day 10"
     ]
   },
   {
-    "objectID": "2024/R/day04.html",
-    "href": "2024/R/day04.html",
-    "title": "Day 4",
+    "objectID": "2024/R/day05.html",
+    "href": "2024/R/day05.html",
+    "title": "Day 5",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day04.txt\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day05.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 4"
+      "Day 5"
     ]
   },
   {
-    "objectID": "2024/R/day04.html#setup",
-    "href": "2024/R/day04.html#setup",
-    "title": "Day 4",
+    "objectID": "2024/R/day05.html#setup",
+    "href": "2024/R/day05.html#setup",
+    "title": "Day 5",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day04.txt\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day05.txt\", skip_empty_rows = TRUE)",
     "crumbs": [
       "2024",
-      "Day 4"
+      "Day 5"
     ]
   },
   {
-    "objectID": "2024/R/day04.html#part-1",
-    "href": "2024/R/day04.html#part-1",
-    "title": "Day 4",
+    "objectID": "2024/R/day05.html#part-1",
+    "href": "2024/R/day05.html#part-1",
+    "title": "Day 5",
     "section": "Part 1",
-    "text": "Part 1\n\n# Convert vector of text to matrix\ntxt_to_mtx &lt;- function(txt) {\n  txt |&gt; \n    str_split(\"\") |&gt; \n    unlist() |&gt; \n    matrix(nrow = length(txt), byrow = TRUE)\n}\n\n# Convert matrix to vector of text\nmtx_to_txt &lt;- function(mtx) {\n  mtx |&gt; \n    t() |&gt; \n    as_tibble() |&gt; \n    as.list() |&gt; \n    map(str_flatten) |&gt; \n    unlist() |&gt; \n    unname()\n}\n\n# Transpose a vector of text\ntranspose_txt &lt;- function(txt) {\n  txt |&gt; \n    txt_to_mtx() |&gt; \n    t() |&gt; \n    mtx_to_txt()\n}\n\n# Get rows and columns of input as individual text vectors\nrows &lt;- input\ncols &lt;- transpose_txt(rows)\n\n# Convert diagonals of input as individual text vectors\npad &lt;- map_chr(\n  1:length(rows), \n  ~ str_c(rep_len(\" \", .x - 1), collapse = \"\")\n)\n\ndiag1 &lt;- str_c(pad, rows, rev(pad)) |&gt; \n  transpose_txt()\ndiag2 &lt;- str_c(rev(pad), rows, pad) |&gt; \n  transpose_txt()\n\n# Loop over rows, columns, and diagnoals and count occurrences of \"XMAS\"\nmap_int(\n  list(rows, cols, diag1, diag2),\n  ~ sum(str_count(.x, \"XMAS\") + str_count(.x, \"SAMX\"))\n) |&gt; \n  sum()\n\n[1] 2599",
+    "text": "Part 1\n\n# Extract page ordering rules from input\nrule_list &lt;- input |&gt; \n  keep(~ str_detect(.x, \"\\\\|\")) |&gt; \n  as_tibble_col(column_name = \"rule\") |&gt; \n  separate(rule, into = c(\"p1\", \"p2\")) |&gt; \n  mutate(rule_num = row_number(), .before = everything()) |&gt; \n  mutate(across(c(p1, p2), parse_number))\n\n# Extract page sequences from input\npages &lt;- input |&gt; \n  discard(~ str_detect(.x, \"\\\\|\")) |&gt; \n  str_split(\",\") |&gt; \n  map(parse_number) |&gt; \n  as_tibble_col(column_name = \"update\")\n\n# Sort a given vector by its applicable rules\nsort_by_rules &lt;- function(seq) {\n  active_rules &lt;- rule_list |&gt; \n    filter(p1 %in% seq & p2 %in% seq)\n  \n  repeat {\n    swap_occurred &lt;- FALSE\n    for (i in 1:nrow(active_rules)) {\n      rule &lt;- filter(active_rules, row_number() == i)\n      idx1 &lt;- which(seq == rule$p1)\n      idx2 &lt;- which(seq == rule$p2)\n      \n      if (idx1 &gt; idx2) {\n        seq[[idx1]] &lt;- rule$p2\n        seq[[idx2]] &lt;- rule$p1\n        swap_occurred &lt;- TRUE\n      }\n    }\n    if (!swap_occurred) return(seq)\n  }\n}\n\n# Sort all page sequences and extract the center page of each result\noutput &lt;- pages |&gt; \n  mutate(\n    resorted = map(update, sort_by_rules),\n    is_sorted = map2_lgl(update, resorted, identical),\n    center_page = map_int(resorted, ~ .x[(length(.x) + 1) / 2])\n  )\n\n\n# For the properly-ordered updates, sum the center page numbers\noutput |&gt;\n  filter(is_sorted) |&gt; \n  pull(center_page) |&gt; \n  sum()\n\n[1] 6505",
     "crumbs": [
       "2024",
-      "Day 4"
+      "Day 5"
     ]
   },
   {
-    "objectID": "2024/R/day04.html#part-2",
-    "href": "2024/R/day04.html#part-2",
-    "title": "Day 4",
+    "objectID": "2024/R/day05.html#part-2",
+    "href": "2024/R/day05.html#part-2",
+    "title": "Day 5",
     "section": "Part 2",
-    "text": "Part 2\n\n# Define the four possible XMAS patterns in a 3x3 grid as a regex string\nxmas1 &lt;- \"M.S.A.M.S\"\nxmas4 &lt;- \"S.M.A.S.M\"\nxmas2 &lt;- \"S.S.A.M.M\"\nxmas3 &lt;- \"M.M.A.S.S\"\nxmas_regex &lt;- glue::glue(\"{xmas1}|{xmas2}|{xmas3}|{xmas4}\")\n\n# Convert input into a matrix\nmtx &lt;- txt_to_mtx(input)\n\n# Extract every 3x3 submatrix in the input text block as a text string\nmap(\n  1:(nrow(mtx) - 2),\n  function(row_start) {\n    map_chr(\n      1:(ncol(mtx) - 2),\n      function(col_start) {\n        mtx[row_start:(row_start + 2), col_start:(col_start + 2)] |&gt; \n          mtx_to_txt() |&gt; \n          str_flatten()\n      }\n    )\n  }\n) |&gt; \n  unlist() |&gt; \n  \n  # Count the text strings with a valid XMAS pattern\n  str_detect(xmas_regex) |&gt; \n  sum()\n\n[1] 1948",
+    "text": "Part 2\n\n# For the improperly-ordered updates, sum their sorted center pages\noutput |&gt;\n  filter(!is_sorted) |&gt; \n  pull(center_page) |&gt; \n  sum()\n\n[1] 6897",
     "crumbs": [
       "2024",
-      "Day 4"
+      "Day 5"
     ]
   },
   {
-    "objectID": "2024/R/day11.html",
-    "href": "2024/R/day11.html",
-    "title": "Day 11",
+    "objectID": "2024/R/day07.html",
+    "href": "2024/R/day07.html",
+    "title": "Day 7",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split_1(\" \") |&gt; \n  as.integer()",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split(\" \") |&gt; \n  map(parse_number)",
     "crumbs": [
       "2024",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2024/R/day11.html#setup",
-    "href": "2024/R/day11.html#setup",
-    "title": "Day 11",
+    "objectID": "2024/R/day07.html#setup",
+    "href": "2024/R/day07.html#setup",
+    "title": "Day 7",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day11.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split_1(\" \") |&gt; \n  as.integer()",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day07.txt\", skip_empty_rows = TRUE) |&gt; \n  str_split(\" \") |&gt; \n  map(parse_number)",
     "crumbs": [
       "2024",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2024/R/day11.html#part-1",
-    "href": "2024/R/day11.html#part-1",
-    "title": "Day 11",
+    "objectID": "2024/R/day07.html#part-1",
+    "href": "2024/R/day07.html#part-1",
+    "title": "Day 7",
     "section": "Part 1",
-    "text": "Part 1\nCreate blink functions:\n\nblink &lt;- function(x) {\n  char &lt;- format(x, scientific = FALSE)\n  n &lt;- str_length(char)\n  \n  if (x == 0) \n    1\n  else if (n %% 2 == 0)\n    parse_number(c(\n      str_sub(char, 1, n / 2),\n      str_sub(char, n / 2 + 1, n)\n    ))\n  else \n    x * 2024\n}\n\nblink_n &lt;- function(df, n) {\n  if (n == 0)\n    return(sum(df$n))\n  \n  df |&gt; \n    mutate(stones = map(stones, blink)) |&gt; \n    unnest(stones) |&gt; \n    summarize(n = sum(n), .by = stones) |&gt; \n    blink_n(n - 1)\n}\n\nRun blink function 25 times on puzzle input:\n\ndf &lt;- tibble(stones = input, n = 1)\n\nblink_n(df, 25)\n\n[1] 193899",
+    "text": "Part 1\nDefine calibration functions:\n\ncalibrate_operators &lt;- function(seq, target, operators) {\n  \n  # If the end of the list has been reached or the target is already overshot, exit\n  if (length(seq) == 1) \n    return(seq == target)\n  else if (seq[1] &gt; target)\n    return(FALSE)\n  \n  # Recursively compare the first two items of the seq using each operator\n  map_lgl(\n    operators,\n    \\(f) {\n      new_start &lt;- get(f)(seq[1], seq[2])\n      new_seq &lt;- c(new_start, tail(seq, -2))\n      calibrate_operators(new_seq, target, operators)\n    }\n  ) |&gt; \n    # If any output is true, the output has been calibrated.\n    any()\n}\n\ncalibration_value &lt;- function(input, output, operators) {\n  # Compute calibration for each input-output pair\n  is_calibrated &lt;- map2_lgl(\n    input, \n    output, \n    ~ calibrate_operators(.x, .y, operators = operators)\n  )\n  \n  # Sum the calibrated outputs\n  output |&gt; \n    keep(is_calibrated) |&gt; \n    sum() |&gt; \n    format(scientific = FALSE)\n}\n\nCompute calibration of the puzzle input:\n\ninput_values  &lt;- map(input, tail, -1)\noutput_values &lt;- map_dbl(input, head, 1)\n  \ncalibration_value(input_values, output_values, c(\"+\", \"*\"))\n\n[1] \"12940396350192\"",
     "crumbs": [
       "2024",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2024/R/day11.html#part-2",
-    "href": "2024/R/day11.html#part-2",
-    "title": "Day 11",
+    "objectID": "2024/R/day07.html#part-2",
+    "href": "2024/R/day07.html#part-2",
+    "title": "Day 7",
     "section": "Part 2",
-    "text": "Part 2\nRun blink function 75 times on puzzle input:\n\nblink_n(df, 75) |&gt; \n  format(scientific = FALSE)\n\n[1] \"229682160383225\"",
+    "text": "Part 2\nAdd a new concatenation operator and re-run the calibration on the puzzle input\n\nconcat &lt;- function(x, y) as.numeric(str_c(x, y))\n\ncalibration_value(input_values, output_values, c(\"+\", \"*\", \"concat\"))\n\n[1] \"106016735664498\"",
     "crumbs": [
       "2024",
-      "Day 11"
+      "Day 7"
     ]
   },
   {
-    "objectID": "2024/R/day13.html",
-    "href": "2024/R/day13.html",
-    "title": "Day 13",
+    "objectID": "2024/R/day12.html",
+    "href": "2024/R/day12.html",
+    "title": "Day 12",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day13.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file into a data frame\ninput &lt;- read_table(\"../input/day12.txt\", col_names = \"chr\") |&gt; \n  mutate(\n    row = row_number(),\n    chr = str_split(chr, \"\")\n  ) |&gt; \n  unnest(chr) |&gt; \n  mutate(col = row_number(), .by = row) |&gt; \n  mutate(idx = row_number(), .before = everything())",
     "crumbs": [
       "2024",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2024/R/day13.html#setup",
-    "href": "2024/R/day13.html#setup",
-    "title": "Day 13",
+    "objectID": "2024/R/day12.html#setup",
+    "href": "2024/R/day12.html#setup",
+    "title": "Day 12",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day13.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file into a data frame\ninput &lt;- read_table(\"../input/day12.txt\", col_names = \"chr\") |&gt; \n  mutate(\n    row = row_number(),\n    chr = str_split(chr, \"\")\n  ) |&gt; \n  unnest(chr) |&gt; \n  mutate(col = row_number(), .by = row) |&gt; \n  mutate(idx = row_number(), .before = everything())",
     "crumbs": [
       "2024",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2024/R/day13.html#part-1",
-    "href": "2024/R/day13.html#part-1",
-    "title": "Day 13",
+    "objectID": "2024/R/day12.html#part-1",
+    "href": "2024/R/day12.html#part-1",
+    "title": "Day 12",
     "section": "Part 1",
-    "text": "Part 1\nExtract numerical values from input text:\n\ndf &lt;- input |&gt; \n  unglue_data(c(\n    \"Button {button}: X+{x=\\\\d+}, Y+{y=\\\\d+}\",\n    \"{button}: X={x=\\\\d+}, Y={y=\\\\d+}\"\n  )) |&gt; \n  mutate(\n    machine_id = floor((row_number() - 1) / 3),\n    across(c(x, y), parse_number),\n    .before = everything()\n  ) |&gt; \n  pivot_wider(names_from = button, values_from = c(x, y))\n\nDefine a function to convert numeric equation input and output token counts:\n\ncompute_tokens &lt;- function(df) {\n  \n  # Convert each machine's properties into a system of equations and solve.\n  soln &lt;- df |&gt; \n    nest(coeff = c(x_A, x_B, y_A, y_B)) |&gt; \n    nest(intercept = c(x_Prize, y_Prize)) |&gt; \n    mutate(\n      coeff = map(coeff, ~ matrix(as.numeric(.x), nrow = 2, byrow = TRUE)),\n      intercept = map(intercept, as.numeric),\n      soln = map2(\n        coeff, \n        intercept, \n        ~ solve(.x, .y) |&gt; \n          set_names(\"A\", \"B\") |&gt; \n          as_tibble_row()\n      )\n    ) |&gt; \n    unnest(soln) |&gt; \n    select(machine_id, A, B)\n  \n  \n  # Check that the solution is two whole numbers, then sum the token cost\n  soln |&gt; \n    mutate(\n      across(\n        c(A, B), \n        ~ near(.x, abs(round(.x)), tol = 0.001), \n        .names = \"{.col}_valid\"\n      ),\n      win = A_valid & B_valid,\n      tokens = if_else(win, 3 * A + B, 0)\n    ) |&gt; \n    pull(tokens) |&gt; \n    sum()\n}\n\nRun function on puzzle input:\n\ncompute_tokens(df)\n\n[1] 31623",
+    "text": "Part 1\nFormat the input as a graph, with edges connecting neighbors of the same type:\n\n# Flag neighboring characters of the same value that border one other\nedges_wide &lt;- input |&gt; \n  mutate(v = case_when(row + 1 == lead(row) ~ lead(idx)), .by = c(chr, col)) |&gt; \n  mutate(h = case_when(col + 1 == lead(col) ~ lead(idx)), .by = c(chr, row))\n\nedges_long &lt;- edges_wide |&gt; \n  pivot_longer(\n    c(v, h), \n    names_to = NULL, \n    values_to = \"target\", \n    values_drop_na = TRUE\n  )\n\n# Format neighbors as a list of edges and add to add a graph\ng &lt;- edges_long |&gt; \n  transmute(\n    edge_id = row_number(),\n    src = idx, \n    target\n  ) |&gt; \n  pivot_longer(c(src, target)) |&gt; \n  arrange(edge_id, value) |&gt; \n  pull(value) |&gt; \n  make_graph(n = nrow(input), directed = FALSE)\n\nV(g)$name &lt;- 1:nrow(input)\n\n# Separate out the resulting graph into sub-graphs of innerconnected regions\ndg &lt;- decompose(g)\n\nCompute the perimeter, area, and cost of each subgraph then sum the total:\n\ndg |&gt; \n  map_int(\\(subgraph) {\n    perim &lt;- sum(4 - degree(subgraph))\n    area  &lt;- gorder(subgraph)\n    perim * area\n  }) |&gt; \n  sum()\n\n[1] 1433460",
     "crumbs": [
       "2024",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2024/R/day13.html#part-2",
-    "href": "2024/R/day13.html#part-2",
-    "title": "Day 13",
+    "objectID": "2024/R/day12.html#part-2",
+    "href": "2024/R/day12.html#part-2",
+    "title": "Day 12",
     "section": "Part 2",
-    "text": "Part 2\nAdd 10000000000000 to each prize intercept and re-compute:\n\ndf |&gt; \n  mutate(across(c(x_Prize, y_Prize), ~ .x + 10000000000000)) |&gt; \n  compute_tokens() |&gt; \n  format(scientific = FALSE)\n\n[1] \"93209116744825\"",
+    "text": "Part 2\nUsed a hint from reddit: the number of corners is equal to the number of sides.\nA plot can have a convex corner or a concave corner.\n\nA cell has a convex corner for each pair of adjacent borders\nA cell has a concave corner if it has two adjacent cells of its same group, but its diagonal cell between the two has a different group.\n\n\n# Get original row/column input and join on the group output from the graph\ngroups &lt;- left_join(\n  input,\n  imap_dfr(dg, \\(g, grp_idx) tibble(grp = grp_idx, idx = V(g)$name)),\n  join_by(idx)\n) |&gt; \n  select(idx, grp, row, col)\n\n# For each of a cell's neighbors, flag if they're in the same group\nneighbors &lt;- groups |&gt; \n  # Get group number of each adjacent cell (N/S/E/W)\n  left_join(transmute(groups, n = grp, row = row + 1, col), join_by(row, col)) |&gt; \n  left_join(transmute(groups, w = grp, col = col + 1, row), join_by(row, col)) |&gt; \n  left_join(transmute(groups, s = grp, row = row - 1, col), join_by(row, col)) |&gt; \n  left_join(transmute(groups, e = grp, col = col - 1, row), join_by(row, col)) |&gt; \n  # Get group number of each diagonal cell (NW/NE/SW/SE)\n  left_join(transmute(groups, nw = grp, row = row + 1, col = col + 1), join_by(row, col)) |&gt; \n  left_join(transmute(groups, ne = grp, row = row + 1, col = col - 1), join_by(row, col)) |&gt; \n  left_join(transmute(groups, sw = grp, row = row - 1, col = col + 1), join_by(row, col)) |&gt; \n  left_join(transmute(groups, se = grp, row = row - 1, col = col - 1), join_by(row, col)) |&gt; \n  select(-c(row, col)) |&gt; \n  # Compare group numbers of adjacent/diagonal cells to the current cell\n  mutate(across(c(n, w, s, e, nw, ne, sw, se), ~ replace_na(.x == grp, FALSE)))\n\n# Compute total number of concave/convex corners for each cell\ncorners &lt;- neighbors |&gt; \n  mutate(\n    convex = (!n & !w) + (!s & !w) + (!s & !e) + (!n & !e),\n    concave = (n & w & !nw) + (s & w & !sw) + (s & e & !se) + (n & e & !ne)\n  )\n\nTotal the number of corners per group and multiply by the group’s area to get the total cost:\n\ncorners |&gt; \n  summarize(\n    area = n(),\n    num_sides = sum(convex + concave), \n    .by = grp\n  ) |&gt; \n  mutate(cost = area * num_sides) |&gt; \n  pull(cost) |&gt; \n  sum()\n\n[1] 855082",
     "crumbs": [
       "2024",
-      "Day 13"
+      "Day 12"
     ]
   },
   {
-    "objectID": "2024/R/day06.html",
-    "href": "2024/R/day06.html",
-    "title": "Day 6",
+    "objectID": "2024/R/day02.html",
+    "href": "2024/R/day02.html",
+    "title": "Day 2",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day02.txt\") |&gt; \n  map(~parse_number(str_split_1(.x, \" \")))",
     "crumbs": [
       "2024",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2024/R/day06.html#setup",
-    "href": "2024/R/day06.html#setup",
-    "title": "Day 6",
+    "objectID": "2024/R/day02.html#setup",
+    "href": "2024/R/day02.html#setup",
+    "title": "Day 2",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day06.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day02.txt\") |&gt; \n  map(~parse_number(str_split_1(.x, \" \")))",
     "crumbs": [
       "2024",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2024/R/day06.html#part-1",
-    "href": "2024/R/day06.html#part-1",
-    "title": "Day 6",
+    "objectID": "2024/R/day02.html#part-1",
+    "href": "2024/R/day02.html#part-1",
+    "title": "Day 2",
     "section": "Part 1",
-    "text": "Part 1\n\n# Guard functions --------------------------------------------------------------\nguards &lt;- c(\"^\", \"&gt;\", \"v\", \"&lt;\")\nguard_shift &lt;- c(tail(guards, -1), head(guards, 1))\n\nrotate_guard &lt;- function(cur) guard_shift[guards == cur]\n\nguard_dir &lt;- function(char) {\n  case_match(char,\n    \"^\" ~ matrix(c(-1,  0), nrow = 1),\n    \"&gt;\" ~ matrix(c( 0,  1), nrow = 1),\n    \"v\" ~ matrix(c( 1,  0), nrow = 1),\n    \"&lt;\" ~ matrix(c( 0, -1), nrow = 1)\n  )\n}\n\nin_bounds &lt;- function(coord, mtx) {\n  between(coord[1], 1, nrow(mtx)) & between(coord[2], 1, ncol(mtx))\n}\n\nmap_path &lt;- function(mtx) {\n\n  # Initiate guard's starting position and direction\n  cur_char  &lt;- keep(mtx, ~ .x %in% guards)\n  cur_coord &lt;- which(mtx == cur_char, arr.ind = TRUE)\n  cur_dir   &lt;- guard_dir(cur_char)\n  \n  # As long as the guard is in bounds, iteratively update its coords and direction\n  repeat {\n    next_coord &lt;- cur_coord + cur_dir\n    \n    # If next step is out-of-bounds, update matrix and exit\n    if (!in_bounds(next_coord, mtx)) {\n      mtx[cur_coord] &lt;- \"X\"\n      break\n    }\n    # If next step is an obstacle, rotate the guard\n    else if (mtx[next_coord] == '#') {\n      cur_char &lt;- rotate_guard(cur_char)\n      cur_dir  &lt;- guard_dir(cur_char)\n    }\n    # Otherwise advance the guard forward\n    else {\n      mtx[cur_coord] &lt;- \"X\"\n      cur_coord &lt;- next_coord\n    }\n  }\n  \n  mtx\n}\n\n\n# Convert input into a matrix\nmtx &lt;- input |&gt; \n  str_split(\"\") |&gt; \n  unlist() |&gt; \n  matrix(nrow = length(input), byrow = TRUE)\n\n# Map the guard's path\nguard_path &lt;- map_path(mtx)\n\n# Count distinct positions visited\nsum(guard_path == \"X\")",
+    "text": "Part 1\n\n# Compute difference between consecutive integers\nseq_gaps &lt;- function(seq)\n  head(lead(seq) - seq, -1)\n\n# Check whether the sequence is incr/decr with gaps between 1 and 3\ngaps_are_valid &lt;- function(gaps)\n  (all(gaps &lt; 0) | all(gaps &gt; 0)) & all(between(abs(gaps), 1, 3))\n\n# Count number of safe reports\ninput |&gt; \n  map(seq_gaps) |&gt; \n  map_lgl(gaps_are_valid) |&gt; \n  sum()\n\n[1] 306",
     "crumbs": [
       "2024",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2024/R/day06.html#part-2",
-    "href": "2024/R/day06.html#part-2",
-    "title": "Day 6",
+    "objectID": "2024/R/day02.html#part-2",
+    "href": "2024/R/day02.html#part-2",
+    "title": "Day 2",
     "section": "Part 2",
-    "text": "Part 2\nChange the path mapping function to test for loops\n\npath_loops &lt;- function(mtx) {\n\n  # Initiate guard's starting position and direction\n  cur_char  &lt;- keep(mtx, ~ .x %in% guards)\n  cur_coord &lt;- which(mtx == cur_char, arr.ind = TRUE)\n  cur_dir   &lt;- guard_dir(cur_char)\n  path_hist &lt;- matrix(\"\", nrow(mtx), ncol(mtx))\n\n  # As long as the guard is in bounds, iteratively update its coords and direction\n  repeat {\n    next_coord &lt;- cur_coord + cur_dir\n    \n    # Check if the guard is looping or if they have left the area\n    if (str_detect(path_hist[cur_coord], fixed(cur_char))) \n      return(TRUE)\n    else if (!in_bounds(next_coord, mtx)) \n      return(FALSE)\n    \n    # If next step is an obstacle, rotate the guard\n    else if (mtx[next_coord] == '#') {\n      # Update path history\n      path_hist[cur_coord] &lt;- str_c(path_hist[cur_coord], cur_char)\n      # Update guard\n      cur_char &lt;- rotate_guard(cur_char)\n      cur_dir  &lt;- guard_dir(cur_char)\n    }\n    # Otherwise advance the guard forward\n    else {\n      # Update path history\n      path_hist[cur_coord] &lt;- str_c(path_hist[cur_coord], cur_char)\n      # Update guard\n      cur_coord &lt;- next_coord\n    }\n  }\n}\n\n\n# Create a variation of the map for each possible obstacle location\nobstacles &lt;- which(guard_path == \"X\" & !(mtx %in% guards))\n\n# Test each obstacle location for loops and sum result\nobstacles |&gt; \n  map(~ replace(mtx, .x, \"#\")) |&gt; \n  map_lgl(path_loops) |&gt; \n  sum()",
+    "text": "Part 2\n\ntibble(input) |&gt; \n  \n  # For each report, create a set of versions where each level is removed\n  mutate(\n    id = row_number(),\n    mod = map(input, \\(seq) map(1:length(seq), \\(n) seq[-c(n)])),\n  ) |&gt; \n  unnest(mod) |&gt; \n  \n  # Check validity of each report and its altered versions\n  mutate(\n    report_is_safe = map_lgl(input, ~ gaps_are_valid(seq_gaps(.x))),\n    mod_is_safe    = map_lgl(mod,   ~ gaps_are_valid(seq_gaps(.x))),\n    is_safe = report_is_safe | mod_is_safe\n  ) |&gt; \n  summarize(is_safe = any(is_safe), .by = id) |&gt; \n  \n  # Count all safe reports\n  summarize(total = sum(is_safe)) |&gt; \n  pull()\n\n[1] 366",
     "crumbs": [
       "2024",
-      "Day 6"
+      "Day 2"
     ]
   },
   {
-    "objectID": "2024/R/day16.html",
-    "href": "2024/R/day16.html",
-    "title": "Day 16",
+    "objectID": "2024/R/day17.html",
+    "href": "2024/R/day17.html",
+    "title": "Day 17",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day16.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day17.txt\", skip_empty_rows = TRUE) |&gt; \n  unglue_data(patterns = c(\n    \"{label}: {value}\"\n  ))",
     "crumbs": [
       "2024",
-      "Day 16"
+      "Day 17"
     ]
   },
   {
-    "objectID": "2024/R/day16.html#setup",
-    "href": "2024/R/day16.html#setup",
-    "title": "Day 16",
+    "objectID": "2024/R/day17.html#setup",
+    "href": "2024/R/day17.html#setup",
+    "title": "Day 17",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(igraph)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day16.txt\", skip_empty_rows = TRUE)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day17.txt\", skip_empty_rows = TRUE) |&gt; \n  unglue_data(patterns = c(\n    \"{label}: {value}\"\n  ))",
     "crumbs": [
       "2024",
-      "Day 16"
+      "Day 17"
     ]
   },
   {
-    "objectID": "2024/R/day16.html#part-1",
-    "href": "2024/R/day16.html#part-1",
-    "title": "Day 16",
+    "objectID": "2024/R/day17.html#part-1",
+    "href": "2024/R/day17.html#part-1",
+    "title": "Day 17",
     "section": "Part 1",
-    "text": "Part 1\nConvert text input into a weighted, undirected graph\n\n# Convert input to a data frame\ndf &lt;- input |&gt; \n  str_split(\"\") |&gt; \n  unlist() |&gt; \n  as_tibble_col(column_name = \"cell\") |&gt; \n  mutate(\n    input_id  = row_number() - 1,\n    row = floor(input_id / length(input)),\n    col = floor(input_id %% length(input))\n  )\n\n# Convert borders between grid cells to graph vertices and map edges by cell\nborders &lt;- df |&gt; \n  mutate(border_e = (cell != \"#\" & lead(cell) != \"#\"), .by = row) |&gt; \n  mutate(border_s = (cell != \"#\" & lead(cell) != \"#\"), .by = col) |&gt; \n  mutate(\n    vtx_id_e = case_when(border_e ~ cumsum(border_e)),\n    vtx_id_s = case_when(border_s ~ cumsum(border_s) + max(vtx_id_e, na.rm = T))\n  ) |&gt; \n  mutate(vtx_id_n = lag(vtx_id_s), .by = col) |&gt; \n  mutate(vtx_id_w = lag(vtx_id_e), .by = row) |&gt; \n  mutate(\n    conn_ns = map2(vtx_id_n, vtx_id_s, ~ na.omit(c(.x, .y))),\n    conn_ew = map2(vtx_id_e, vtx_id_w, ~ na.omit(c(.x, .y))),\n    conn_ne = map2(vtx_id_n, vtx_id_e, ~ na.omit(c(.x, .y))),\n    conn_nw = map2(vtx_id_n, vtx_id_w, ~ na.omit(c(.x, .y))),\n    conn_se = map2(vtx_id_s, vtx_id_e, ~ na.omit(c(.x, .y))),\n    conn_sw = map2(vtx_id_s, vtx_id_w, ~ na.omit(c(.x, .y))),\n  )\n\n# Extract the list of all vertices\nvertices &lt;- c(borders$vtx_id_e, borders$vtx_id_s) |&gt; \n  na.omit() |&gt; \n  sort()\n\n# Convert vertices and edges to an adjacency matrix\nmtx &lt;- borders |&gt; \n  # Unnest lists of edge connections between vertices\n  select(starts_with(\"conn\")) |&gt; \n  pivot_longer(everything(), names_to = \"conn\", names_prefix = \"conn_\") |&gt; \n  unnest_wider(value, names_sep = \"_\") |&gt; \n  drop_na(value_1, value_2) |&gt; \n  # Rotations get an extra 1k added to the weight\n  mutate(weight = case_match(conn, c(\"ns\", \"ew\") ~ 1, .default = 1001)) |&gt; \n  select(-conn) |&gt; \n  # Convert to matrix format, where unconnected vertices have weight 0\n  complete(value_1 = vertices, value_2 = vertices, fill = list(weight = 0)) |&gt; \n  arrange(value_1, value_2) |&gt; \n  pivot_wider(names_from = value_2, values_from = weight) |&gt; \n  column_to_rownames(var = \"value_1\") |&gt; \n  as.matrix()\n\n# Make matrix symmetric (for an undirected graph)\nsym_mtx &lt;- pmax(mtx, t(mtx))\n\n# Convert adjacency matrix to a graph\ng &lt;- graph_from_adjacency_matrix(sym_mtx, mode = \"undirected\", weighted = TRUE)\n\nDetermine possible starting and ending locations from the input\n\nspecial_cells &lt;- borders |&gt; \n  filter(cell %in% c(\"S\", \"E\")) |&gt; \n  select(cell, starts_with(\"vtx_id\")) |&gt; \n  pivot_longer(\n    starts_with(\"vtx_id\"), \n    names_prefix = \"vtx_id_\",\n    names_to = \"dir\",\n    values_to = \"vertex\"\n  ) |&gt; \n  drop_na(vertex)\n\n# Create all combinations of start & end cell borders\ncombos &lt;- special_cells |&gt; \n  filter(cell == \"S\") |&gt; \n  mutate(\n    init_rotation = case_match(dir, \"e\" ~ 0, c(\"n\", \"s\") ~ 1, \"w\" ~ 2) * 1000\n  ) |&gt;\n  select(start_vertex = vertex, init_rotation) |&gt; \n  cross_join(\n    special_cells |&gt; \n      filter(cell == \"E\") |&gt; \n      select(end_vertex = vertex)\n  )\n\nFind the minimum path distance for each start/end vertex combo:\n\nmin_dist &lt;- combos |&gt; \n  mutate(\n    dist = map2_int(\n      start_vertex, \n      end_vertex, \n      ~ distances(g, .x, .y)) + init_rotation + 1\n  ) |&gt; \n  slice_min(dist)\n\nmin_dist |&gt; \n  pull(dist)\n\n[1] 102504",
-    "crumbs": [
-      "2024",
-      "Day 16"
-    ]
-  },
-  {
-    "objectID": "2024/R/day16.html#part-2",
-    "href": "2024/R/day16.html#part-2",
-    "title": "Day 16",
-    "section": "Part 2",
-    "text": "Part 2\nPull all paths that have the minimum distance from start to end:\n\nshortest_paths &lt;- min_dist |&gt; \n  pmap(function(start_vertex, init_rotation, end_vertex, ...) {\n    all_shortest_paths(g, start_vertex, end_vertex)$vpaths\n  }) |&gt; \n  flatten() |&gt; \n  map(as.integer)\n\n\npath_vertices &lt;- shortest_paths |&gt; \n  unlist() |&gt; \n  unique() |&gt; \n  sort()\n\nCount all non-wall cells with a border in the shortest path vertex list:\n\nborders |&gt; \n  select(cell, input_id, starts_with(\"vtx_id\")) |&gt; \n  pivot_longer(starts_with(\"vtx_id\")) |&gt; \n  drop_na(value) |&gt; \n  filter(map_lgl(value, ~ .x %in% path_vertices)) |&gt; \n  filter(cell != \"#\") |&gt; \n  distinct(input_id) |&gt; \n  nrow()\n\n[1] 535",
+    "text": "Part 1\nInitialize the machine from the text input:\n\nprogram &lt;- input |&gt; \n  filter(label == \"Program\") |&gt; \n  pull(value) |&gt; \n  str_split_1(\",\") |&gt; \n  as.integer()\n\nA &lt;- input |&gt; \n  filter(label == \"Register A\") |&gt; \n  pull(value) |&gt; \n  as.integer()\n\nB &lt;- input |&gt; \n  filter(label == \"Register B\") |&gt; \n  pull(value) |&gt; \n  as.integer()\n\nC &lt;- input |&gt; \n  filter(label == \"Register C\") |&gt; \n  pull(value) |&gt; \n  as.integer()\n\nmachine &lt;- list(program = program, A = A, B = B, C = C, pointer = 0L, output = NULL)\n\nDefine machine’s helper functions:\n\ncombo &lt;- function(machine, operand) {\n  case_match(operand,\n    0 ~ 0,\n    1 ~ 1,\n    2 ~ 2,\n    3 ~ 3,\n    4 ~ machine$A,\n    5 ~ machine$B,\n    6 ~ machine$C\n   )\n}\n\nrun_opcode &lt;- function(machine, opcode, operand) {\n  func &lt;- case_match(opcode, \n    0 ~ \"adv\",\n    1 ~ \"bxl\",\n    2 ~ \"bst\",\n    3 ~ \"jnz\",\n    4 ~ \"bxc\",\n    5 ~ \"out\",\n    6 ~ \"bdv\",\n    7 ~ \"cdv\"\n  )\n  \n  get(func)(machine, operand)\n}\n\nrun_machine &lt;- function(machine) {\n  while (machine$pointer &lt; length(machine$program)) {\n    opcode  &lt;- machine$program[machine$pointer + 1]\n    operand &lt;- machine$program[machine$pointer + 2]\n    machine &lt;- run_opcode(machine, opcode, operand)\n  }\n  print(machine$output)\n}\n\nDefine the opcode functions:\n\nadv &lt;- function(machine, operand) {\n  machine$A &lt;- floor(machine$A / 2^combo(machine, operand))\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbxl &lt;- function(machine, operand) {\n  machine$B &lt;- bitwXor(machine$B, operand)\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbst &lt;- function(machine, operand) {\n  machine$B &lt;- combo(machine, operand) %% 8\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\njnz &lt;- function(machine, operand) {\n  if (machine$A != 0) \n    machine$pointer &lt;- operand\n  else \n    machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbxc &lt;- function(machine, operand) {\n  machine$B &lt;- bitwXor(machine$B, machine$C)\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nout &lt;- function(machine, operand) {\n  machine$output &lt;- str_c(\n    machine$output, \n    combo(machine, operand) %% 8, \n    sep = \",\"\n  )\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nbdv &lt;- function(machine, operand) {\n  machine$B &lt;- floor(machine$A / 2^combo(machine, operand))\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\ncdv &lt;- function(machine, operand) {\n  machine$C &lt;- floor(machine$A / 2^combo(machine, operand))\n  machine$pointer &lt;- machine$pointer + 2\n  return(machine)\n}\n\nRun on puzzle input:\n\nrun_machine(machine)\n\n[1] \"3,1,4,3,1,7,1,6,3\"",
     "crumbs": [
       "2024",
-      "Day 16"
+      "Day 17"
     ]
   },
   {
-    "objectID": "2024/R/day03.html",
-    "href": "2024/R/day03.html",
-    "title": "Day 3",
+    "objectID": "2024/R/day15.html",
+    "href": "2024/R/day15.html",
+    "title": "Day 15",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day03.txt\") |&gt; \n  str_c(collapse = \"\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day15.txt\")\ninput_wh &lt;- keep(input, ~ str_detect(.x, \"#\"))\ninput_mv &lt;- keep(input, ~ str_detect(.x, \"&lt;|&gt;|\\\\^|v\"))",
     "crumbs": [
       "2024",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2024/R/day03.html#setup",
-    "href": "2024/R/day03.html#setup",
-    "title": "Day 3",
+    "objectID": "2024/R/day15.html#setup",
+    "href": "2024/R/day15.html#setup",
+    "title": "Day 15",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day03.txt\") |&gt; \n  str_c(collapse = \"\")",
+    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day15.txt\")\ninput_wh &lt;- keep(input, ~ str_detect(.x, \"#\"))\ninput_mv &lt;- keep(input, ~ str_detect(.x, \"&lt;|&gt;|\\\\^|v\"))",
     "crumbs": [
       "2024",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2024/R/day03.html#part-1",
-    "href": "2024/R/day03.html#part-1",
-    "title": "Day 3",
+    "objectID": "2024/R/day15.html#part-1",
+    "href": "2024/R/day15.html#part-1",
+    "title": "Day 15",
     "section": "Part 1",
-    "text": "Part 1\n\nuncorrupt &lt;- function(str) {\n  \n  str |&gt; \n    \n    # Extract all text of the format `mul(a,b)` where a, b are valid integers\n    str_extract_all(\"mul\\\\(\\\\d+,\\\\d+\\\\)\") |&gt; \n    unlist() |&gt; \n    \n    # Extract both integers from the mul sequences and multiply them together\n    str_extract_all(\"\\\\d+\") |&gt; \n    map(parse_number) |&gt; \n    map(reduce, prod) |&gt; \n    \n    # Sum up the total of all results\n    reduce(sum)\n  \n}\n\nuncorrupt(input)\n\n[1] 178538786",
+    "text": "Part 1\nConvert warehouse input to a row/column indexed dataframe\n\n# Convert WH input text to a matrix\nmtx &lt;- input_wh |&gt;\n  str_split(\"\") |&gt; \n  matrix() |&gt; \n  unlist() |&gt; \n  matrix(byrow = TRUE, nrow = length(input_wh))\n\n\n# Convert movement sequence to a seq of characters\nmove_seq &lt;- input_mv |&gt; \n  str_c(collapse = \"\") |&gt; \n  str_split_1(\"\")\n\nDefine function to update the map based on a single movement of the robot::\n\nmove_robot &lt;- function(mtx, dir) {\n  # Get the current coordinates of the robot\n  robot &lt;- which(mtx == \"@\", arr.ind = TRUE)\n  row &lt;- robot[1, \"row\"]\n  col &lt;- robot[1, \"col\"]\n  \n  # Define the range of matrix values to adjust according to the movement dir\n  row_end &lt;- case_match(dir, c(\"&lt;\", \"&gt;\") ~ row, \"^\" ~ 1, \"v\" ~ nrow(mtx))\n  col_end &lt;- case_match(dir, c(\"^\", \"v\") ~ col, \"&lt;\" ~ 1, \"&gt;\" ~ nrow(mtx))\n  \n  # Using obstacle logic, determine the set of new characters\n  new &lt;- tibble(\n    orig = mtx[row:row_end, col:col_end],\n    lag = lag(orig)\n  ) |&gt; \n    mutate(\n      is_empty = orig == \".\",\n      is_wall  = orig == \"#\",\n      is_blocked = accumulate(is_wall, `|`),\n      is_fillable = is_empty & !is_blocked,\n      first_fillable = is_fillable & !lag(accumulate(is_fillable, `|`)),\n      can_move = accumulate(first_fillable, `|`, .dir = \"backward\"),\n      new = if_else(can_move, coalesce(lag, \".\"), orig)\n    ) |&gt; \n    pull(new)\n  \n  # Replace the affected characters in the matrix and return\n  mtx[row:row_end, col:col_end] &lt;- new\n  return(mtx)\n}\n\nDefine a function to iteratively run the set of movements\n\nrun_simulation &lt;- function(mtx, move_seq) {\n  mtx_prv &lt;- mtx\n  for (dir in move_seq) {\n    mtx_new &lt;- move_robot(mtx_prv, dir)\n    mtx_prv &lt;- mtx_new\n  }\n  return(mtx_new)\n}\n\nDefine a function to determine the GPS coordinates of all boxes\n\nget_boxes_gps &lt;- function(mtx) {\n  which(mtx == \"O\", arr.ind = TRUE) |&gt; \n    as_tibble() |&gt; \n    mutate(\n      gps = 100 * (row - 1) + (col - 1)\n    ) |&gt; \n    pull(gps)\n}\n\nRun puzzle input:\n\nmtx |&gt; \n  run_simulation(move_seq) |&gt; \n  get_boxes_gps() |&gt;\n  sum()\n\n[1] 1457740",
     "crumbs": [
       "2024",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2024/R/day03.html#part-2",
-    "href": "2024/R/day03.html#part-2",
-    "title": "Day 3",
+    "objectID": "2024/R/day15.html#part-2",
+    "href": "2024/R/day15.html#part-2",
+    "title": "Day 15",
     "section": "Part 2",
-    "text": "Part 2\n\n# Remove all text between `don't()` and `do()`, then uncorrupt the result\ninput |&gt; \n  str_remove_all(\"don't\\\\(\\\\).*?do\\\\(\\\\)\") |&gt;   \n  uncorrupt()\n\n[1] 102467299",
+    "text": "Part 2\nWiden the map:\n\n# Convert WH input text to a matrix\nmtx &lt;- input_wh |&gt; \n  str_replace_all(\"#\", \"##\") |&gt; \n  str_replace_all(\"O\", \"[]\") |&gt; \n  str_replace_all(\"\\\\.\", \"..\") |&gt; \n  str_replace_all(\"@\", \"@.\") |&gt;\n  str_split(\"\") |&gt; \n  matrix() |&gt; \n  unlist() |&gt; \n  matrix(byrow = TRUE, nrow = length(input_wh))\n\nDefine functions to move boxes around the map:\n\nget_box_coords &lt;- function(mtx, box_num) {\n  as_tibble(which(mtx == box_num, arr.ind = TRUE))\n}\n\nget_next_coords &lt;- function(cur_coords, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  cur_coords |&gt;\n    mutate(\n      row = row + case_match(dir, \"^\" ~ -1, \"v\" ~ 1, .default = 0),\n      col = col + case_match(dir, \"&lt;\" ~ -1, \"&gt;\" ~ 1, .default = 0),\n    )\n}\n\nget_next_chrs &lt;- function(mtx, cur_coords, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  # Pull the values of the next cells in the intended direction\n  cur_coords |&gt;\n    get_next_coords(dir) |&gt; \n    mutate(chr = map2_chr(row, col, ~ mtx[.x, .y])) |&gt; \n    anti_join(cur_coords, join_by(row, col)) |&gt; \n    pull(chr) |&gt; \n    unique()\n}\n\nis_blocked &lt;- function(mtx, box_num, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  \n  cur &lt;- get_box_coords(mtx, box_num)\n  nxt_chrs &lt;- get_next_chrs(mtx, cur, dir)\n  \n  # Test if the current box is completely blocked or completely free\n  if (any(nxt_chrs == '#')) \n    return(TRUE)\n  else if (all(nxt_chrs == '.')) \n    return(FALSE)\n  \n  # Recurse across all later boxes \n  nxt_chrs |&gt; \n    keep(~ str_detect(.x, \"^\\\\d+$\")) |&gt; \n    map_lgl(~ is_blocked(mtx, .x, dir)) |&gt; \n    any()\n}\n\nmove_box &lt;- function(mtx, box_num, dir = c(\"&lt;\", \"^\", \"&gt;\", \"v\")) {\n  # Get the coordinates of the current box and the place it'll move to\n  cur &lt;- get_box_coords(mtx, box_num)\n  nxt &lt;- get_next_coords(cur, dir)\n  \n  # Move all downstream boxes before moving self\n  next_boxes &lt;- get_next_chrs(mtx, cur, dir) |&gt; \n    keep(~ str_detect(.x, \"^\\\\d+$\"))\n  \n  for (box in next_boxes) {\n    mtx &lt;- move_box(mtx, box, dir)\n  }\n  \n  # # Replace the current coords with \".\" and the next coords with the box\n  mtx[cur$row, cur$col] &lt;- \".\"\n  mtx[nxt$row, nxt$col] &lt;- box_num\n  \n  return(mtx)\n}\n\nLoop through puzzle input:\n\nrun_simulation &lt;- function(mtx, move_seq) {\n  # Convert boxes from format \"[]\" into ID numbers unique to each box:\n  coords &lt;- list(l = which(mtx == \"[\"), r = which(mtx == \"]\"))\n  for (i in 1:length(coords$l)) {\n    mtx[coords$l[i]] &lt;- i\n    mtx[coords$r[i]] &lt;- i\n  }\n\n  # Loop through sequence of moves and apply to the map\n  mtx_prv &lt;- mtx\n  for (dir in move_seq) {\n    if (!is_blocked(mtx_prv, box_num = \"@\", dir = dir)) {\n      mtx_new &lt;- move_box(mtx_prv, box_num = \"@\", dir = dir)\n      mtx_prv &lt;- mtx_new\n    } \n  }\n  \n  return(mtx_new)\n}\n\noutput &lt;- run_simulation(mtx, move_seq)\n\nConvert the result to GPS coordinates:\n\noutput |&gt; \n  as_tibble() |&gt; \n  mutate(row = row_number(), .before = everything()) |&gt; \n  pivot_longer(\n    -row, \n    names_to = \"col\", \n    names_prefix = \"V\", \n    names_transform = as.integer\n  ) |&gt; \n  # Select only the leftmost cell of each boxes\n  filter(str_detect(value, \"\\\\d+\")) |&gt; \n  slice_min(col, by = value) |&gt; \n  mutate(\n    dist_top = row - 1,\n    dist_left = col - 1,\n    gps = 100 * dist_top + dist_left\n  ) |&gt; \n  pull(gps) |&gt; \n  sum()\n\n[1] 1467145",
     "crumbs": [
       "2024",
-      "Day 3"
+      "Day 15"
     ]
   },
   {
-    "objectID": "2024/R/day01.html",
-    "href": "2024/R/day01.html",
-    "title": "Day 1",
+    "objectID": "2024/R/day14.html",
+    "href": "2024/R/day14.html",
+    "title": "Day 14",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\n  \"../input/day01.txt\", \n  col_names = c(\"x\", \"y\"), \n  show_col_types = FALSE\n)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day14.txt\", skip_empty_rows = TRUE)\n\n# Parameters: dimensions of the room\nroom_w &lt;- 101\nroom_h &lt;- 103",
     "crumbs": [
       "2024",
-      "Day 1"
+      "Day 14"
     ]
   },
   {
-    "objectID": "2024/R/day01.html#setup",
-    "href": "2024/R/day01.html#setup",
-    "title": "Day 1",
+    "objectID": "2024/R/day14.html#setup",
+    "href": "2024/R/day14.html#setup",
+    "title": "Day 14",
     "section": "",
-    "text": "# Libraries\nlibrary(tidyverse)\n\n# Read input from file\ninput &lt;- read_table(\n  \"../input/day01.txt\", \n  col_names = c(\"x\", \"y\"), \n  show_col_types = FALSE\n)",
+    "text": "# Libraries\nlibrary(tidyverse)\nlibrary(unglue)\n\n# Read input from file\ninput &lt;- read_lines(\"../input/day14.txt\", skip_empty_rows = TRUE)\n\n# Parameters: dimensions of the room\nroom_w &lt;- 101\nroom_h &lt;- 103",
     "crumbs": [
       "2024",
-      "Day 1"
+      "Day 14"
     ]
   },
   {
-    "objectID": "2024/R/day01.html#part-1",
-    "href": "2024/R/day01.html#part-1",
-    "title": "Day 1",
+    "objectID": "2024/R/day14.html#part-1",
+    "href": "2024/R/day14.html#part-1",
+    "title": "Day 14",
     "section": "Part 1",
-    "text": "Part 1\nSort each list independently, then sum the distances between each pair of ordered items.\n\ntibble(\n  x = sort(input$x), \n  y = sort(input$y),\n  dist = abs(y - x)\n) |&gt; \n  summarize(total = sum(dist)) |&gt; \n  pull()\n\n[1] 2285373",
+    "text": "Part 1\nExtract numerical values from input text:\n\ndf &lt;- input |&gt;\n  unglue_data(\"p={x},{y} v={vx},{vy}\") |&gt; \n  mutate(\n    across(everything(), parse_number),\n    robot_id = row_number(),\n    .before = everything()\n  )\n\nFor debugging: define a function to print the current state of the grid\n\nprint_grid &lt;- function(df, w = room_w, h = room_h) {\n  df |&gt; \n    summarize(n = as.character(n()), .by = c(x, y)) |&gt; \n    complete(\n      x = 0:(room_w - 1), \n      y = 0:(room_h - 1), \n      fill = list(n = \"\")\n    ) |&gt; \n    mutate(n = str_pad(n, width = max(str_length(n)), side = \"left\")) |&gt; \n    arrange(desc(y), x) |&gt; \n    group_split(y) |&gt; \n    map_chr(~ pull(.x, n) |&gt; str_c(collapse = \" \")) |&gt; \n    cat(sep = \"\\n\")\n}\n\nDefine a function which gives the location of the robots after n seconds. Multiply n by the velocity, add to the current position, and modulo the room dimensions.\n\npass_time &lt;- function(df, seconds, w = room_w, h = room_h) {\n  df |&gt; \n    mutate(\n      x = (x + vx * seconds) %% w,\n      y = (y + vy * seconds) %% h\n    )\n}\n\nDefine a function to get the current safety factor by counting the number of robots in each quadrant of the room:\n\nget_safety_score &lt;- function(df, w = room_w, h = room_h) {\n  mid_w &lt;- (room_w - 1) / 2\n  mid_h &lt;- (room_h - 1) / 2\n  \n  df |&gt; \n    mutate(\n      half_w = case_when(x &lt; mid_w ~ 0, x &gt; mid_w ~ 1),\n      half_h = case_when(y &lt; mid_h ~ 0, y &gt; mid_h ~ 1),\n      quadrant = half_w + 2 * half_h\n    ) |&gt; \n    drop_na(quadrant) |&gt; \n    summarize(num_robots = n(), .by = quadrant) |&gt; \n    pull(num_robots) |&gt; \n    prod()\n}\n\nCompute safety score of puzzle input:\n\ndf |&gt; \n  pass_time(100) |&gt; \n  get_safety_score()\n\n[1] 208437768",
     "crumbs": [
       "2024",
-      "Day 1"
+      "Day 14"
     ]
   },
   {
-    "objectID": "2024/R/day01.html#part-2",
-    "href": "2024/R/day01.html#part-2",
-    "title": "Day 1",
+    "objectID": "2024/R/day14.html#part-2",
+    "href": "2024/R/day14.html#part-2",
+    "title": "Day 14",
     "section": "Part 2",
-    "text": "Part 2\nFor each item in list x, multiply its value by its number of occurrences in list y, then sum the total.\n\ninput |&gt; \n  mutate(\n    x_match_count = map_int(x, ~ sum(.x == y)),\n    similarity_score = x * x_match_count\n  ) |&gt; \n  summarize(total = sum(similarity_score)) |&gt; \n  pull()\n\n[1] 21142653",
+    "text": "Part 2\nFirst, find the cycle of seconds where the robots’ positions repeat (no more than the least common multiple of the room width and room height)\n\ncycle &lt;- DescTools::LCM(room_w, room_h)\n\nFor each unique snapshot in the cycle, test for randomness vs structure in the X-Y coordinates.\n\nsimulations &lt;- map_dfr(\n  1:cycle,\n  \\(seconds) {\n    new &lt;- pass_time(df, seconds)\n    c(secs = seconds, xvar = var(new$x), yvar = var(new$y))\n  }\n)\n\nsimulations |&gt; \n  arrange(xvar, yvar, secs) |&gt; \n  filter(row_number() == 1) |&gt; \n  pull(secs)\n\n[1] 7492",
     "crumbs": [
       "2024",
-      "Day 1"
+      "Day 14"
     ]
   },
   {