Permutation Generator
The Permutation generator (PERM) calculates permutation quantities for Digits for 1 to 999 and Group Sizes from 1-99. Permutation values are also generated up to a maximum of 10 MB of text.
Screenshot
Although permutation quantities increase exponentially as a function of Inputs ^ Width, constraints such as Sorting and Uniqueness can be used to significantly reduce the number of permutations.
Output Options
1. Sort - Numbers are sorted in ascending order. This eliminates combinations with the same numbers arranged in a different order. (1 2 3, 1 3 2, 2 1 3, 2 3 1, 3 1 2, 3 2 1) reduces to (1 2 3).
2. Reverse Sort - Numbers are sorted in descending order.
3. Unique - Eliminates combinations with duplicate numbers. (1 1, 1 2, 2 1, 2 2) reduces to (1 2, 2 1).
4. Start at 0 - Permutation values start at 0 instead of 1. For example, this can be used to generate binary, octal or decimal number tables. Not applicable to Mapped Names.
5. Map Names - Replaces numbers (1 2 3 ...) with names (a b c A B C cat DOG Jane George ...) listed in a file. The file must be named MapFile.txt and located in the SSolver8\bin directory. An example MapFile.txt with animal names is provided with SSolver.
6. Align - Left-justifies Mapped Names in each column, with a minimum of one space between each column.
7. Space - Adds a space before each item in each row. Not applicable to Aligned names.
8. Show Results - Enables display of permutation numbers/names. If this option is checked, a maximum of 10 MB of permutation text will be displayed.