- W 更新時間：2021-07-09 19:38:06
- U
- T
- S
- R
- P
- O
- N
- M
- L
- J
- I
- H
- G
- F
- E
- D
- C
- B
- A
- Index
- Managing race difficulty using a rubber-banding system
- Implementing a self-driving car
- Creating mazes procedurally
- Devising a table-football competitor
- Building an air-hockey rival
- Handling random numbers better
- Introduction
- Chapter 8. Miscellaneous
- Creating emergent particles using a harmony search
- Learning to use artificial neural networks
- Learning to use reinforcement
- Learning to use decision trees
- Learning to use Na?ve Bayes classifiers
- Improving the predictor: Hierarchical N-Gram
- Predicting actions with an N-Gram predictor
- .Introduction
- Chapter 7. Learning Techniques
- Implementing a checkers rival
- Implementing a tic-tac-toe rival
- Negascouting
- AB Negamaxing
- Negamaxing
- Introducing Minimax
- Working with the game-tree class
- Introduction
- Chapter 6. Board Games AI
- Creating awareness in a stealth game
- The smelling function using a graph-based system
- The hearing function using a graph-based system
- The seeing function using a graph-based system
- The smelling function using a collider-based system
- The hearing function using a collider-based system
- The seeing function using a collider-based system
- Introduction
- Chapter 5. Agent Awareness
- Building a fighting circle
- Improving influence with convolution filters
- Improving influence with map flooding
- Influence maps
- Exemplifying waypoints for decision making
- Analyzing waypoints by cover and visibility
- Analyzing waypoints by height
- Creating good waypoints
- Extending A* for coordination: A*mbush
- Handling formations
- Introduction
- Chapter 4. Coordination and Tactics
- Making decisions with goal-oriented behaviors
- Representing states with numerical values: Markov system
- Working with fuzzy logic
- Implementing behavior trees
- Combining FSMs and decision trees
- Improving FSMs: hierarchical finite-state machines
- Working a finite-state machine
- Choosing through a decision tree
- Introduction
- Chapter 3. Decision Making
- Smoothing a path
- Planning navigation in several frames: time-sliced search
- Improving A* for memory: IDA*
- Finding the best-promising path with A*
- Finding the shortest path with Dijkstra
- Finding the shortest path in a grid with BFS
- Finding your way out of a maze with DFS
- Representing the world with a self-made navigation mesh
- Representing the world with points of visibility
- Representing the world with Dirichlet domains
- Representing the world with grids
- Introduction
- Chapter 2. Navigation
- Creating a jump system
- Targeting a projectile
- Predicting a projectile's landing spot
- Shooting a projectile
- Combining behaviors using a steering pipeline
- Blending behaviors by priority
- Blending behaviors by weight
- Avoiding walls
- Avoiding agents
- Following a path
- Wandering around
- Facing objects
- Arriving and leaving
- Pursuing and evading
- Creating the behavior template
- Introduction
- Chapter 1. Behaviors – Intelligent Movement
- Preface
- www.PacktPub.com
- About the Reviewers
- About the Author
- Credits
- 版權信息
- 封面
- 封面
- 版權信息
- Credits
- About the Author
- About the Reviewers
- www.PacktPub.com
- Preface
- Chapter 1. Behaviors – Intelligent Movement
- Introduction
- Creating the behavior template
- Pursuing and evading
- Arriving and leaving
- Facing objects
- Wandering around
- Following a path
- Avoiding agents
- Avoiding walls
- Blending behaviors by weight
- Blending behaviors by priority
- Combining behaviors using a steering pipeline
- Shooting a projectile
- Predicting a projectile's landing spot
- Targeting a projectile
- Creating a jump system
- Chapter 2. Navigation
- Introduction
- Representing the world with grids
- Representing the world with Dirichlet domains
- Representing the world with points of visibility
- Representing the world with a self-made navigation mesh
- Finding your way out of a maze with DFS
- Finding the shortest path in a grid with BFS
- Finding the shortest path with Dijkstra
- Finding the best-promising path with A*
- Improving A* for memory: IDA*
- Planning navigation in several frames: time-sliced search
- Smoothing a path
- Chapter 3. Decision Making
- Introduction
- Choosing through a decision tree
- Working a finite-state machine
- Improving FSMs: hierarchical finite-state machines
- Combining FSMs and decision trees
- Implementing behavior trees
- Working with fuzzy logic
- Representing states with numerical values: Markov system
- Making decisions with goal-oriented behaviors
- Chapter 4. Coordination and Tactics
- Introduction
- Handling formations
- Extending A* for coordination: A*mbush
- Creating good waypoints
- Analyzing waypoints by height
- Analyzing waypoints by cover and visibility
- Exemplifying waypoints for decision making
- Influence maps
- Improving influence with map flooding
- Improving influence with convolution filters
- Building a fighting circle
- Chapter 5. Agent Awareness
- Introduction
- The seeing function using a collider-based system
- The hearing function using a collider-based system
- The smelling function using a collider-based system
- The seeing function using a graph-based system
- The hearing function using a graph-based system
- The smelling function using a graph-based system
- Creating awareness in a stealth game
- Chapter 6. Board Games AI
- Introduction
- Working with the game-tree class
- Introducing Minimax
- Negamaxing
- AB Negamaxing
- Negascouting
- Implementing a tic-tac-toe rival
- Implementing a checkers rival
- Chapter 7. Learning Techniques
- .Introduction
- Predicting actions with an N-Gram predictor
- Improving the predictor: Hierarchical N-Gram
- Learning to use Na?ve Bayes classifiers
- Learning to use decision trees
- Learning to use reinforcement
- Learning to use artificial neural networks
- Creating emergent particles using a harmony search
- Chapter 8. Miscellaneous
- Introduction
- Handling random numbers better
- Building an air-hockey rival
- Devising a table-football competitor
- Creating mazes procedurally
- Implementing a self-driving car
- Managing race difficulty using a rubber-banding system
- Index
- A
- B
- C
- D
- E
- F
- G
- H
- I
- J
- L
- M
- N
- O
- P
- R
- S
- T
- U
- W 更新時間：2021-07-09 19:38:06
