I am not using rave yet. Also on list.
David Fotland wrote:
Are you not using rave? If you keep rave counters for each legal move in
the node it should be much bigger than this.
David
-----Original Message-----
From: computer-go-boun...@computer-go.org [mailto:computer-go-
boun...@computer-go.org] On Behalf Of Michael Williams
Sent: Thursday, May 14, 2009 7:08 AM
To: computer-go@computer-go.org
Subject: Re: [computer-go] Implications of a CPU vs Memory trend on MCTS
C# does. It should only take 30 bytes per node to store the information I
need to have. But somehow that turns into 50 bytes. Byte alignment plus
class
overhead, I guess.
Matthew Woodcraft wrote:
Michael Williams wrote:
I want to correct that last statement. With about 350M nodes currently
in the tree (~30M of which fit into memory), I am averaging 0.06 disk
reads per tree traversal.
What makes the nodes so big?
-M-
_______________________________________________
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/
_______________________________________________
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/
