Re: computer-go: Two ways to program a GO-engine

["Charles Matthews" <charles@xxxxxxxxxxxxxxxxxx>]

From: sorin gherman

>>This is one occasion when it is useful to call on the theoretical result,
>>that Go is NP complete.  Therefore there cannot be this sort of hidden
>>secret, valid on boards of all sizes, depending only on computation linear
>>in the board size.
>>
>>Charles
>
>    That means there is no good ALGORITHM for that. But it doesn't mean
>there is no WAY to do it. We just have to go beyond today's technology /
way
>of thinking :)


This may make some sort of sense (but is 100% off-topic for this list).

The more interesting point might be that worst case complexity is a bad
theoretical tool for discussing strength of programs.

Charles