Two ply (typo) was an example. The original program did one ply global search plus local quiescence. Local quiescence for a joseki move was to complete a few sequences. Obviously not ideal, but better than trying to evaluate a position in the middle of a joseki.
David > -----Original Message----- > From: [email protected] [mailto:computer-go- > [email protected]] On Behalf Of Robert Jasiek > Sent: Monday, November 09, 2009 9:38 PM > To: computer-go > Subject: Re: [computer-go] Joseki Book > > David Fotland wrote: > > in a two play global search, an entire joseki sequence would be one ply. > > This works only ALA the programs don't depart from stored josekis, > right? How could they adapt to non-standard global side-conditions while > treating a joseki as fixed one-ply sequence? They must iteratively > broaden their search again, at least locally while embedding the local > stable results in a global judgement context. So pure one ply seems > improper to me, although one might try to start from it using multiple > local pseudo-one-ply regions before combining them by means of a > possibly / hopefully only / rather global (and therefore relatively > thin) search. > > When you say "two play", do you want to stop global search after exactly > two moves? Wouldn't that be an exaggeration? > > -- > robert jasiek > _______________________________________________ > computer-go mailing list > [email protected] > http://www.computer-go.org/mailman/listinfo/computer-go/ _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
