Post

@michael.bacarella.com

Advent of OCaml, day 11, solved! 😼 A welcome reprieve from yesterday. Today's solution can be solved quickly with "merely" coding interview level DFS graph search with memoization.

11/12/25, 4:14 pm1 repost5 likes

🏴‍☠️ MC Pablo ∴

@p4bl0.net

11 Dec 2025

I used the exact same approach, also in #OCaml 😊 ! The only difference is that I convert all device names to consecutive integers in order to store the graph in a simple array for convenience. See here: code.up8.edu/pablo/aoc/-/...

code.up8.edu2025/11/part2.mll · main · Pablo Rauzy / 🎄 Advent of Code · GitLabcode.up8.edu

Michael Bacarella

@michael.bacarella.com

12 Dec 2025

nice. I'm just happy a computational solution is possible and it's not like yesterday's where you *cannot* solve it without integer linear programming

Michael Bacarella

@michael.bacarella.com

11 Dec 2025

from r/adventofcode