Graph Algorithms

In algorithms today we started learning about graph algorithms, for example things like finding the shortest path etc. This is good news, hopefully by the end of the semester I will have enough ability in this area to make designing the AI for Dynamic MUD more efficiently. One of the biggest problems with AI in games is that it takes up a lot of memory and CPU time. Being that the game world in my case is basically a large grid of vertices connected by edges, it would be quite simple to treat the world as a graph and use these same practices to quickly find the fastest path between two points. I guess there was some value taking this class after all :)

-Toraux

Tags: Algorithms, Engineering, Game, Games, MUDS, Multi User Dungeon, Online Games, Game Design, Programming