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

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

## 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.**

- Prepare any written text and/or figures (typeset or scanned) and/or
photographs of models into a single file in
**PDF format**,
and submit it via
**Gradescope**.

**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.

**
****
**
**Problem Set 5
— Project Preproposal
**

*Due:* Thursday, October 8, 2020
**
**
**Problem Set 6
— Project Proposal
**

*Due:* Thursday, October 22, 2020

[extended from October 15]
**
**
Problem Set 8
— Project Report 2

*Due:* Thursday, November 12, 2020

Problem Set 9
— Project Report 3

*Due:* Thursday, November 19, 2020