Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
Scrabble is PSPACE-Complete
Michael Lampis, Valia Mitsou, Karolina Sołtys
Author information
Keywords: Scrabble, PSPACE-completeness, combinatorial games, computational complexity
JOURNAL FREE ACCESS

2015 Volume 23 Issue 3 Pages 284-292

Details
Download PDF (2753K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
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.
Content from these authors
© 2015 by the Information Processing Society of Japan
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top