Scrabble is PSPACE-Complete

Michael Lampis, Valia Mitsou, Karolina Sołtys

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment