On 3/31/06, Russ Abbott <[EMAIL PROTECTED]> wrote:
Chris,For a course I taught last Fall using Oz, I developed a solver that does either depth first or breadth first depending on a parameter. (The actual difference in the code is amazingly small.) It's here if you are interested.-- Russ
On 3/31/06, Christian Schulte <[EMAIL PROTECTED] > wrote:Dear Chris,
at some time breadth-first actually was included in Mozart. However, as
people tend to not understand that this uses _exponential_ rather than
linear memory in the depth of a search tree I kicked it out. But as you say
yourself: roll your own!
Christian
--
Christian Schulte, http://web.imit.kth.se/~schulte/
-----Original Message-----
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] ] On
Behalf Of Chris Rathman
Sent: Friday, March 31, 2006 7:11 PM
To: [EMAIL PROTECTED]
Subject: Breadth-First Solve
The Solve function given in CTM is Depth-First. I was wondering if
there is a BFSolve function that does a Breadth-First search? So if I
have the following:
{Browse
{BFSolveAll
fun {$}
choice
choice 1 [] 3 end
[] choice 2 [] 4 end
end
end}}
Depth first gives the results of [1 3 2 4] whereas a Breadth-First would
give the results of [1 2 3 4].
Probably wouldn't be difficult to modify Solve to change the search
strategy, but then it's even easier just to ask on the Oz mailing list. :-)
Thanks,
Chris Rathman
____________________________________________________________________________
_____
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
_________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
