[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [computer-go] Modern brute force search
Vincent Diepeveen wrote:
In whatever game we play.
The 361 stone go database will beat of course every player very easily,
just like a 32 stone database in chess will beat the strongest players very
easily.
The reality is of course that by the time we have a 32 stone database and
that there will be a 361 stone database for go, that players have looked
into it and already know the best line by head.
Really? Do you know a go player who knows the "best line"? Wow!
So they can win with white in chess and with black in go very easily when
using the optimum line.
Well, sure, theoretically. That is to say, _if_ they know the optimum line.
Again, I must ask, who is this go player, who knows the optimum line?
I think that the rest of the go world would like to meet this great master!
--
Richard L. Brown Office of Information Services
Senior Unix Sysadmin University of Wisconsin System
780 Regent St., Rm. 246
rbrown@xxxxxxxxxxxxxxxxx Madison, WI 53715
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/