Advent of Code 2025 Day 8 (BaseA Style)

Discussion thread for day 8 of the Advent of Code - https://adventofcode.com/2025/day/8

Accepted answers

All comments

I don't think my WF is not so optimized that I admit there is a room for improvement, but I'm satisfied with Macro-less solution at the end.

Spoiler

For Part2, all of connection ID are memorized as string by using the Multi-row formula tool, and check first record that contains all of junction boxes.
Even using my powerful computer, it takes 2 minutes. I wanna see other solution for learning wise algorithm.
While total 499,500 connections are there, target result is hit at very early examination, that is 4,765th. My WF should have some waste calculation, though I don't figure out how to get rid of them yet.

2025D8_gawa.yxzp

Hub119

I did my very best to try and make this problem WAY more complicated than it needed to be for both Parts 1 and 2...

Spoiler

Turns out my original simple part 2 was just due to dumb luck working with my input... so went back and built a proper (but longer to run) solution:
AoC 2025 D8 Pic.png

AoC 2025 Day 8 - Playground.yxzp

DaisukeTsuchiya

Day 8 was a problem I really enjoyed.

Spoiler

For P1, I generated all possible pairs, calculated their distances, and then took the 1,000 shortest pairs. I used the Make Group Tool to group them into circuits.
For P2, I needed to find how many pairs it would take to form a single group. I first used trial and error to narrow down the range to 4,600-4,700 connections. After that, I used a Batch Macro to identify the exact number of pairs needed.
Since I ran the workflow on this narrowed range, the processing time was 4 seconds.

DT2025_Day8_Rev2.yxzp

CoG

Wow! Seeing non-macro solutions is incredible! I built a macro today to solve via Binary Search algorithm!

Spoiler

Part 1 is very easily solved with the Make Groups Tool!

For Part 2, I built a binary search algorithm macro. For speed I solved with manual binary search. Screenshot Macro.png

Happy Solving!

solved p1

It's been resolved, but I expect a smarter solution for the Day 8.

Spoiler

In part 2, I thought that by evaluating at the midpoint and discarding the branch with no solution, we could explore half the cases at a time and likely find the answer in far fewer than 50 loops. I also confirmed that processing all combinations in the grouping tool took only seconds.

After that, it took time to implement the desired logic and correctly set the completion condition for the iterration macro.

I briefly considered whether manually narrowing down the likely solution range and then checking that range might be faster. However, since it seemed possible to manage without building a highly data-dependent workflow, I decided against that approach.

AoC2025Day08_toki.yxzp

Raj

Solved without macro

2025 D8 without macro.yxmd

Goddenra

Well, it's solved. Not pretty. Impressed by the non-macro solutions!

Day8.yxzp

DanFlint

Back on track today

Spoiler

Thanks goodness the "Make Groups" tools exists!

Spoiler

Basically ran the same logic through an iterative macro.
I dropped the coordinates early in part 1, so rather than change part 1 I just join them back on to my phase 2 macro outputs.
I could probably have made the iterative macro run less iterations, but this works.

Day8_DF.yxzp

patrick_digan

Spoiler

Make Group is such a useful tool for problems like this. For part 2 I relied on guess/check.

Day 8.yxmd

martinson

I saved over my part 1 🎻

Spoiler

AkimasaKajitani

I couldn't do it in real time today so I took my time.

My solution is macro solution. The difference between Part 1 and 2 is only ending condition.

And for the first time, I used the concatenate distinct option in the Summarize tool.

Spoiler

It took 17 seconds for Part 1 and 1 minutes 54 seconds for P2.

P2 needed for 4939 iterations.

Part 1 macro:

Part 2 macro:

Day08.yxzp

mmontgomery

Day 8

Spoiler

Make Group Make Group Make Group!

This tool really helped, as it's fantastic at connecting elements in a chain.
P1: Calculate Straight Line Distance (SQRT (x-x1)^2+(y-y1)^2+(z-z1)^2) then sort by top 10 rows then have make group determine the pairs. Count em and sort by top 3
P2: Keep adding IDs, which are sorted from nearest to far, then determine how many keys from the make group match the list of all IDs. Keep going until all IDs appear in one group. I have filters to test for total groups, when we need 1 and to make sure each element is part of that group. Took me just under 5k iterations

Day8.yxzp

AkimasaKajitani

I create another solution inspired by @DaisukeTsuchiya . I created the workflow which will stop when the answer comes using Iterative macro.

Spoiler

Day08_2.yxzp

Hub119

Went back and rebuilt my Part 2 solution implementing my version of the approach that @CoG took... SOOO much faster.

Spoiler

Updated Solve

Spoiler

Binary Search Macro

AoC 2025 Day 8 - Playground.yxzp

ScottLewis

First one in a while where I have something exciting to talk about. No special insight on Part1 but if you're stuck on Part2 the spoiler below will drastically simplify the problem.

Part 1, Dual Macro solution, not that different from the others. Possible I need to lean about make group. I like to solve problems like this with nested iterative Macros where the inner one assembles a group and the outer one handles removing that group from the data. That way I get to use iteration.count to enumerate the sets in the out macro and the inner macro doesn't have to keep track of anything except "find every node connected to this one." Single Macro solution is faster, but I find the nested Macros easy to build, especially when I'm tired and this problem didn't seem complex enough to have a need for speed.

Part 2 is the exciting part.

Spoiler

The question "which pair of nodes connected the network" is equivalent to "which node appears last in the distance-sorted list of pairs" because that will always be the one that completes the network by bringing in the last node. If you include both sides of each pair (A->B and B->A) in your list and sort by distance then the answer is just the pair with the last unique node. Max of Min, which is a problem we're good at solving.

AOCDay8ScottLewis.yxzp

Gawa

Revisited this puzzle after discussing with @Hub119 and @CoG on WhatsApp.

Implemented improvements:

- Applied more rigorous logic to judge if forming single circuit, that doesn't rely on nature of luckiness in given data

- Cater for dynamic input(sample or my own) by using nested Macro(Iteration Macro inside Batch Macro) to rewrite the parameter for conditional expression via Control Parameter.

- Stop iteration once the result is found

Spoiler

2025D8_rev1_gawa.yxzp

Stosh

Day 8 is finally complete! Definitely leaned on the community for some much needed help, but I am really happy that I did, as I ended up learning so many new tricks (Explanation and shoutouts can be seen in my reflection)! We live to see another day, and I am excited to take on the 9th challenge.

My Solutions:

Spoiler

Part 1 and Part 2

The macro used in Part 2

My Reflection:

Spoiler

As I mentioned before, I was lifted up by the Alteryx AOC Community today, and I want to shout out some particularly helpful people as I go over my reflection of the challenges!

As I was making progress in Part 1 in the wee hours of the morning, I heard rumblings in the WhatsApp group that a certain lesser-known tool was critical to their solves. I was dying to know what it was, so I allowed myself to take a very quick peek at @gawa 's solution and that's when I saw it: The Make Group Tool. I am 100% certain that I have had to read some documentation on this tool at some point or another in order to pass a certification😂But this was my first time seeing it out in the wild, and it was so cool to watch it absolutely shred through Part 1. It literally does all the heavy lifting and just leaves me to line it up and take the product.

For Part 2, I decided to leave it to the evening, as I needed to get some sleep! As a result, I had some time to think about my approach at work. I knew I needed to iterate on the sorted list of match distances, starting from match 1001 and stopping when the Make Group tool returns one 1000 node group, but not much else. While I was thinking, I shared my idea with @Hub119 and @CoG , where I was then given the idea to try binary search, which was a total gamechanger! I have always admired the efficiency and elegance of a binary search, but never implemented the concept in anything I have built, so it was an absolute treat to be able to actually build out the logic for the first time. The macro takes in the full list of relationships, as well as a min and max relationship ID to consider. From there, it finds the midpoint relationship and performs a make group process on all relationships up to the midpoint as well as on all relationships up to the midpoint - 1. This is done because many subsets of the total list of relationships will result in a single 1000 node group coming out of a Make Group tool, but what we need is the VERY FIRST relationship in which this is the case. In order to truly find it, I am looking for when the relationships up to the midpoint result in a single 1000 node group and the relationships up to the midpoint - 1 do not. Once I find that, I simply output the midpoint. Otherwise I update the Min and Max and start again.

Overall, I am very happy with my solution, and I am even happier to be a part of the community! I have been learning so much through this entire process, and I think my experience today sums up the beauty of this challenge. Looking forward to Day 9!

AOC2025.8.yxzp

AncientPandaman

waste too much time on misunderstand...
the method of calculate distance and i thought it skip the count of connection if there already in circuit.

Spoiler

for part 2 is similar to gawa solutions (the first post).
First line that fit all connection.
but it took 3~ mins.
hence i change to use bitmask method (in string)
if significant reduce the time to 5 seconds. (huge time save due to the size of data 9.5GB -> 500 MB)

start of bitmask is create in formula

padleft("0",[Max_recordID],"0")

the multi-row formula, wish it have function that replace specific character where it will simplify the formula.

if isnull([row-1:bitmask]) then
  Left(
    Left([BitMask],[RecordID]-1)+"1"+Substring([BitMask],[recordid],1000),
    [Source_recordID]-1)
  +"1"+substring(
    Left([BitMask],[RecordID]-1)+"1"+Substring([BitMask],[recordid],1000),
  [source_recordID],1000)


else
    Left(
    Left([row-1:BitMask],[RecordID]-1)+"1"+Substring([row-1:BitMask],[recordid],1000),
    [Source_recordID]-1)
  +"1"+substring(
    Left([row-1:BitMask],[RecordID]-1)+"1"+Substring([row-1:BitMask],[recordid],1000),
  [source_recordID],1000)
  
endif

Day 08.yxmd

DataNath

This one took a good while to get P2 over the line! Had to peek at a couple of spoilers to discover a key stopping condition I was completely overlooking but once I added that, lights out! Shoutout to the 'superstar' tool for this one!

Spoiler

Day 8 - Cleansed.yxzp

lwolfie

Couldn't get my pt 2 macro to work, so I went macroless.

Day8 law.yxzp

Qiu

I was lucky with @Hub119 approach and will go with it.

Spoiler

AoC 2025 Day 08-Qiu.yxzp

danboll_life

I had a hard time figuring out what the question was asking for.

Spoiler

AoC2025_08_DL.yxzp

Pilsner

First time using this particular tool in an actual build! I had seen it before, but decided today was the day to try it for myself; always good to learn a new trick.

Spoiler

Great use case for the make group tool!

This one, too, needs to be tidied up. I wanted to make sure I had all my solutions uploaded by the end of day 12, but rest assured, I will do my best to post a neater version of my day 8 solution shortly.

Workflow:

Macro:

Day 8.yxzp

mkeiffer

My Day 8 solution. Just realized I forgot to post it.

Spoiler

Spoiler

2025_AoC_MPK_Day_08.yxzp

iracine

This one was tricky.

Spoiler

Capture d’écran 2025-12-23 à 10.38.52 AM.png

OI-DM-ADVENT_OF_CODE_CHALLENGE_8_2025-12-23.yxzp

estherb47

This one took me a while to wrap my head around part 2, and while I got a working answer, I'm not so sure I understand why it works.

Spoiler

Basically, for part 2, I'm starting with the first 100 rows, and adding one more to the group with each iteration until I get down to a single loop. Macro is very simple, and uses the Make Groups tool

2025_Day8_EHB.yxzp

Malvim

I'm happy with my solution for this one. No macros, and I have two 'gotchas', one for each part. Part 1 I saw a chance for a tool I never used before, and for part 2 just an easy way to get where the problem need me to get.

Spoiler

Day8 - Circuit Boxes.yxmd

OllieClarke

Here's my solution

Spoiler

The Macro does a binary search to find the threshold point

Day 8.yxmd

Day 8.yxmc

Quick Links

This months top contributors

atcodedog05 19598

Qiu 15875

binu_acs 15708

MarqueeCrew 13708

apathetichell 13703