Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 009 (Perfect square placement) — Constraint detection

The perfect square placement problem -LRB- also called the squared square problem -RRB- is to pack a set of squares with given integer sizes into a bigger square in such a way that no squares overlap each other and all square borders are parallel to the border of the big square . For a perfect placement problem , all squares have different sizes . The sum of the square surfaces is equal to the surface of the packing square , so that there is no spare capacity .

Problem 009 (Perfect square placement) — Detection of the decisions and objects to be modeled

The perfect square placement problem -LRB- also called the squared square problem -RRB- is to pack a set of squares with given integer sizes into a bigger square in such a way that no squares overlap each other and all square borders are parallel to the border of the big square . For a perfect placement problem , all squares have different sizes . The sum of the square surfaces is equal to the surface of the packing square , so that there is no spare capacity .

Back to list