HDU1372&POJ2243Knight Moves(BFS呀,转换一下)

最新推荐文章于 2018-08-24 17:49:23 发布

AC_Dreameng

最新推荐文章于 2018-08-24 17:49:23 发布

阅读量957

点赞数

分类专栏： HDU POJ ACM_基础题(水题) ACM_搜索 ACM_HDU刷题录文章标签： HDU1372 poj2243 Knight Moves

本文链接：https://blog.csdn.net/hurmishine/article/details/50939567

版权

这篇博客介绍了如何解决HDU1372和POJ2243这两道关于骑士在特殊棋盘上移动的问题。文章指出，尽管题目有所不同，但基本思路是将棋盘进行转换，然后应用广度优先搜索(BFS)算法来求解。作者提供了AC代码作为解决方案。

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

Knight Moves

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13145		Accepted: 7369

Description

A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight move