A Graph-Theoretic Model for a Generic Three-Jug Puzzle
History and Overview
2025-10-03 v4 Discrete Mathematics
Combinatorics
Abstract
A classic three-jug puzzle asks, given three jugs , , and with fixed maximum capacities, with jug 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.
Cite
@article{arxiv.2308.13868,
title = {A Graph-Theoretic Model for a Generic Three-Jug Puzzle},
author = {Suresh Manjanath Hegde and Shashanka Kulamarva},
journal= {arXiv preprint arXiv:2308.13868},
year = {2025}
}
Comments
14 pages, 3 figures