Backtrack searching in the presence of symmetry

Authors:
Cynthia A. Brown;Larry Finkelstein;Paul Walton Purdom, Jr.
Affiliations:
Mesch Capital Management, 2314 NE Schuyler, Portland, OR;College of Computer Science, Northeastern University, 360 Huntington Ave., Boston, Mass.;Computer Science Dept., Indiana University, 101 Lindley Hall, Bloomington, In.
Venue:
Nordic Journal of Computing
Year:
1996

Citing 11
Cited 2

A General backtrack algorithm for the isomorphism problem of combinatorial objects

Journal of Symbolic Computation
A compact representation for permutation groups

Journal of Algorithms
Private coins versus public coins in interactive proof systems

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Noncomutative bilinear algorithms for 3x3 matrix multiplication

SIAM Journal on Computing
A new base change algorithm for permutation groups

SIAM Journal on Computing
Fast group membership using a strong generating test for permutation groups

Proceedings of the third conference on Computers and mathematics
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Backtrack programming techniques

Communications of the ACM
A machine program for theorem-proving

Communications of the ACM
Backtrack Searching in the Presence of Symmetry

AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Computation with permutation groups

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation

Partial Symmetry Breaking

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Classifying discrete objects with orbiter

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of search algorithms for problems with symmetries is discussed. The algorithms take as input a symmetry group (in the form of a permutation group) and use it to avoid repeated search of equivalent portions of the search space. The symmetry checking algorithms are variations on a color automorphism algorithm and make use of recent advances in computational group theory to achieve efficient performance. In particular, this paper gives the first algorithm that combines search rearrangement with an arbitrary symmetry group. Experimental results confirm that the algorithms save a considerable amount of time on symmetric search problems.