Day 23, still need to fix mine as it is still taking way more than 1s, but at least it does end up giving me the right answer for both the example and my input.
Day 24 my rejigged solution runs almost instantaneously and I assume it will work on every input that anyone doing AoC will be presented with (I can't test that as I don't have everyone's input). Obviously it cannot work on completely arbitrary input programs, but it's possible to do a much more generic solution once you work out what is doing under the covers.
Day 25, simple, if you don't forget to increment the moved counter when dealing with the v movers. That meant it stopped early and reported a solution that was too low (but not for the example input obviously).
Right, finally caught up and finished it.
Day 23, still need to fix mine as it is still taking way more than 1s, but at least it does end up giving me the right answer for both the example and my input.
Day 24 my rejigged solution runs almost instantaneously and I assume it will work on every input that anyone doing AoC will be presented with (I can't test that as I don't have everyone's input). Obviously it cannot work on completely arbitrary input programs, but it's possible to do a much more generic solution once you work out what is doing under the covers.
Day 25, simple, if you don't forget to increment the
moved
counter when dealing with thev
movers. That meant it stopped early and reported a solution that was too low (but not for the example input obviously).