A classic three-jug puzzle asks, given three jugs $A$, $B$, and $C$ with fixed maximum capacities, with jug $A$ filled with wine to its maximum capacity, whether is it possible to divide the wine into two halves by pouring it from one jug to another without using any other measuring devices. However, we consider a generic version of the three-jug puzzle and present an independent graph-theoretic model to determine whether the puzzle has a solution at all. If it has a solution, then the same can be determined using this model. We also present the sketch of an algorithm to determine the solution of the puzzle.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。