Hi , my name is Nikola. I'm hobbyst programer and I realy enjoy series - so much things to lear. I'm interested in makin platformer tile based game and episode 045 on temporal vs geometric search was so inspirig. Search in P is approach that I am interested to implement but I have one question as Casey later dicade to use searh in T in his project so he didn't developed search in P approach to the end. I ilustrate my question in picture as that is easier to understand:

Question illustrated:
https://drive.google.com/open?id=0B98I-429KNtNYWtJVXg5QkVhcWM

By the way episode 050 - Basic Minkowski-based Collision Detection was also great source for learnign, and you may find intresting read by Allan Blomquist in his blog where he explains how Contra (1987) uses "Minkowski"-like approach for collision beatween game objects:

https://tomorrowcorporation.com/p...ernals-contra-collision-detection

Sorry for my bad english and thanks.

You can use Minkowski and shrink the walkable area, then clamp the final position to that, I think..