Find minimum steps taken by knight to reach given destination in NxN chess board with obstacles

Question

N is entered by user, start and finish marked with "@" and obstacles are marked "#" Input Example https://i.stack.imgur.com/uLVv4.png Output Example http