Go is a popular game which has been played for several millennia
throughout Asia.  Although {\em playable} rules are relatively simple
(tournament rules can include many technicalities), the game is
strategically very challenging.  Go is replacing Chess as the 
pure strategy game of choice to serve as a test-bed for artificial
intelligence
ideas.

In a Go endgame, each local area of play has a polynomial size
canonical game tree and is insulated from all other local areas by
live stones.  Using techniques from combinatorial game theory, we
prove that the Go endgame is PSPACE-hard.