In the game of Go, the question of whether a ladder---a method of capturing
stones---works, is shown to be PSPACE-complete. Our reduction
closely follows that of Lichtenstein and Sipser , who
first showed PSPACE-hardness of Go by letting the outcome of a game
depend on the capture of a large group of stones. We achieve
greater simplicity by avoiding the need for pipes and crossovers.