I want to use john (I hope it's possible) to create all possible combinations of the set A,B,C,D..,Z with fixed 8 length, and distinct letters!
Meaning:
ABCFGRTH
QPFLDMRB
etc...
I've tried it with some backtracking algorithms, but they didn't gave me the right results.
Do you guys have any ideas ?