Keeping a real tree is of course tivial. I guess you mean a way to preserve the benefits of transposition while also maintaining admisibility. That does seem like it would be tricky.
On Fri, Jul 8, 2011 at 9:24 PM, <[email protected]> wrote: > Quoting Michael Williams <[email protected]>: > > >>> The Valkyria tree is not a pure tree, because a node can have several >>> parents if more than one sequence leads to a position. >>> >>> Best >>> Magnus >>> >>> >>> >> I think this is common, but inadmissable in the strictest sense, >> right? Because the optimal action for a node depends on it's history of >> positions thanks to the super ko rule. >> >> What was the word Don used for techniques like this? I mean techniques >> that >> are not going to lead to perfect play given infinite time and memory. >> >> > Yes, you are right. For the next rewrite of Valkyria I actually think i > rediscovered some algorithm to solve this but it is painfully complicated to > implement. > > Luckily it is extremely rare that affect play (I think). > > ______________________________**_________________ > Computer-go mailing list > [email protected] > http://dvandva.org/cgi-bin/**mailman/listinfo/computer-go<http://dvandva.org/cgi-bin/mailman/listinfo/computer-go> >
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
