Is there a concrete algorithm to solving the water jug problem?
For 3 jugs, each of different capacities, and a target value (all integers).
Does an algorithm exist? If so, what is it?
Also, what is the best type of variable to use for the water jugs in c++?