It was article by former backgammon world champion Bill Robertie in eighties. So maybe hard t google up
petri ----- Alkuperäinen viesti ----- > Dear all, > > I've been told recently that there are some works measuring how deep > a game is as follows: > - consider a fixed 0.5 < p < 1; > - consider how many categories of people you can find such that the > category number n wins with probability p against the catégory number > n-1. > > Clearly, this is not so well defined - but it's interesting (at least > to me :-) ). > I've discussed with several people, some of them saying "oh yes I > remember I've already > seen this", but nobody could remember the reference. Any precise > reference or key word I could google ? > > Best regards, > Olivier > _______________________________________________ > Computer-go mailing list > Computer-go@dvandva.org > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list Computer-go@dvandva.org http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
