So it turns out the reference solution is solvable in about 37 moves. This solver is strictly exponential time. After 26 moves, the time to check all possibilities becomes untennable. Reaching route length 37 is likely outside the reach of this solver.
Created a derived file that only has the exponential IDDFS algorithm.