aoc21
My solutions in Rust for advent of code puzzles (by albheim)
aoc2021-ruby
Ruby solutions to the 2021 Advent of Code puzzles (by jdashton)
aoc21 | aoc2021-ruby | |
---|---|---|
1 | 1 | |
0 | 0 | |
- | - | |
0.0 | 0.0 | |
over 2 years ago | about 2 years ago | |
Rust | Ruby | |
- | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
aoc21
Posts with mentions or reviews of aoc21.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-01-10.
-
[2021 Day 23 Part 1&2] Is this strategy feasible for computing programmatically the optimal cost?
I think a full search is quite feasible since the branching stops pretty quickly from bad moves locking up the position. I wrote my solution in rust, and I run through every legal move (okay, I split it up to all moves being first up to the corridor and then a second move down, to simplify coding) from the initial state and it runs on my laptop in 110 ms.
aoc2021-ruby
Posts with mentions or reviews of aoc2021-ruby.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-01-10.
-
[2021 Day 23 Part 1&2] Is this strategy feasible for computing programmatically the optimal cost?
Thanks so much for sharing! If you would like to test your code against someone else's input data, you can find mine here: https://github.com/jdashton/aoc2021-ruby/blob/main/input/day23a.txt . The accepted answers were 13455 for part 1 and 43567 for part 2.