I must admit that I don’t quite follow how you’ve implemented things, but
then you seem to be further along than me as I haven’t even started with
transposition tables.
Urban
Well I took the liberty to steal and very crudely modify a MCTS diagram
from wikipedia:
http://pwp.net.ipl.pt/alunos.isel/35393/mcts.png
Maybe with images it is clearer. You seem to be using an acyclic graph
with pointers for the arcs. When you need to find transpositions, and
free malloc'd nodes because you're out of memory, I find my solution
much more practical because all the information for selecting what play
to make is in the current node. But Pachi is no small program so I'm
sure I'm wrong somewhere.
Gonçalo
_______________________________________________
Computer-go mailing list
[email protected]
http://computer-go.org/mailman/listinfo/computer-go
