1. A method of performing constraint satisfaction problem (CSP) solving, comprising evaluating nodes of a CSP tree for a TRUE or FALSE state according to a script, wherein the tree models a CSP problem and the script associates rules and corresponding actions with each tree node, during a step of evaluating a specific node, computing a backjump pointer according to a specific rule associated with the specific node, wherein the value of the computed backjump pointer identifies an ancestor node of the tree, and upon a failure to evaluate the node to a TRUE state, restarting evaluation at the ancestor node identified by the backjump pointer.