{'fraction_non_alphanumeric': 0.02606310013717421, 'fraction_numerical': 0.0, 'mean_word_length': 5.636363636363637, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
PATH-FINDING FOR LARGE SCALE MULTIPLAYER COMPUTER GAMES

Path-finding consumes a significant amount of resources, especially in movement-intensive games such as (massively) multiplayer games. We investigate several pathfinding techniques, and explore the impact on performance of workloads derived from real player movements in a multiplayer game. We find that a map-conforming, hierarchical path-finding strategy performs best, and in combination with caching optimizations can greatly reduce path-finding cost. Performance is dominated primarily by algorithm, and only to a lesser degree by workload variation. Understanding the real impact of path-finding techniques allows for refined testing and optimization of game design.