[computer-go] IEEE Spectrum article by Deep Blue creator

[A van Kessel]

> I think he is betting on null move proving - but I'm real skeptical that
> it will be effective in Computer Go.   It will indeed reduce the tree

IMHO null-move mixes badly with ko-tactics, effectively doubling
(or squaring ? ;-) the tree size.
It might be of some use in solving "local" sub-problems.

It still has the scent of alpha-beta-with-some-evaluation-function,
which is probably not the right paradigm for go.

We'll see.
AvK