So basically I have a map that holds a key and a string with all the valid moves.
A - "IJ"
B - "KMI"
C - "FJLN"
D - "GMO"
What I need to do is find all the sequences of 10 that are possible. I was thinking of looping through each key since that would account for the first letters of each sequence but when I try to throw in some recursion, things get hairy.