Please consult MPG, it explains Gist. It can do much more... Christian
-- Christian Schulte, www.gecode.org/~schulte Professor of Computer Science, KTH, cschu...@kth.se Expert Researcher, SICS, cschu...@sics.se -----Original Message----- From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf Of Johannes Waldmann Sent: Tuesday, January 17, 2017 13:43 To: cschu...@kth.se; users@gecode.org Subject: Re: [gecode-users] tracing without programming? Hi Christian, > tracing does not trace search it traces propagation and is really not > meant for instructional purposes. sorry for not being clear enough, "propagation" *is* a topic of my course. (using parts of Chapter 7 of: Apt: Principles of C.P.) > Have you tried Gist instead: Thanks, I will. - What does it do, exactly: it does run a full search (until next or all solutions), then draws the tree? I see that I can inspect a node, to see a domain assignment. Is it also possible to "inspect an edge", that is, to see why the domain assignment changed when going from a node to its child? - J. _______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
smime.p7s
Description: S/MIME cryptographic signature
_______________________________________________ Gecode users mailing list users@gecode.org https://www.gecode.org/mailman/listinfo/gecode-users
