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

This page summarizes the projects mentioned and recommended in the original post on reddit.com/r/adventofcode

Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Less time debugging, more time building
  • SaaSHub - Software Alternatives and Reviews
  • AdventOfCode

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

  • AdventOfCode2021

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

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

  • SonarQube

    Static code analysis for 29 languages.. Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

  • aoc21

    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

    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

    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.

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a more popular project.

Suggest a related project

Related posts