AoC2020 VS Advent_of_Code_in_Pascal

My Answer\ There isn't much to say about today's puzzle. A rather straightforward MATLAB implementation. Merry Christmas everyone!

Part 1\ Part 2\ Since the script for part 2 is written in a recursive way, there is an extra step to get the final answer. The final answer can be easily obtained based on the non-empty deck.\ \ I was confused by the infinite loop prevention rule, but other than that, pretty simple puzzle.

My MATLAB answer for part 1. Part 2 can be easily done manually so I didn't bother writing codes for that:)

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