- Unity 5.x Game AI Programming Cookbook
- Jorge Palacios
- 93字
- 2021-07-09 19:37:50
Introduction
In this chapter, we will learn path-finding algorithms for navigating complex scenarios. Game worlds are usually complex structures; whether a maze, an open world, or everything in between. That's why we need different techniques for approaching these kinds of problems.
We'll learn some ways of representing the world using different kinds of graph structures, and several algorithms for finding a path, each aimed at different situations.
It is worth mentioning that path-finding algorithms rely on techniques such as Seek
and Arrive
, learnt in the previous chapter, in order to navigate the map.
推薦閱讀
- ETL數(shù)據(jù)整合與處理(Kettle)
- 使用GitOps實現(xiàn)Kubernetes的持續(xù)部署:模式、流程及工具
- 商業(yè)分析思維與實踐:用數(shù)據(jù)分析解決商業(yè)問題
- 數(shù)據(jù)化網(wǎng)站運(yùn)營深度剖析
- 數(shù)據(jù)庫應(yīng)用基礎(chǔ)教程(Visual FoxPro 9.0)
- WS-BPEL 2.0 Beginner's Guide
- Python金融實戰(zhàn)
- Visual Studio 2013 and .NET 4.5 Expert Cookbook
- Python數(shù)據(jù)分析從小白到專家
- Oracle 11g+ASP.NET數(shù)據(jù)庫系統(tǒng)開發(fā)案例教程
- Access 2010數(shù)據(jù)庫程序設(shè)計實踐教程
- 數(shù)據(jù)指標(biāo)體系:構(gòu)建方法與應(yīng)用實踐
- 區(qū)塊鏈應(yīng)用開發(fā)指南:業(yè)務(wù)場景剖析與實戰(zhàn)
- 推薦系統(tǒng)全鏈路設(shè)計:原理解讀與業(yè)務(wù)實踐
- 算力芯片:高性能CPU/GPU/NPU微架構(gòu)分析