Skip to content

Latest commit

 

History

History
2 lines (2 loc) · 232 Bytes

File metadata and controls

2 lines (2 loc) · 232 Bytes

Search_algorithm_project

Given a number of cars in a grid (maze) with nxm blocks and their orientation, use the BFS algorithm to empty all the blocks of the maze.In this maze there are also obstacles that block the way of a car.