Polygonal chain - 2

Pretty simple problem with high complexity.

I'll explain how I solved it. Answer is symmetrical regarding x, y, diagonal -> calculate result only for that part. I have recursive function that do one step, with this function I calculate how many ways it reaches particular point with minimum number of steps.