Tag Archives: pathing

Code available here: github.com/KevinNJ Overview: So, I was trying to solve XKCD’s infinite resistor problem (xkcd.com/356). After some thought, this method probably won’t be useful, but it still has some interesting applications.  Problem: On a infinite grid, find all paths … Continue reading →