Day 8

What is the least number of cuts that must be made in order to completely cut through this rope fence? **Note: The knots where multiple ropes meet are too thick to cut through.**

This puzzle can be solved intuitively and with trial-and-error, but there's also a beautiful result from graph theory, the Max-Flow Min-Cut Algorithm, that can be used to both solve this puzzle and to quickly prove the solution optimal. Use the link to learn how the result applies!

×

Problem Loading...

Note Loading...

Set Loading...