安徽工业大学汤亚玲数据结构课程设计详解.docx

数据结构课程设计班级：计141学号：149074007姓名：李根一：骑士周游#include stdio.h#include stdlib.h#include memory.hconst int N = 8;int step[N * N] = {-1};int chess[N][N] = {0};int Jump[8][2] = {{-2, -1}, {-1, -2}, {1, -2}, {2, -1}, {2, 1}, {1, 2}, {-1, 2}, {-2, 1}};int p = 0;int canJump(int x, int y){ if (x = 0 x N y = 0 y N chess[x][y] == 0) return 1; return 0;}int weightStep(int x, int y){ int count = 0; for (int i = 0; i 8; ++i) { if (canJump(x + Jump[i][0], y + Jump[i][1])) count++; } return count;}void inssort(int a[], int b[], int n){ if (n = 0) return; for (int i = 0; i n; ++i) { for (int j = i; j 0; --j) { if (a[j] a[j - 1]) { int temp = a[j - 1]; a[j - 1] = a[j]; a[j] = temp; temp = b[j - 1]; b[j - 1] = b[j]; b[j] = temp; } } }}void BackTrace(int t, int x, int y){ if (t = N * N) { p++; for (int i = 1; i = N * N - 1; ++i) { printf(%d , step[i]); } printf( ); for (int i = 0; i N; ++i) { for (int j = 0; j N; ++j) printf(%2d , chess[i][j]); printf( ); } printf( ); exit(1); //return; } else { int count[8], possibleSteps[8]; int k = 0; for (int i = 0; i 8; ++i) { if (canJump(x + Jump[i][0], y + Jump[i][1])) { count[k] = weightStep(x + Jump[i][0], y + Jump[i][1]); possibleSteps[k++] = i; } } inssort(count, possibleSteps, k); for (int i = 0; i k; ++i) { int d = possibleSteps[i]; x += Jump[d][0]; y += Jump[d][1]; chess[x][y] = t + 1; step[t] = d; BackTrace(t + 1, x, y); chess[x][y] = 0; x -= Jump[d][0]; y -= Jump[d][1]; }