Category Archives: SICStus Prolog

Packing Squares into Rectangles

This is is a benchmark problem suggested by Richard Korf. The task is to pack all squares of sizes 1×1 to NxN into the smallest possible rectangle, i.e. into a rectangle with minimal surface. As the problem size increases, this … Continue reading

Posted in 2008, benchmark, CP Conference, Other, puzzle, SICStus Prolog | 3 Comments