Scrabble is PSPACE-Complete
Michael Lampis, Valia Mitsou, and Karolina So{\l}tys
TL;DR
This paper proves that the computational complexity of Scrabble is PSPACE-complete, establishing its difficulty level in terms of computational resources needed to solve or analyze the game.
Contribution
It demonstrates the PSPACE-completeness of a derandomized version of Scrabble, resolving an open problem in computational complexity theory.
Findings
Scrabble is PSPACE-complete in a derandomized model
The result answers an open question by Demaine and Hearn
The complexity classification impacts understanding of game difficulty
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge