Generalized Pete's Pike is PSPACE-complete

In this paper we study the computational complexity of a generalized version of the logic puzzle Pete's Pike by Thinkfun [14]. It is shown that generalized Pete's Pike is PSPACE-complete. Moreover, we construct an infinite family of initial configurations with the property that the length of a shortest solution is superpolynomial in the size of the game.