Discussion thread for day 4 of the Advent of Code - https://adventofcode.com/2025/day/4
This one was fun!
My solution.
For those who despise both macros and your own sanity but love Base-A AoC, then look no further because P2 can indeed be solved without a macro. The downside is that the solution is over-complicated and much slower (4x slower for me).
I hope y'all are enjoying Advent of Code as much as I am. Happy Solving (again)!
Solved!
Since AoC involves a lot of walking to adjacent squares, I went ahead and built a macro to find all the adjacent spots, with the ability to include/exclude the diagonal squares.
From there, nothing too crazy. Within the iterative macro, I added a Count to compare the initial records with the final records in an iteration so that way it's really easy to identify when nothing is removed.
This is part 1, I'm working on a non-macro path for part 2
Enjoyed this one!
The sort is key to the multi-row tool.
