Scrabble is PSPACE-Complete

Details Scrabble is PSPACE-Complete Scrabble is PSPACE-Complete

2012-01-25

arxiv.org/abs/1201.5298v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Scrabble is PSPACE-Complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scrabble is PSPACE-Complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scrabble is PSPACE-Complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-683582