Figuring out the correct algorithm of how to cover the entire room. The robot is not able to clean the room, but it avoids moving outside of the walls.
Implementing the depth-first search (dfs) algorithm. The robot is able to clean the entire room, but it makes to many parasitic moves in order to exit the recursions.
Implementing the iterative dfs. The robot cleans the room and, since we use the loop instead of the recursion, it avoids making this parasitic moves.
Testing the final algorithm in a real landscape. Perfect!!!
