1. Measuring With Jugs A Solution in Finite Domain

2. Intro to Oz * variables -- a set of alphanumeric characters starting with a CAPITAL letter * atoms -- set of alphanumeric characters beginning with a lower case letter (anAtom in would be equivalent in Java to"anAtom") * keywords – declare, fun, Browse

3. Other Neat Stuff -- virtual strings -- virtual stringsa#b#c -- lists -- lists [a b c] [a b c] -- records -- records sol(A B C) #(a b c) #(a b c)

4. Functions This is what an Oz Program looks like:

5. The Algorithm background -- others who have analyzed it explanation CapA*TimesA-CapA*TimesANeg

6. Constraint Programming + finite domain integers + constraints + how it works (as opposed to logic programming like Prolog)

7. Constraint Programming Applied Algorithm to Code - 2 jugs - n jugs - show output - explain output numbers CapA*TimesA-CapA*TimesANeg

8. Numbers to Operations + show structure of functions + show code bits + show output

9. Multiple Solutions May include this!

10. Conclusion This shows that Finite Domain Constraint Programming is useful for areas where it might not at first seem useful.