This repository contains a code that shows the different paths a robot agent in a given environment can travel. The environment can be visualised as an office floor with different rooms for employees. The robot agent has a starting location, and it delivers mail from the starting point to its destination point.
Given a matrix, which is the environment that the agent has to travel.
The agent can traverse through all directions, but a '0' means restricted area. The code uses backtracking through recursion to come up with all possible paths that the agent can traverse.