I doubt the code is all that complex. My guess is once they work out every position there really doesn't need to be any heuristics, all they need is a shortest path algorithm from the current position to mate.