advent-of-code-2021 VS Advent_of_Code_in_Pascal

Rust: https://github.com/nj-vs-vh/advent-of-code-2021/blob/main/src/day21.rs At first I misread the second part and forgot that dice are thrown more than opce... Banged my head against the wall trying to figure out some clever way to iterate through possible move combinations. Also got sidetracked trying to solve the whole thing modulo 10. When I finally understood triple dice throw, it became feasible to brute-force the puzzle for distinct move values while keeping track of the number of universes this happens in. It's not too elegant but works in 2.5 seconds.

I'm doing it in Lazarus/Free Pascal again.

https://github.com/mikewarot/Advent_of_Code_in_Pascal

Free Pascal - 2251/1744 34.5 seconds runtime No objects, no recursion After brute forcing part 1, I stared at part 2 until I though only handling the different values of X,Y,Z and letting the grid represent variable size cubes.. only to hit memory size limits anyway... and then I learned how to use BITPACKED array, and was able to eventually brute force part 2. Whew!

Pascal 2235/4609

Pascal - Github

Pascal 7079/6330 - github

Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr

My pascal based solver eventually got valid text out of your input.

Pascal 2437/6187

Pascal 3590/5744