<nitpick>

If GCD(X, Y) <> 1, then any value of T can be obtained provided that T > X*Y - X - Y

I think your condition is not stated correctly. If X = 2 and Y = 4, then no odd T is achievable. Perhaps the condition should be any T where T is a multiple of GCD(X, Y)? </nitpick> And on to the list.

It seems like dynamic programming is the way to go for either optimization. Essentially I see it in two stages: determining algorithms for obtaining all water amounts less than the bigger jug and then application of the Knapsack problem. I'm gonna go off with a pen and paper to think about how to achieve that first part. Don't tell my boss.

In reply to Re: Challenge: N Jugs Problem by kennethk
in thread Challenge: N Jugs Problem by Limbic~Region

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.