Faster backtracking algorithms for the generation of symmetry-invariant permutations
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-queen...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2002-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/S1110757X02203022 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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, 19≤n≤24. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |