Create a .csv list of permutations with restriction rules
Budget: €30 – €250 EUR
Requires coding in a language dedicated to string handling (Perl, Python or Ruby).
The goal is to create a .csv list of possible variations with an alphabet of 11 characters placed within Words whose length goes from 2 to 8 characters starting with 2, then 3 up to 8).
There are filtering rules for what must be rejected from the list:
1. Words only made from the same character (AAAA)
2. Rotations (ABC = BCA), only the first occurrence is retained (ABC)
3. Sequences that contain a finite repetition of a sub-multiple sequence (AB within ABABAB)
4. The combination of rules 2 and 3 (AB within BABA)
To allow importing in Excel in a reasonable size, the list should be made into several consecutive .csv files.
The goal is to create a .csv list of possible variations with an alphabet of 11 characters placed within Words whose length goes from 2 to 8 characters starting with 2, then 3 up to 8).
There are filtering rules for what must be rejected from the list:
1. Words only made from the same character (AAAA)
2. Rotations (ABC = BCA), only the first occurrence is retained (ABC)
3. Sequences that contain a finite repetition of a sub-multiple sequence (AB within ABABAB)
4. The combination of rules 2 and 3 (AB within BABA)
To allow importing in Excel in a reasonable size, the list should be made into several consecutive .csv files.