Let me propose the following rules for comment:
1) The vast majority of your time is spent making RANDOM moves
(beyond the leaves of your tree).
2) Almost none of your nodes have more than one child.
These, along with the KISS principle, seem to point to a lot of
optimizations in both time and space. For example, that latter
suggests that the first child / next sibling tree representation
mentioned here recently is a much better idea than the array-of-
children representation I'm currently using.
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/
