faster backtracking algorithms for the generation of symmetry-invariant permutations更快的回溯算法的生成symmetry-invariant排列.pdfVIP

FASTER BACKTRACKING ALGORITHMS FOR THE GENERATION OF SYMMETRY-INVARIANT PERMUTATIONS OSCAR MORENO, JOHN RAMÍREZ, DOROTHY BOLLMAN, AND EDUSMILDO OROZCO Received 5 March 2002 A new backtracking algorithm is developed for generating classes of per- mutations, that are invariant under the group G4 of rigid motions of the square generated by reflections about the horizontal and vertical axes. Special cases give a new algorithm for generating solutions of the classi- cal n-queens problem, as well as a new algorithm for generating Costas sequences, which are used in encoding radar and so