博客探讨了如何解决POJ2488问题，即在一个小于8x8的矩形棋盘上，让骑士按马走日的方式访问每个格子一次。通过深度优先搜索算法，按照字典序确定马的移动方向，并给出不同大小棋盘的解决方案。对于无法遍历完整棋盘的情况，输出'不可能'。内容中提及代码主要来源于他人的贡献，并意图进行总结归纳。
A Knight’s Journey
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 40636 Accepted: 13807
Description
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 move
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
