Pebbles prunes least recently used nodes. This eliminates nodes
from previous searches first, and then nodes from the current search.
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
> Pebbles prunes least recently used nodes. This eliminates nodes
> from previous searches first, and then nodes from the current search.
Why do you keep nodes from previous searches? By search, do you mean a
"genmove"? How do you store which nodes are oldest (queue, heap)?
--
GRATIS für alle GM
I did this, stopping search if other moves mathematically couldn't
catch up. I found that the savings in percentage of total nodes
depended on how many playouts the program did. The larger the number
of playouts, the larger the savings. I also made a rule where after a
certain percentage of the tot
>Why do you keep nodes from previous searches?
All of the descendants of the move you choose are relevant to
future searches. Plus whatever nodes can be reached by transposition.
(In Go, there are a lot of transpositions.)
>By search, do you mean a "genmove"?
Move generation and pondering.
>
