递归法和回溯法（Recursive method and backtracking method）.docVIP

递归法和回溯法（Recursive method and backtracking method） VC6 does not have this function, and the 219 character of the maze can not be displayed in the 32 bit console program of the operating system that uses Chinese page number. If you want to achieve the gotoxy () function in VC6, you have to use API, for a simple program is not necessary, so it is written with TC2, suddenly changed to C language, there is still not suited. #include stdio.h Typedef, struct, hero, {int, x, y, face,}, HERO; Void, set_hero (HERO*, h, int, x, int, int, face) {h-x=x; h-y=y; Y; h-face=face;} Void go (HERO*, H) {if (h-face%2) h-x+=2-h-face; else h-y+=h-face-1;} Void goleft (HERO*, H) {if (h-face%2) h-y+=h-face-2; else h-x+=h-face-1;} Void turnleft (HERO*, H) {h-face= (h-face+3)%4;} Void turnright (HERO*, H) {h-face= (h-face+1)%4;} Void print_hero (HERO*, h, int, b) { Gotoxy (h-x + 1, h-y + 1); If (b) { Switch (h-face) { Case, 0:, printf (%c, 24); break; Case, 1:, printf (%c, 16); break; Case, 2:, printf (%c, 25); break; Case, 3:, printf (%c, 27); break; Default: break; } } Else printf (); } Int maze[10][10] = { 0, 0, 0, 1, 0, 0,, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1,, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0,, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1,, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1,, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1,, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1,, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0,, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0,, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0,, 0, 0, 0, 0 }; Void, print_maze () { Int, I, j; For (I = 0; I 10; i++) { For (J = 0; J 10; j++) { If (maze[i][j]) printf (%c, 219); Else printf (); } Printf (\n); } } Int gomaze (HERO* h) { HERO t = *h; int i; For (I = 0; I 2; t = *h) { Print_hero (h, 1); sleep (1); go (t); If (t.x t.x = 0 10 0 T.Y T.Y = 10 maze[t.y][t.x]!) { Print_hero (h, 0); go (H); / * * / go ahead can walk If (h-x = 9 and h-y = = 9) return 1; goleft (a t). if (h - x = = 0 h - y = = 0) + +. if (t.x = 0 t.y t.x 10 = 0 10 t.y. t.y. [] []) turnleft t.x (h); / * * / 左方无墙向左转 } (h) will turnright 前方不可走