| | |
Summary: Lightweight Dynamic Symmetry Breaking
C. Mears, M. Garcia de la Banda, B. Demoen, M. Wallace
Abstract
LDSB is a dynamic symmetry breaking method
and, therefore, it does not interfere with the
given search heuristic. Like the shortcut SBDS
method, it might trade completeness for effi-
ciency, and does not require complex group
theory computations. Like the GAP-SBDS
method, it only requires the user to provide the
symmetries, and pruning of symmetric parts of
the search tree occurs as early as it is useful.
Importantly, the overhead introduced by LDSB
to exploit symmetries is very small, since it tar-
gets those that can be represented and checked
efficiently. An implementation of LDSB is de-
scribed. Results are so promising that we be-
lieve LDSB can be used as a default search
method even when looking only for the first so-
lution.
|
