On Mon, Oct 26, 2015 at 5:51 PM, Gonçalo Mendes Ferreira <[email protected]> wrote:
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. > I think I understand how that works. At least roughly. I believe we just approach things from a different angle. I use Ruby professionally to write web apps so it’s totally fine to have slow code (given a database AND an internet connection the language speed doesn’t really matter) so I’m used to writing code that is easy to understand. Maybe one day I’ll have to improve this here (after all 100pps aren’t that good) but for now I’ll focus on implementing everything that Michi does. There’s still so much to do feature wise and that’s so much more fun. :) Urban -- Blog: http://bettong.net/ Twitter: https://twitter.com/ujh Homepage: http://www.urbanhafner.com/
_______________________________________________ Computer-go mailing list [email protected] http://computer-go.org/mailman/listinfo/computer-go
