It had been my tentative plan to introduce search through standard Prolog backtracking and then to show how FD-style search was a lot more efficient. That's one reason I wanted to do CTM chapter 9 and then CTM chapter 12--to solve a problem using basic Prolog-style backtracking and then to solve the same problem using FD.
But I now suspect that I can't do that. I don't see how I can express standard Prolog-style backtrack search in Oz. Am I wrong?
I was apparently also confused about FD. I had imagined that FD would apply to any finite domain. Looking at the tutorial, CTM, and the FD documentation, it now seems that FD is restricted to integers.
For example, I wanted to do a simple version of the Zebra puzzle . When I looked at the Zebra solution (http://www.mozart-oz.org/documentation/fdt/node23.html
) for guidance, I found that even though the problem has no numbers in its problem statement, the solution is expressed in terms of integers (house numbers). Is there any way to do this problem (using FD or some other Oz feature) that doesn't require that the search space be defined in terms of integer ranges?
Finally, I'm also confused about terminology. In the Zebra puzzle, the distribute line is
{FD.distribute ff Nb}. But the documentation for FD.distribute says the final argument must be a vector of FD ranges. Nb isn't a vector. It'
s a record whose fields have integer ranges as values. So what is the limitation on the final argument of FD.distribute?
Thanks.
-- Russ
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
