iBet uBet web content aggregator. Adding the entire web to your favor.
Link to original content: https://doi.org/10.2197/ipsjjip.23.284
2015 Volume 23 Issue 3 Pages 284-292
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.
