There are many ways to skin a cat. I allocate them dynamically, but recycle the nodes no longer needed for performance. And I use 'aspect programming' that optionally (after a recompile) checks for dangling pointers.

Mark

On Jul 14, 2009, at 5:06 AM, Carter Cheng wrote:


This is something I have been curious about since I am somewhat new to writing code in languages which require explicit memory management (as opposed to have some sort of garbage collector do it for you). The question is how do most programs manage memory w.r.t. the search nodes? Is the memory preallocated in advance or is there some strategy to grow the space required as the nodes accumulate during a search?

Thanks in advance,

Carter.



_______________________________________________
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/

Reply via email to