Recursive Depth-First Method

Current board B <- empty board.

Remaining pieces Q <- all pieces.

Call Solve(B, Q).

Procedure Solve(board B, set of pieces Q)

For each piece P in Q, {

For each orientation A {

Place P in the first available

position of B in orientation A, obtaining B’.

If B’ is full and meets all constraints, output B’.

If B’ is full and does not meet all constraints, return.

Call Solve(B’, Q - {P}).

}

}

Return.

Previous slide

Next slide

Back to first slide

View graphic version