书籍介绍
这不是一本让你读完就融会贯通的AI理论书，而是一套可以反复动手改动的代码范例集。它从Dijkstra最短路径算法讲起，逐步推演出带启发函数的A*寻路，把搜索边界、索引优先队列、边放松等概念拆解进可运行的工程实现里。读者最看重的，正是这种“跟着例子敲、边改边学”的实操路径，以及作者在真实工程里必须做的取舍权衡。它适合刚接触游戏AI、想建立直觉而非啃公式的人；但如果你期待深入steering behavior或追求理论深度，可能会觉得基础章节过于浅显。换句话说，它的价值不在高度，而在让你亲手把算法跑起来。
精彩摘录
- "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讲的太浅，实现也过于粗陋，不推荐看
入门级，深度不高
求书
收藏