In the maze problem, the first problem we need to solve is the assignment given to us by the teacher, which is whether we can find an uninterrupted passage from the beginning to the end of the maze. Then our basic idea is to define an array maze[1000][1000] that will not be able to go where the wall is marked 0 and can go where it is marked as 1. Then we set a go order, first go to the right, if not to walk on the right, not left, finally down, if to a grid, the grid in four directions was dead, that is the way of failure.

Maze\Maze (executable).c
Maze
Maze\Maze (executable).exe
Maze\Maze (Sublime).c

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．