搜索一： 深度搜索

以poj2488为例

http://poj.org/problem?id=2488

#include <iostream>
using namespace std;
int p,q;
bool visit[100][100], flag;
int jump[8][2] = {{-1,-2},{+1,-2},{-2,-1},{+2,-1},{-2,+1},{+2,+1},{-1,+2},{+1,+2}}; 
int travel[100][2];
void dfs(int row, int column, int pace)
{
travel[pace][0] = row, travel[pace][1] = column;
if (pace == p*q) {
flag = true;
return;
}
for (int i = 0; i < 8; i++) {
if (!flag && row+jump[i][0] >= 0 && row+jump[i][0] <p && column+jump[i][1] >= 0 && column+jump[i][1] < q && !visit[row+jump[i][0]][column+jump[i][1]]) {
visit[row+jump[i][0]][column+jump[i][1]] = true;
dfs(row+jump[i][0], column+jump[i][1], pace+1);
visit[row+jump[i][0]][column+jump[i][1]] = false;
}
}
}
int main()
{
int test;
cin >> test;
for (int s = 1; s <= test; s++) {
memset(visit, false, sizeof(visit));
memset(travel, 0, sizeof(travel));
cin >> p >> q;
cout << "Scenario #" << s << ":" << endl;
flag = false;
visit[0][0] = true;
dfs(0, 0, 1);
if (flag) {
for (int j = 1; j <= p*q; j++) {
printf("%c", travel[j][1]+'A');
printf("%d", travel[j][0]+1);
}
}
else
cout << "impossible";
cout << endl << endl;
}
return 0;
}