Skip to main content
SpringerLink
Log in

Scrabble Is PSPACE-Complete

  • Conference paper
Fun with Algorithms (FUN 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7288))

Included in the following conference series:

  • 1412 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Demaine, E.D., Hearn, R.A.: Playing games with algorithms: algorithmic combinatorial game theory. In: Games of No Chance III, Proc. BIRS Workshop on Combinatorial Games, pp. 3–56. Citeseer (July 2005)

    Google Scholar 

  2. Fraenkel, A.S., Lichtenstein, D.: Computing a perfect strategy for n × n chess requires time exponential in n. Journal of Combinatorial Theory, Series A 31(2), 199–214 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. Iwata, S., Kasai, T.: The othello game on an n × n board is pspace-complete. Theoretical Computer Science 123(2), 329–340 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Papadimitriou, C.H.: Computational complexity (1994)

    Google Scholar 

  5. Robson, J.M.: N by n checkers is exptime complete. SIAM J. Comput. 13(2), 252–267 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KTH Royal Institute of Technology, Sweden

    Michael Lampis

  2. Graduate Center, City University of New York, USA

    Valia Mitsou

  3. Max Planck Institute für Informatik, Germany

    Karolina Sołtys

Authors
  1. Michael Lampis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valia Mitsou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Karolina Sołtys
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Col. By Dr., K1S 5B6, Ottawa, ON, Canada

    Evangelos Kranakis

  2. Department of Mathematics and Computer Science, Wesleyan University, 06459, Middleton, CT, USA

    Danny Krizanc

  3. Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari, Via Torino 155, 30172, Mestre (Ve), Italy

    Flaminia Luccio

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lampis, M., Mitsou, V., Sołtys, K. (2012). Scrabble Is PSPACE-Complete. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30347-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30346-3

  • Online ISBN: 978-3-642-30347-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation