Scrabble is PSPACE-Complete
Computational Complexity
2012-01-26 v1
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.
Cite
@article{arxiv.1201.5298,
title = {Scrabble is PSPACE-Complete},
author = {Michael Lampis and Valia Mitsou and Karolina Sołtys},
journal= {arXiv preprint arXiv:1201.5298},
year = {2012}
}