18. 0- and 2-Player Games

MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
View the complete course:
Instructor: Erik Demaine

In this lecture, Professor Demaine proves hardness for game with fewer or more than one player.

License: Creative Commons BY-NC-SA
More information at
More courses at