Open Access
10 November 2002 Faster backtracking algorithms for the generation of symmetry-invariant permutations
Oscar Moreno, John Ramírez, Dorothy Bollman, Edusmildo Orozco
J. Appl. Math. 2(6): 277-287 (10 November 2002). DOI: 10.1155/S1110757X02203022


A new backtracking algorithm is developed for generating classes of permutations, 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 classical n-queens problem, as well as a new algorithm for generating Costas sequences, which are used in encoding radar and sonar signals. Parallel implementations of this latter algorithm have yielded new Costas sequences for length n, 19n24.


Download Citation

Oscar Moreno. John Ramírez. Dorothy Bollman. Edusmildo Orozco. "Faster backtracking algorithms for the generation of symmetry-invariant permutations." J. Appl. Math. 2 (6) 277 - 287, 10 November 2002.


Published: 10 November 2002
First available in Project Euclid: 30 March 2003

zbMATH: 1013.94011
MathSciNet: MR1950806
Digital Object Identifier: 10.1155/S1110757X02203022

Primary: 05C30 , 94A55
Secondary: 68W10

Rights: Copyright © 2002 Hindawi

Vol.2 • No. 6 • 10 November 2002
Back to Top