advent_of_code VS adventofcode

Here's the relevant extract from my (recursive) solution. Full code on GitHub.

Like others, I used lcm. Here's an extract of the solution, omitting parsing and main(). Full solution on GitHub.

Solutions to parts 1 and 2 nearly identical and pretty much worked first time. Nothing clever here. This was far simpler than I thought it would be. I probably spent most time trying to think of a mathematical way of getting all points between p1 and p2. In the end, I just constructed two ranges. Full code here.

Full code on github.

The core of my solution below using numpy (because I'm learning it!). See github for full code.

Python 3 solution using numpy. I got held up because I assume (but know better) that numpy arrays are [x,y] instead of [row, col], which is [y,x].

Below is the new solution, which works for part 1 and 2. The full code is on GitHub.

These are the key functions. The whole code is on GitHub

Part 2 (extract shown below) was a matter of starting with the low points found in part 1 then recursively looking around for relevant points. Full code on GitHub

Code is on GitHub.

Part 1

Code (to run Part 1 just comment out the call to expand_matrix on line 74).

Here's some sauce, and there's some thoughts (not very interesting this time).

Full code for Part 1 and Part 2, as well as my ramblings.

Part 1, Part 2 , my notes.

Here's the code for Part 1 and 2, along with my notes while I was coding.

And of course here's the whole file on the hub of gits.

Here's the entire file. If the printGood and printDebug looks weird, it's because I have a utils class that uses colorama to make my terminal output colourful. Another thing I added to make it nice but doesn't really do anything.