骑士巡游

    最近运用了递归和回溯的思想写了个骑士巡游程序，但不知为什么运行不了。还请各位大虾不吝赐教！

#include<stdio.h>#include<malloc.h>int m,n,m1,n1;int **maze;int **mark;struct moved{int x,y;}move[8];typedef struct sqtype{int x,y;int rv;} *s;sqtype *sq;void Path(int m1,int n1,int k){int i,j,v;sq[k-1].x=m1;sq[k-1].y=n1;maze[m1][n1]=k-1;mark[m1][n1]=1;do{for(v=sq[k-1].rv+1;v<8;v++){i=m1+move[v].x;j=n1+move[v].y;if(i>0&&i<m+1&&j>0&&j<n+1&&maze[i][j]==0&&mark[i][j]==0){sq[k-1].rv=v;k++;Path(i,j,k);}if(v==7&&(maze[i][j]!=0||mark[i][j]!=0)&&k<m*n){maze[m1][n1]=0;mark[m1][n1]=0;Path(sq[k-2].x,sq[k-2].y,k-1);}}}while(k<m*n);if(k==m*n){printf("周游路线为：/n");for(i=1;i<m+1;i++){for(j=1;j<n+1;j++)printf("%4d",maze[i][j]);printf("/n");}}}void main(){int i,j,k;move[0].x=1;move[0].y=2;move[1].x=2;move[1].y=1;move[2].x=2;move[2].y=-1;move[3].x=1;move[3].y=-2;move[4].x=-1;move[4].y=-2;move[5].x=-2;move[5].y=-1;move[6].x=-2;move[6].y=1;move[7].x=-1;move[7].y=2;printf("请输入m和n的值：/n");scanf("%d%d",&m,&n);sq=(s)malloc((m*n+1)*sizeof(sqtype));for(i=1;i<m*n+1;i++)sq[i].rv=-1;maze=(int **)malloc((m+1)*sizeof(int *));for (i=0;i<n+1;i++)maze[i]=(int *)malloc((n+1)*sizeof(int));for (i=0;i<m+1;i++)for(j=0;j<n+1;j++)maze[i][j]=1;for (i=1;i<m+1;i++)for(j=1;j<n+1;j++)maze[i][j]=0;mark=(int **)malloc((m+1)*sizeof(int *));for (i=0;i<n+1;i++)mark[i]=(int *)malloc((n+1)*sizeof(int));for (i=0;i<m+1;i++)for(j=0;j<n+1;j++)mark[i][j]=0;printf("请输入m1和n1的值：/n");scanf("%d%d",&m1,&n1);k=2;Path(m1,n1,k);}