-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmain.cpp
More file actions
133 lines (122 loc) · 2.51 KB
/
Copy pathmain.cpp
File metadata and controls
133 lines (122 loc) · 2.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
/*
* 8皇后问题
*/
//#include<iostream>
//#include<math.h>
//
//using namespace std;
//
//int n = 8;
//int total = 0;
//int *c = new int(n);
//
//bool is_ok(int row)
//{
// int j;
// for (j = 0; j != row; j++)
// {
// if (c[row] == c[j] || row - c[row] == j - c[j] || row + c[row] == j + c[j])
// {
// return false;
// }
// }
// return true;
//}
//
//void queen(int row)
//{
// int col;
// if (row == n)
// {
// total++;
// }
// else
// {
// for (col = 0; col != n; col++)
// {
// c[row] = col;
// if (is_ok(row))
// queen(row + 1);
// }
// }
//}
//
//int main()
//{
// queen(0);
// cout << total;
// return 0;
//}
/*
* 马遍历棋盘
*/
#include<iostream>
using namespace std;
//坐标固定的马有八种走的方式
//用数组进行存储，方便在for中使用
int fx[8] = { 1, 2, 2, 1, -1, -2, -2, -1 };
int fy[8] = { 2, 1, -1, -2, -2, -1, 1, 2 };
static int mCount;
const static int n = 5, m = 4;
int a[n][m]; //用int二维数组来表示走的路
void mFind(int x, int y, int dep);//寻找路径的递归
int mCheck(int x, int y);//判断是否出界，是否已经走过
void output();//打印
int main()
{
int x = 0, y = 0, i, j;//选择(0,0)为初始点
mCount = 0;
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
a[i][j] = 0;
}
}
a[x][y] = 1;
mFind(x, y, 2);
if (mCount == 0)
cout << "Non solution" << endl;
else
cout << endl << "final count = " << mCount << endl;
}
void mFind(int x, int y, int dep)
{
int xx, yy, i;
for (i = 0; i < 8; i++)
{
xx = x + fx[i];
yy = y + fy[i];
if (mCheck(xx, yy) == 1)
{
a[xx][yy] = dep;
if (dep == n * m)
output(); //如果深度为n*m，那么表示遍历结束，就打印
else
mFind(xx, yy, dep + 1);
a[xx][yy] = 0; //回溯，恢复未走坐标。（如果走错，要将走错的路径还原）
}
}
}
int mCheck(int x, int y)
{
//判断坐标是否出界，是否已经走过
if (x < 0 || y < 0 || x >= n || y >= m || a[x][y] != 0)
return 0;
return 1;
}
void output()
{
int i, j;
mCount++;
cout << endl;
cout << "count= " << mCount;
for (i = 0; i < n; i++)
{
cout << endl;
for (j = 0; j < m; j++)
{
cout << a[i][j] << " ";
}
}
}