A Graph-Theoretic Model for a Generic Three Jug Puzzle

Abstract

In a classic three jug puzzle we have three jugs $A$, $B$, and $C$ with some fixed capacities. The jug A is fully filled with wine to its capacity. The goal is to divide the wine into two equal halves by pouring it from one jug to another without using any other measuring devices. This particular puzzle has a known solution. However, we consider a generic three jug puzzle and present an independent graph theoretic model to determine whether the puzzle has a solution at first place. If it has a solution, then the same can be determined using this model.Comment: 12 pages, 1 figur