The influence map graph works exactly as a general graph, as well as the influence-based vertex, because there are just a couple of extra parameters for mapping the influence across the graph. The most relevant part relies on the computation of the influence, and it is based on the BFS algorithm.
For each unit on the map, we spread its influence given the radius. When the computed influence (drop-off) is greater than the vertex original faction, the vertex faction is changed.
Get Unity 2018 Artificial Intelligence Cookbook - Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.
Start your free trial Become a member now