Consider the following two-person version of the language
Chapter , Problem 8.15(choose chapter or problem)
Consider the following two-person version of the language PUZZLE that was described in 7.28. Each player starts with an ordered stack of puzzle cards. The players take turns placing the cards in order in the box and may choose which side faces up. Player I wins if all hole positions are blocked in the nal stack, and Player II wins if some hole position remains unblocked. Show that the problem of determining which player has a winning strategy for a given starting conguration of the cards is PSPACE-complete.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer