Basically, I saw the video River Crossings (and Alcuin Numbers) by Numberphile and decided to do some fun stuff with it :) For future reference, I believe that the paper referenced is: The Alcuin Number of a Graph (Péter Csorba, Cor A. J. Hurkens, Gerhard J. Woeginger, 2008) Here are some resources I'm compiling for the projects:
- Get back to me on that one, love.
Just some homemade roleout of networks/graphs (I'll call them Graphs, consiting of GraphNodes).
Graph nodes need to know what other nodes they're connected to.
All the stuff related to solving the river problem. Note that finding the optimal solution is NP-Hard