程序设计与算法（二）A Knight's Journey（DFS）

最新推荐文章于 2022-10-04 10:51:10 发布

starleeisamyth

最新推荐文章于 2022-10-04 10:51:10 发布

阅读量336

点赞数

分类专栏：程序设计与算法（二）算法基础（完结）

本文链接：https://blog.csdn.net/qq_41731507/article/details/105209496

版权

程序设计与算法（二）算法基础（完结）专栏收录该内容

22 篇文章 19 订阅 ¥9.90 ¥99.00

订阅专栏

超级会员免费看

该博客探讨了如何帮助骑士在不重复地访问所有格子的情况下进行旅行。问题描述了一个小于8x8的矩形棋盘，要求找到字典序最小的路径。输入包含棋盘的尺寸，输出是按照特定格式的可行路径或'不可能'。解决方案是从左上角开始，使用深度优先搜索（DFS）策略进行遍历。

摘要由CSDN通过智能技术生成

描述

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 boar