
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.
permutations, Costas sequences, Shift register sequences and sequences over finite alphabets in information and communication theory, backtracking algorithm, parallel algorithms, 68W10, \(n\)-queens problem, Enumeration in graph theory, 94A55, QA1-939, 05C30, Parallel algorithms in computer science, Mathematics
permutations, Costas sequences, Shift register sequences and sequences over finite alphabets in information and communication theory, backtracking algorithm, parallel algorithms, 68W10, \(n\)-queens problem, Enumeration in graph theory, 94A55, QA1-939, 05C30, Parallel algorithms in computer science, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
