18. 0- and 2-Player Games - hypernaturalgames.com

18. 0- and 2-Player Games

MIT OpenCourseWare
Views: 1649
Like: 16
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


  1. Can someone explain that comment at 1:18:44 ? It seems useful but I don't understand what that gadget is good for.

Leave a Reply

Your email address will not be published.