The values of the grid are hard-coded into the program, which I'm not
all that proud of. That being said, it checks every possibility with no
duplicates. It takes a grid of ints, and finds the largest product of 4
consecutive numbers up,down, or diagonal.
This is cool. It uses triangular numbers (1, 1+2, 1+2+3,...), and
calculates the number of factors each one has. Then returns the first
one with more than a certain number of factors.
This one I'm not proud of. It's basic path finding, but I should look
into how to make it with a loop instead of recursion, as there are far
too many stack pointers slowing it down noticeably after a 10x10 grid.
Also, I use global variables for the purpose of easing the stack, but it
still feels dirty.
Updated the readme to be more accurate with how I am using this repo.