Scrabble is PSPACE-Complete

Michail Lampis (1) , Valia Mitsou (2) , Karolina Sołtys (3)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 Hokkaido University [Sapporo, Japan]
3 UCL-CS - Department of Computer science [University College of London]

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.

Mots clés: Scrabble; PSPACE-completeness; combinatorial games; computational complexity

Domaines: Informatique [cs]

Michail Lampis, Valia Mitsou, Karolina Sołtys. Scrabble is PSPACE-Complete. Journal of Information Processing, 2015, 23 (3), ⟨10.2197/ipsjjip.23.284⟩. ⟨hal-01490637⟩