![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
宽度优先搜索
文章平均质量分 86
ryan0wang
while (!success()) try();
展开
-
【POJ2251】Dungeon Master 三维 BFS Hash(12/1000)
DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit no原创 2017-12-08 12:17:25 · 243 阅读 · 0 评论 -
【UVA439】 Knight Moves BFS (3/1000)
DescriptionA 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原创 2017-11-26 14:49:32 · 232 阅读 · 0 评论 -
[kuangbin带你飞]专题一 简单搜索 (17/1000)
终于,做完了kuangbin大神带你飞的专题一之简单搜索,实在有一股无法言喻的感觉,每道题类型都差不多但细节实现却有点细微区别,所以14道题我就只当作5题了。。棋盘问题稍微变了点形的皇后问题,不能一行一行搜索,要一个一个格子搜索include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using name原创 2017-12-13 20:34:54 · 667 阅读 · 0 评论