国际象棋

Background 
The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey 
around the world. Whenever a knight moves, it is two squares in one direction and one square perpendicular to this. The world of a knight is the chessboard he is living on. Our knight lives on a chessboard that has a smaller area than a regular 8 * 8 board, but it is still rectangular. Can you help this adventurous knight to make travel plans? 

Problem 
Find a path such that the knight visits every square once. The knight can start and end on any square of the board.

Input

The input begins with a positive integer n in the first line. The following lines contain n test cases. Each test case consists of a single line with two positive integers p and q, such that 1 <= p * q <= 26. This represents a p * q chessboard, where p describes how many different square numbers 1, . . . , p exist, q describes how many different square letters exist. These are the first q letters of the Latin alphabet: A, . . .

Output

The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing the lexicographically first path that visits all squares of the chessboard with knight moves followed by an empty line. The path should be given on a single line by concatenating the names of the visited squares. Each square name consists of a capital letter followed by a number. 
If no such path exist, you should output impossible on a single line.

Sample Input

3
1 1
2 3
4 3

Sample Output

Scenario #1:
A1

Scenario #2:
impossible

Scenario #3:
A1B3C1A2B4C2A3B1C3A4B2C4

 

 

深搜算法

#include <stdio.h>
#include <string.h>
const int maxn = 26;
bool map[maxn][maxn],flag;
int R[maxn],C[maxn];
int p,q,sum;
int next[8][2] = {{-1,-2},{1,-2},{-2,-1},{2,-1},{-2,1},{2,1},{-1,2},{1,2}};//走法
void DFS(int x,int y)
{
    int tx,ty,i;
    if (flag)
        return ;
    map[x][y] = true;
    sum++;
    R[sum] = x;
    C[sum] = y;
    if (sum == p*q)
	{
        flag = true;
        return ;
    }
    for (i = 0;i < 8;i++)
	{
        tx = x + next[i][0];
        ty = y + next[i][1];
        if (1 <= tx && tx <= p && 1 <= ty && ty <= q && !map[tx][ty])
		{
            DFS(tx,ty);
            sum--;
        }
    }
    map[x][y] = false;
}

int main()
{
    int i,k,T;
    scanf("%d",&T);
    for (k = 1;k <= T;k++)
	{
        memset(map,false,sizeof(map));
        flag = false;
        scanf("%d%d",&p,&q);
        sum = 0;
        DFS(1,1);
        printf("Scenario #%d:\n",k);
        if (flag)
            for (i = 1;i <= p*q;i++)
                printf("%c%d",C[i]-1+'A',R[i]);
        else
            printf("impossible");
        printf("%s\n",k==T?"":"\n");
    }
    return 0;
}