We've moved on to problems that really require search. The jugs puzzles are simple examples.
In thinking about how to control search, I wrote a simple iterative deepening framework using the technique from the map-coloring example in
http://www.mozart-oz.org/documentation/fdt/node28.html#section.minimizing.mapcolor.
Please let me know if there is a way to do this sort of puzzle without search. One could generate constraints among jug sizes and amounts, but it seems that the number of variables to be used in the equations cannot be known in advance. One must search to determine how many intermediate variables will be needed in the constraint equations that relate the starting condition to the terminal condition.
-- Russ
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
