this post was submitted on 24 Dec 2024
7 points (100.0% liked)
Advent Of Code
1035 readers
1 users here now
An unofficial home for the advent of code community on programming.dev!
Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.
AoC 2024
Solution Threads
M | T | W | T | F | S | S |
---|---|---|---|---|---|---|
1 | ||||||
2 | 3 | 4 | 5 | 6 | 7 | 8 |
9 | 10 | 11 | 12 | 13 | 14 | 15 |
16 | 17 | 18 | 19 | 20 | 21 | 22 |
23 | 24 | 25 |
Rules/Guidelines
- Follow the programming.dev instance rules
- Keep all content related to advent of code in some way
- If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2024 Day 10])
- When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts
Relevant Communities
Relevant Links
Credits
Icon base by Lorc under CC BY 3.0 with modifications to add a gradient
console.log('Hello World')
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Yeah - dumped out the input into GraphViz, and then inspected it 'by eye' to get the swaps. Nearly finished in the top 100 in the world, too. Feels like a really bad way to get the solution, though.
If you add eg. 1111 and 1111 and expect 11110, then you'll get an output like 11010 if there's a mistake in "bit 2". Can try all the swaps between x2 / y2 / z2 until you get the "right answer", and then continue. There's only about five different ops for each "bit" of the input, so trying all of them won't take too long.
Im halfway through doing that, definitely feels wrong though. I'm curious to see if there is a good programatic way of doing it.
Dont you need a pair of broken bits? For mine, bit 6 is broken, because its just x6^y6. So I need to find where the carry bit got swapped to. Or are you suggesting that I swap my bit 6 operation with every other operation until it resolves?
In my input (and I suppose in everyone else's too) the swaps only occurred within the adder subcircuit for a single bit. In general, however, the way the problem is phrased, any two outputs can be swapped, which can lead to two broken bits per swap (but this just doesn't happen).
Mine definitely had outputs swapped between adders,
z06
was justx06 XOR y06
. The circuit was completely broken there.