POJ2488/openjudge 1490 A Knight's Journey 解题报告(dfs)

A Knight’s Journey
总时间限制: 1000ms 内存限制: 65536kB
描述
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.
找到一条路径使得骑士可以走完所有的格子，但每个格子只能走一次
输入
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, …
给你两个数p,q代表行与列（或列与行，可自己决定）。p*q代表格子数，这里的q（列的坐标）用A,B,C…..代替1,2,3……，p（行的坐标）还是用1,2,3,4….表示
输出
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.
输出就是把路径输出，并且每组数据之间有一个空行

样例输入
3
1 1
2 3
4 3
样例输出
Scenario #1:
A1

Scenario #2:
impossible

Scenario #3:
A1B3C1A2B4C2A3B1C3A4B2C4

底部还有91组测试数据。

题目分析：

简单的dfs寻找最优路径问题，但这里的最优路径有两个条件。①必须可以走完所有格子且不重复 ②需率先走字典序小的那个路径。

这里问题①很好解决。主要问题是②如何解决。

我们将图上的点抽象一下。
这里有一个很巧妙的方法：

这里将@看做是骑士，0看做是能走的位置。

		1	2		3	4
	#	#	#	#	#	#	#
A	#	#	0	#	0	#	#
B	#	0	#	#	#	0	#
	#	#	#	@	#	#	#
C	#	0	#	#	#	0	#
D	#	#	0