![]() (4) There are three algorithms to generate maze, but BFS and Prim have high similarity, so DFS and BFS are selected to design. (3) There are many branches in the maze, and any two points can be reached. (2) Labyrinth does not contain circuits, indicating that all paths are connected. ![]() ![]() For the convenience of calculation, the walls and paths in maze can be represented by - 1 and 0. (1) Maze is represented by two-dimensional array. ![]() Requirements: simulate a rectangular maze with two-dimensional array, generate a maze without loop by using random depth first, random breadth first or random prim algorithm, and find the correct path of any two points in the maze. Problem Description: labyrinth is full of complex channels, it is difficult to find the road from the entrance or a certain position in the labyrinth to the exit, the road is complex and difficult to distinguish, it is not easy for people to get out of things. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |