advent_of_code

day 12_1: ok, that was sneaky. I sort of thought it would make sense to first remove the areas that are obvously too small. But then I glanced at reddit and got the spoiler... So my code could be a lot easier, but it it still very easy..

day 10_1: convert to ints (so we can do XOR); tried BFS but got lost in my ignorance, so just again use Algorithm::Combinatorics to iterate to ever increasing combinations of button presses

day 11_2: needs memoization, then superfast

day 11_2 works for test but not for real, probably because there are loops etc in the graph and we willll need to abort if we already went along a subgraph