官术网_书友最值得收藏!

IDA* Pathfinding

IDA* star stands for iterative deepening A*. It is a depth-first permutation of A* with a lower overall memory cost, but is generally considered costlier in terms of time. Whereas A* keeps multiple nodes in memory at a time, IDA* does not since it is a depth-first search. For this reason, IDA* may visit the same node multiple times, leading to a higher time cost. Either solution will give you the shortest path between two nodes.

In instances where the graph is too big for A* in terms of memory, IDA* is preferable, but it is generally accepted that A* is good enough for most use cases in games. That said, we'll explore both solutions in Chapter 4, Finding Your Way, so you can arrive at your own conclusion and pick the right pathfinding algorithm for your game.

主站蜘蛛池模板: 祁阳县| 西平县| 睢宁县| 鄢陵县| 台前县| 鄢陵县| 固镇县| 临西县| 株洲县| 青龙| 河源市| 浮梁县| 土默特右旗| 黄山市| 西林县| 凤阳县| 宁阳县| 元朗区| 东阳市| 永顺县| 深圳市| 临沂市| 平潭县| 平南县| 安仁县| 遂川县| 宁阳县| 绥阳县| 瑞金市| 奈曼旗| 遵化市| 比如县| 麻栗坡县| 青神县| 兖州市| 湘乡市| 阿拉善左旗| 朔州市| 越西县| 康保县| 丹江口市|