That seems to be a very minor complication. You just need to recalculate the shortest path to mate every move your opponent makes, and then play the new shortest path. If your opponent plays perfectly as well, the shortest path should not change. If not, mate should be even simpler. Essentially the idea is still the same. There aren't any heuristic algorithms involved. Unless I'm missing something, here.