<snip> > > 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 > Do you know a reference for this result? Thanks. Tom.