[EMAIL PROTECTED] wrote: > Jacques, > > (Offline) > > Are you saying that you copy the whole board for each move, > when you have a "stack of boards"? > My program Lazarus does that - it's not very expensive and undo is free.
However in play-outs I update the state directly without saving for speed. State copy is cheap if your program does anything more substantial than just play games as fast as possible. - Don > Thanks, > Michael Wing > > >> Well, every implementation is different. In its slowest >> mode, my board stores information about neighbor stones >> in each cell. It has a stack of boards and each board has >> a pointer to its parent. In that mode superko can be >> detected. There is also a faster mode for MC playouts >> that does not support superko. But it could also be >> possible to maintain a stack of previous hashes i.o. >> complete boards, that would not be very expensive. >> > > >>> Another cost is undo. Superko requires undo, unless >>> you want store a hash value with each chain of stones. >>> I am not sure exactly what undo costs, but lets say >>> 5% to 10%. >>> > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/ > > _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
