Is there a generalization of the GO game that is known to be Turing complete? Is there a generalization of the GO game that is known to be Turing complete?

If no, do you have some suggestions about reasonable (generalization) rules that can be used to try to prove that it is Turing complete?  The obvious one is that the game must be played on an infinite board (positive quadrant). But what about in-game play and end game conditions?
Related:  Rengo Kriegspiel, a blindfolded, team variant of Go, is conjectured to be undecidable.

http://en.wikipedia.org/wiki/Go_variants#Rengo_Kriegspiel

Robert Hearn's thesis (and the corresponding book with Erik Demaine) discuss this problem.  They prove other problems undecidable through "TEAM COMPUTATION GAME", which is reduced directly from Turing machine acceptance on empty input (see Theorem 24 on page 70 of the thesis).  So it seems to me that such a reduction would imply Rengo Kriegspiel is Turing complete.

On the other hand, their discussion says that this reduction would be very difficult (see page 123). So while this is a potential avenue, it appears that it has been looked into previously.