We have a chess board and there is a immovable piece which cannot move in any direction, and we have a bishop which can only move diagonally. Find if we can reach the immovable piece using bishop and in how many minimum steps.

I had this in an interview and I can't figure out or find the solution for this problem online.