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/
