Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 05, 2009, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Christian Helbling

Sokoban is PSPACE-complete

It is shown that Sokoban, the popular puzzle game, can be used to simulate Turing machines. This will show that the decision problem of deciding whether a given Sokoban puzzle has a solution is PSPACE-complete.

Work by Joseph C. Culberson, Technical Report TR 97-02, 1997.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login