Paper Assignments 12, 13
Due date: 4/22

Paper 12: Demaine_2017_1706.06708 Optimal Cubes
    - Read Sections 1-4
    - Solving the Rubik’s Cube Optimally is NP-complete. Jun 2017. arXiv:1706.06708.
    - https://arxiv.org/abs/1706.06708
    - Group: G7

Paper 13: Ani_2020_2006.01256 Doors
    - Read Sections 1, 2, 5
    - Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets.
    - https://arxiv.org/abs/2006.01256
    - Group: G9