On Dec 7, 2006, at 9:05 AM, Don Dailey wrote:
Are you trying to keep a lot of information updated? Mine only tries
to play random games as fast as possible. It does not have the
ability
to undo moves - this is easily handled by copying state when you need
this feature.
I do have the undo ability, but I think it's done in (I think) a very
efficient way. For example, when I want to undo a bunch of move at
once (e.g., after a MC run) I just reduce a stack pointer.
There is also about a 2 to 1 slowdown if you are not finding the
random
legal moves properly. I don't know if you are or not, but look at
the
recent emails on this, one of mine and one by Lex Luthor - or was it
Lukasz Lew?
I think my technique here is faster than those recently described,
because I don't bother building a data structure.
In related news, I've just multithreaded my program and ... it's
slower than the single-thread version! I'm pretty sure that this
happened because I threaded it at too fine a scale; I'm incurring the
overhead of thread creation for each MC run. I'll have to do some
thinking about how to reorganize this.
Peter Drake
Assistant Professor of Computer Science
Lewis & Clark College
http://www.lclark.edu/~drake/
_______________________________________________
computer-go mailing list
[email protected]
http://www.computer-go.org/mailman/listinfo/computer-go/
