6.849: Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2020)

Prof. Erik Demaine; Martin Demaine; TAs Yevhenii Diomidov & Klara Mundilova


[Home] [Lectures] [Problem Sets] [Project] [Coauthor] [Github]

Problem Sets

Problem sets will be posted here roughly weekly, with announcements to the class mailing list. They will generally be due at 7:00pm on Thursdays (the beginning of Thursday's class), one week after they are assigned.

Collaboration policy. Problem sets can be solved collaboratively, but you should first attempt the problem on your own; then you may discuss with other students in the class; and your final write-up must be your own. Your problem set must also list your collaborators.

How to submit.

Late policy. You can request an extension of up to two days on any problem set by emailing your issue (heavy workload, travel, sickness, hangover, etc.) to 6.849-extensions@mit.edu before the problem set is due; reasonable such extension requests will be approved. You can request further extensions by emailing 6.849-extensions@mit.edu and committing to not looking at the released solutions, and problem sets extended beyond two days have a maximum score of 50% and aren't guaranteed feedback from the graders. Exceptions to this (extensions granted after the deadline or extensions of more than two days without penalty) require a note from a dean.


[Cover page of Problem Set 1]
Problem Set 1Solutions
Due: Thursday, September 10, 2020
[Cover page of Problem Set 2]
Problem Set 2Solutions
Due: Thursday, September 17, 2020
[Cover page of Problem Set 3]
Problem Set 3
Due: Thursday, September 24, 2020
[Cover page of Problem Set 4]
Problem Set 4
Due: Thursday, October 1, 2020
[Cover page of Problem Set 5]
Problem Set 5 — Project Preproposal
Due: Thursday, October 8, 2020
[Cover page of Problem Set 6]
Problem Set 6 — Project Proposal
Due: Thursday, October 22, 2020
[extended from October 15]
Problem Set 7 — Project Report 1
Due: Thursday, November 5, 2020