well, in opposition to the p neq np problem, this is a fixed boardsize. it's an engineering, optimization, and special-purpose algorithm issue at this point. no need for any solution to work for "all boardsizes" in some measurable, scalable way.
s. On 8/8/08, Robert Waite <[EMAIL PROTECTED]> wrote: > I might come off as being strongly opinionated on the topic.. but I have > been of the opinion for a while that maybe playing go is a problem that > can't be solved by computers. I kinda want p != np and for us to be confined > by mathematics (sorry).The general taunt from my side is that "A computer > can only beat a weak amateur" or "A computer is easily beaten by an amateur > child". > > This record clearly will make those taunts change. It certainly affected my > opinion of the strength of statistical analysis. > > _______________________________________________ > 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/
