Announcements

Course Overview
  Prerequisites

Grading

Schedule
  Lab Times
  Office Hours

Calendar
  Lecture notes
  Lab materials
  Homework
  Test reviews

Textbooks
  Web Resources
  Drop in Tutoring

Academic Integrity

Homework
  Due Date and Time
  Late Day Policy
  Compilers
  Electronic Submission

Programming Tips

C++ Development
  Cygwin
  Emacs
  Dev C++
  MinGW

Other Information

The puzzles for Homework 6:
Box Packing Recursion

We created a number of simple puzzles for this assignment. Your program should be able to finish analysis of these puzzles in a reasonable amount of time (no more than a few minutes).

• puzzle1.txt (puzzle1_solutions.txt)
• puzzle2.txt
• puzzle3.txt
• puzzle4.txt
• puzzle5.txt

For fun, we include some more difficult puzzles. To solve these puzzles you will need to think carefully about the efficiency of your algorithm (extra credit).

• squared_square.txt
  Problem: Subdivide a square into smaller squares of all different sizes.
  Minimal solution: 21 squares
  Discovered by A.J. Duijvestijn (Netherlands) by computer in 1978.

• bcp_9_piece.txt and bcp_15_piece.txt
  Both puzzles designed by Bill Cutler, 1983.