Computational Complexity of Checkers

• Hierarchy of intractability
  • NP-Completenss
  • PSPACE-Completeness
  • Undecidability
• Canonical NP-Complete problem: SAT
• Canonical PSPACE-Complete problem: Quantified SAT
• Informal relationship of QSAT to two-player perfect-information games