I’m solving a variation of the Knight’s Tour Problem [1] with a little home coding project. I know the best way to solve this problem is a recursive function call. I also know the problem I’m trying to solve has three times the number of possibles at each stop. It’s a damn hairy recursive function.…