Rat in a Maze | Backtracking | ReactJs

A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach the destination. The rat can move only in two directions: forward and down.

In the maze matrix, 0 means the block is a dead end and 1 means the block can be used in the path from source to destination. Note that this is a simple version of the typical Maze problem. For example, a more complex version can be that the rat can move in 4 directions and a more complex version can be with a limited number of moves.

[meenumeena]

But we would not be going into the code and edit it for red blocks. there must be a feature to change position of red blocks on the website itself.

[baibhavkc]

can you properly explain how the algorithm works as im learning react and i want to know about how its working. Also instead of editing that code for red blocks there should be something like when we click on a red box it should go away and path should be generated accordingly...

[mayankmishra]

hey package is not getting installed in my latest version please npm is not supporting node.js17.0.1 version please make a vide with current version it will help alot

[vanshjindal]

bhiya iske pure video tutorial bna doge kya plz?

[mayankmishra]

hey please help me regarding your code