On algorithmic approach to the two jugs problem

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The two jugs problem is a classic problem in discrete mathematics, recreational mathematics, articial intelligence, problem solving, cognitive psychology and computer programming. The methods of solutions are often based on heuristics or search methods, which could be time and memory consuming. In this paper, we introduce a simple algorithmic approach to tackle this problem and discuss how to obtain the optimal solution. Some illustrative examples are provided. Copyright © 2015 Yiu-Kwong Man.
Original languageEnglish
Pages (from-to)1787-1796
JournalApplied Mathematical Sciences
Volume9
Issue number36
DOIs
Publication statusPublished - 2015

Fingerprint

Discrete mathematics
Heuristic Method
Search Methods
Programming
Optimal Solution
Psychology
Intelligence

Citation

Man, Y.-K. (2015). On algorithmic approach to the two jugs problem. Applied Mathematical Sciences, 9(36), 1787-1796.

Keywords

  • Algorithm
  • Diophantine equation
  • Problem solving
  • Two jugs problem