Rat chases cheese

#1

Not able to solve this problem,please provide some hint!

#2

Basically, in this question, you are given a grid, a rat which is present at one corner of grid, and it has to reach to the other end of grid by some unique path, and you are also given that rat can move left, right, up or down on the grid., so you can create one boolean function, which will take the input grid, and one solution grid initialized to 0 as a parameter,
and you can take 4 boolean variabes, as rightSuccess, downSuccess, leftSuccess and topSuccess which will determine if it is possible for rat to follow any of the following path to reach to its destination.

You can refer to Rat in a Maze recursion problem in your online video lectures for further explanation

#3

code for Rat cheese problem https://ide.codingblocks.com/s/77881

#4

Plz add comments to your code, so that I could understand it

#5

Added all necessary comments,please help now!!! https://ide.codingblocks.com/s/78722

#6

you can refer to this solution for your help and understanding