That's a very cool implementation, it's almost twice as fast as what I did. Thanks for sharing it. I just had a question regarding the "warp" argument: I don't quite understand it. Is it there to let the optimal path "skip" some steps ? How did you think of implementing this behavior ? Thanks !
That's a very cool implementation, it's almost twice as fast as what I did. Thanks for sharing it. I just had a question regarding the "warp" argument: I don't quite understand it. Is it there to let the optimal path "skip" some steps ? How did you think of implementing this behavior ? Thanks !
Regards,
Toussaint