Hi, I've decided to build a go program based on combinatorial game theory, And I'm looking for any pointers or advice that might save me trouble later. I looked a little in the archives, and while there are references to CGT in a few places, I haven't seen any attempts to build a full engine around it. I found cgsuite at http://cgsuite.sourceforge.net/, which is very helpful for understanding the underlying algorithms and source code. Has anyone tried this before, and do they have some warnings or advice to share? My basic plan is this:
In the beginning, partition the board into hard "subgames" maybe 3x3 blocks or similar. Calculate the temperature for each subgame, and play thermostrat as described. I don't expect this program to play very well, but it should be lightning fast: at each move, only the local subgame needs to be re-evaluated (and perhaps adjacent subgames, since captures may run across the games). Once that code works, I want to start on the hard part: dynamically resizing the subgames based on play. I imagine in the early game there's really only one game, and as midgame approaches the board slowly breaks up into mostly independant chunks. I haven't worked out the details of this yet, but my basic idea is to start with very small subgames and merge them when it seems likely two games affect each other, using some heuristics based on shared liberties, etc. Well, that's my idea, does it sound like it my work? -Tom Nelson
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
