$begingroup$

I am very familiar with A* and is able to make it work well. However I am looking for resources describing how to do find a path with a player size of 2×2 instead of the usual 1×1 on a 2d map. So for example, if there is a choke point where only 1×1 can fit through, the 2×2 player must find another path around.

I have googled but with no results. I am not sure what this problem is called.

Thanks in advance.

foRei is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

0