Rules: no spoilers.
The other rules are made up as we go along.
Share code by link to a forge, home page, pastebin (Eric Wastl has one here) or code section in a comment.
Rules: no spoilers.
The other rules are made up as we go along.
Share code by link to a forge, home page, pastebin (Eric Wastl has one here) or code section in a comment.
10!
a, b
a was relatively straightforward - again, an implementation test.
b was interesting- luckily, I remembered how to test if a point lives inside a curve. The line-crossing count algorithm was a little tricky to write from scratch, but I finally got there. Also, I screwed up for like an hour when I didn’t realise you were supposed to count junk pipes as part of the territory. Code wise it got messy, and I’ve thrown something up on my github, but might try clean it up a little later.
Update: I’ve cleaned up my code and made it “dartier” i.e. I use more neat dart syntactic sugar at the cost of readability.