精彩摘录
- "Dijkstra’s algorithm builds a shortest path tree one edge at a time by first adding the source node to the SPT and then by adding the edge that gives the shortest path from the source to a node not already on the SPT. This process results in an SPT containing the shortest path from every node in the"
- "Dijkstra’s algorithm searches by minimizing the cost of the path so far. It can be improved significantly by taking into account, when putting nodes on the frontier, anestimateof the cost to the target from each node under consideration. This estimate is usually referred to as aheuristic, and the na"
用户评论
介绍AI入门的基本编程方法和设计方法，并且提到了实际工程实践中可以要做到的取舍；此书有作业可以方便去实践和修改。
The best game AI book and code~!
Now I'm pretty sure that every skill should be learned by doing the examples.
在读，内容浅显实际.不过基础章节steering behavior讲的太浅，实现也过于粗陋，不推荐看
入门级，深度不高
收藏