Dijkstar VS Advent_of_Code

Then I stumbled upon Dijkstar, which is an implementation of Dijkstra in python that has the ability to pass in your own heuristics function to customise how it runs. In this case the default behaviour gave me exactly what I needed and even returns total cost.

Then I came across this Python solution, which was quite short and concise. So I implemented this solution in F#, but I had to use a mutable. I couldn't figure out how to get rid of this mutable. Is there a way, or is this solution not a F# one?

My solutution in Python. Using itertools.cycle for part 1 and functools.cache for part 2.

My solution in Python. This one was fun! Thanks for the many samples and the detailed description.

My solution in Python. At first I was really struggling but then I luckily found some A* pathfinding code I wrote many years ago.

My Solution in Python. This one is pretty compact and amazingly fast thanks to collections.Counter and functools.lru_cache. Here is the function for counting the elements:

My solution in Python. A simple search without recursion.

My solution in Python. It's astonishing how much trouble I had today despite my experience with cellular automata.Lots of off-by-one errors and problems with synchronicity.

My solution in Python. I realised that I could use the median for part 1 and mean for part 2 like some others here.

My solution in Python. Today was fun and very easy. I immediately came to the same conclusion as others here to simply count the number of fish per age group.

My solution in Python. Now it starts to get interesting. I need to remind myself to use collections and itertools more often.