Shulou(Shulou.com)06/01 Report--

This article mainly introduces "how to solve the maze problem with C language". In the daily operation, I believe that many people have doubts about how to solve the labyrinth problem with C language. The editor consulted all kinds of materials and sorted out simple and easy-to-use operation methods. I hope it will be helpful for you to answer the doubt of "how to solve the maze problem with C language"! Next, please follow the editor to study!

The realization method of solving Maze problem in C language data structure

First of all, the maze problem is usually solved by "exhaustive solution", that is, starting from the entrance and testing in a certain direction, if you can get through, then continue to go forward, otherwise you will return the original way and continue to explore in another direction until you go out.

We can first build an 8-8 maze, in which the outermost one is the wall.

Int mg [Mirror2] = {1pyrrt1] [Nih2] = {1pyrrt1] [Nih2] = {{1pyrronome0pyrrhen1] = {1pyrrhen0 beetle 1}, {1pyrr0 beetle 0mine0pyrrine 0pyrrine 1}, {1pyrr0 pyrrine 0pyrrine 0pyrrine 1}, {1pr 0pr 0pr 1pr 0pr 1}, {1pr 0pr 0pr 0jue 0pm 1}, {1meme 0meme 0meme 0remie 1}, {1rec 0meme 0je 0rem 1}, {1rec 0meme 0pr 0j1}, {1meme 0pr 0je 0pr 0Q 0je 0pr 0pr 0}, {1pr 0pr 0pr 0pr 0je 0je 0pr 0je 0je 0je 0pr 0pr 0pr 0}, {1pr 0pr 0pr 0pr 0 jpr 0pr 0je 0jpr 0pl}. 1,1,1,1,1,1,1,1},}

As shown above, 0 corresponds to the channel square and 1 represents the wall. For each square in the labyrinth, there are four squares up and down, left and right. We specify the position of the squares in row I and column j as (iPowerj). The azimuth of the upper squares is 0, and the number is incremented clockwise. At the top of the table is (irelle 1), below (iminute 1), on the left (imemjmur1), and on the right (imemjure 1). For aspect backtracking, we need to have stack-in and out-stack operations, so let's define:

Struct {int iSplink / current azimuth line int jignor / when the next walkable location under int di;// is listed in front} St [MaxSize]; / Stack int top=-1;// initializes the top pointer of the stack

Let's take a look at the writing process.

First of all, enter the entrance into the stack (the initial azimuth is-1), loop when the stack is not empty: take the box at the top of the stack (do not return the stack), and if the square is an exit, withdraw the stack. If such a square exists, its orientation is saved in the element at the top of the stack, and the walkable adjacent square is stacked.

Corresponding algorithm:

Void mgpath (int x1reint y1noteint x2reint y2) {int I. J = x1; top++; [top] .j = y1; mg [x1] [y1] =-1; while (top >-1) {I = Sttop] .I; j = Sttop .j; di= [top] .di; if (i==x2 & j==y2) {printf ("maze path is as follows:\ n"); for

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.