Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
