Runtime of this algorithm is extremely poor, O(n!). At scale this would not be practical. Could likely fix this using dynamic programming. However, is a very easy way to find all possible starting combinations of chess960, as n=8. Use hashing to avoid duplicates. Recursion is utilized to get all possible combinations. Use flags to make sure bishops are on different colors spaces. Using index checking to make sure king is inbetween two bishops.