More cellular automata, but with added typeclass fun

Starting simple, then changing direction for performance

A simple game, with a DIY hash table for speed

Confusing in its simplicity

Yak shaving and sea monsters

More parsing. It started easier than I thought, then Haskell made it harder.

Going back to the source for parser combinators

Cellular automata and typeclasses

Types and parsers, then using a library for the hard bit.

Diving into ST and monad loop control, all in the pursuit of speed

Bit-twiddling, until it wasn't.

Reusing number theory

Day 12 [https://adventofcode.com/2020/day/12] was fairly straighforward: apply a bunch of rules to update a state. The two parts are so similar, I'll treat

Cellular automata, and being inefficient

Dynamic programming done quickly.

Playing to Haskell's strengths

Return of the VM!

Bags and DAGs

First steps with Attoparsec

Starting with Attoparsec

Persuading Megaparsec about the importance of space.

Sledding and laziness

First two days: warming up.

Day 25 [https://adventofcode.com/2019/day/25] was fairly straightforward, once again building on Ascii generation from IntCode, as in day 17 [https://work.njae.me.uk/2019/12/

This was the challenge where I over-reached myself. Day 24 [https://adventofcode.com/2019/day/24]was about implementing a cellular automaton [https://en.wikipedia.org/wiki/Cellular_automaton], much