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

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.

主站蜘蛛池模板: 郁南县| 巴南区| 故城县| 封丘县| 宜川县| 黄浦区| 南川市| 河北省| 定边县| 商丘市| 睢宁县| 璧山县| 灌阳县| 三穗县| 嘉定区| 筠连县| 金门县| 锦屏县| 塔河县| 镇康县| 田林县| 溆浦县| 无棣县| 庆阳市| 昭苏县| 新兴县| 和平县| 阿城市| 衡山县| 固原市| 二手房| 克什克腾旗| 通辽市| 黑山县| 迁安市| 乌拉特中旗| 响水县| 清新县| 金乡县| 莱西市| 平昌县|