What information is stored for each search node >and how is this information used to update ancestor nodes and direct the >search. The result (win, win-likely, ko, unknown, lose-likely, lose), the confidence (0 to 100), the confidence of the most refuting node below this one, has this node been evaluated. Confidence values are passed toward the root, using the usual probability formulas. David