[2021 Day 23 Part 1&2] Is this strategy feasible for computing programmatically the optimal cost?

• AdventOfCode

  1 0 8.1 C#

  C# solutions to Advent of Code puzzles (by benjymous)

• AdventOfCode2021

  49 61 2.6 Rust

  Solutions to all 25 AoC 2021 problems in Rust :crab: Less than 100 lines per day and under 1 second total execution time! :christmas_tree:

My Rust solution runs in about 150ms, using just a standard Dijkstra implementation with nothing special like prioritizing moves like you propose.

• WorkOS

  workos.com sponsored

  The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

  

• aoc21

  1 0 0.0 Rust

  My solutions in Rust for advent of code puzzles (by albheim)

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.

• aoc

  3 1 7.7 Rust

  Advent of Code solutions (by vodik)

Its not amazingly clear code, but here it is for what its worth: https://github.com/vodik/aoc/blob/main/aoc-2021/src/day23.rs

• aoc2021-ruby

  1 0 0.0 Ruby

  Ruby solutions to the 2021 Advent of Code puzzles

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.

• InfluxDB

  www.influxdata.com sponsored

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

Suggest a related project