3 docs tagged with "Grid"

This is a solution to the Maximum Safeness Factor of a Path problem.

Find the number of unique paths from the starting square to the ending square in a grid, walking over every non-obstacle square exactly once.

Implement a walking robot simulation on a grid where the robot moves forward, turns, and follows specific instructions.