No, it is not. It is plain vanilla DFS.
However, you can implement your own search methods as Gecode features an
enormously powerful interface for programming search. In particular, as
search is based on recomputation and copying, any move in the tree is easy.
We exploit that, for example, to some
Hi,
> However, you can implement your own search methods as Gecode features an
> enormously powerful interface for programming search. In particular, as
> search is based on recomputation and copying, any move in the tree is easy.
>
Is there any paper or documentation for that recomputation stu
Not that much dedicated to Gecode in particular. But the interface is in
large aspects very close to the Mozart interface for search which is well
documented:
http://web.it.kth.se/~cschulte/paper.html?id=Schulte:LNAI:2002
The only difference is how recomputation in detail works, but that b
Hi,
I actually do not understand your question nor its context. This user group
is dedicated to how to _use_ Gecode, a system designed for solving
combinatorial constraint problems.
Your questions go more into the direction of how to _abuse_ Gecode. The use
of constraints in CCP and its var
Just out of interesest, I wonder how this relates to the constraint store ?
More specifically, if a constraint does GECODE_REWRITE(...) I can imagine
the space could be cloned at that point ? Anything further in the search
space will be recomputed from that clone (with rewritten constraint) on,
Cloning is full cloning: not only the variables but everything is copied,
including propagators, branchings, what not.
So in your concrete example, if you keep a clone c of a space s and then do
something to s, it will not change c.
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
---
On Mon, Jun 09, 2008 at 10:42:02PM +0200, Christian Schulte wrote:
> Yes, using a search engine should point always to the freshest version. It
> is highly annoying if you get zillions of webpages all of which are out of
> date (for example, Java and many other software packages require (or ask
> f
On Mon, Jun 09, 2008 at 10:41:41PM +0200, Guido Tack wrote:
> Oliver Kullmann wrote:
> >P.S. Regarding the documentation one finds the statement:
> >
> >"We kindly ask that documentation is not installed anywhere in such
> >a way that it will be indexed by search engines."
> >
> >I wonder what is
