Faster backtracking algorithms for the generation of symmetry-invariant permutations
Moreno, Oscar ; Ramírez, John ; Bollman, Dorothy ; Orozco, Edusmildo
J. Appl. Math., Tome 2 (2002) no. 8, p. 277-287 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
A new backtracking algorithm is developed for generating classes of permutations, that are invariant under the group $G_4$ 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$ , $19\le n\le 24$ .
Publié le : 2002-05-14
Classification:  94A55,  05C30,  68W10 
@article{1049074894,
     author = {Moreno, Oscar and Ram\'\i rez, John and Bollman, Dorothy and Orozco, Edusmildo},
     title = {Faster backtracking algorithms for the generation of symmetry-invariant
permutations},
     journal = {J. Appl. Math.},
     volume = {2},
     number = {8},
     year = {2002},
     pages = { 277-287},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1049074894}
}

Moreno, Oscar; Ramírez, John; Bollman, Dorothy; Orozco, Edusmildo. Faster backtracking algorithms for the generation of symmetry-invariant
permutations. J. Appl. Math., Tome 2 (2002) no. 8, pp.  277-287. http://gdmltest.u-ga.fr/item/1049074894/