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 extra pruning of the tree during branch and bound search.
Cheers Christian -- Christian Schulte, www.ict.kth.se/~cschulte/ -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Debdeep Banerjee Sent: Tuesday, June 10, 2008 8:44 AM To: [EMAIL PROTECTED] Subject: [gecode-users] Intelligent backtracking methods Hi, I want to know if the DFS search implements any intelligent backtracking methods (for example backjumping, conflict directed backjumping etc). Thanking you. With regards Debdeep -- Debdeep Banerjee PhD Candidate CSL/RSISE/NICTA Australian National University Email: [EMAIL PROTECTED] Web:http://rsise.anu.edu.au/~banerjed _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
