[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [computer-go] Search = Bad!



At 17:51 19/02/2005, you wrote:

Do you know of any games in which a formula can be used to find the best move?
Well, do you count max_m1(min_m2(max_m3(min...)))?
The solution of Nim has a simpler formula.

The complexity results about go (isn't it P-space hard?) put an upper bound on
how good a go playing algorithm can be, but that doesn't mean that there isn't
room for massive improvement over what we have at the moment.

--
No virus found in this outgoing message.
Checked by AVG Anti-Virus.
Version: 7.0.300 / Virus Database: 266.1.0 - Release Date: 18/02/2005



_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/