A Hashtable is the "natural" solution to this. In a Hashtable it does not
matter if its a tree or a DAG. The hashtable works just better if it is a
DAG.
Chrilly
----- Original Message -----
From: "Peter Drake" <[EMAIL PROTECTED]>
To: "Computer Go" <computer-go@computer-go.org>
Sent: Thursday, December 07, 2006 11:46 PM
Subject: [computer-go] firstChild/nextSibling in a DAG
(This is all within the context of Monte Carlo.)
Is anyone storing a search DAG (as opposed to a tree) and using the
firstChild/nextSibling representation? I'm having trouble seeing how this
would work, since when you traverse children (e.g., in UCT) you have to
know which move is associated with which child node. If a node might have
more than one parent, the node can't store its last move.
Any clever solutions?
If not, any opinions (or better yet, evidence) as to whether the space
savings or the DAG transposition table is more valuable?
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
