Scrabble is PSPACE-Complete
classification
💻 cs.CC
keywords
gamescrabbleansweringcomplexitycomputationaldemainederandomizederik
read the original abstract
In this paper we study the computational complexity of the game of Scrabble. We prove the PSPACE-completeness of a derandomized model of the game, answering an open question of Erik Demaine and Robert Hearn.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.