Journal of Information Processing
Online ISSN : 1882-6652
Scrabble is PSPACE-Complete
Michael LampisValia MitsouKarolina Sołtys
Author information
JOURNALS FREE ACCESS

2015 Volume 23 Issue 3 Pages 284-292

Details
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.

Information related to the author
© 2015 by the Information Processing Society of Japan
Previous article Next article
feedback
Top