The aim of object pile deconstruction is to safely remove elements one by one without compromising stability. The number of combinations of removal sequences increases dramatically with the number of objects and thus testing every combination is intractable in practical scenarios. We model the deconstruction sequencing problem using a disassembly graph, and investigate and discuss search strategies for discovery of stable sequences in an architectural context. We run and compare techniques in a large-scale experiment, on various virtual scenes of architectural models composed of different shapes, sizes and number of elements.