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

Prof. Erik Demaine       TA: Jayson Lynch

[Home] [Problem Sets] [Project] [Lectures] [Problem Session Notes] [Accessibility]

Problem Sets

Problem sets will be posted here roughly weekly, with announcements to the class mailing list. They will generally be due at the beginning of class the Tuesday after they are assigned.

You are welcome to collaborate on problem sets, but your write-ups must be your own, and your problem sets must list your collaborators. Please hand in a physical copy of your solutions, including any physical foldings requested. Any loose pieces of paper should be labeled with your name, just in case they slide out.

[Cover page of Problem Set 1]
Problem Set 1 — Solutions
Due: Tuesday, September 18, 2012
[Cover page of Problem Set 2]
Problem Set 2 — Solutions
Due: Tuesday, September 25, 2012
[Cover page of Problem Set 3]
Problem Set 3 — Solutions
Due: Tuesday, October 2, 2012
[Cover page of Problem Set 4]
Problem Set 4 — Solutions
Due: Thursday, October 11, 2012
[Cover page of Problem Set 5]
Problem Set 5 — Solutions
Due: Tuesday, October 23, 2012

Deadlines refer to the beginning of class that day. If there is no class on the day of the deadline, turn in your problem set into Erik's office, 32-G680, sliding it under his door if no one is there.