Journal of Applied Mathematics

Journal of Applied Mathematics / 2002 / Article

Open Access

Volume 2 |Article ID 297509 | 11 pages | https://doi.org/10.1155/S1110757X02203022

Faster backtracking algorithms for the generation of symmetry-invariant permutations

Received05 Mar 2002

Abstract

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.

Copyright © 2002 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

62 Views | 422 Downloads | 7 Citations
 PDF  Download Citation  Citation
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.