Algorithms and Networking for Computer Games

Algorithms and Networking for Computer Games is an essentialguide to solving the algorithmic and networking problems of moderncommercial computer games, written from the perspective of acomputer scientist. Combining algorithmic knowledge andgame-related problems, the authors discuss all the commondifficulties encountered in game programming. The first part of the book tackles algorithmic problems bypresenting how they can be solved practically. As well as"classical" topics such as random numbers, tournaments and gametrees, the authors focus on how to find a path in, create theterrain of, and make decisions in the game world. Part twointroduces networking related problems in computer games andfocuses on three key questions: how to hide the inherentcommunication delay, how to utilize limited network resources, andhow to cope with cheating. Algorithms and Networking for Computer Games provides acomprehensive resource that offers deeper algorithmic insight intogame programming and explains game-specific network considerations.Read on for... * Algorithmic solutions in pseudo code format, which not onlyemphasizes the idea behind the solution, but also can easily bewritten into the programming language of your choice. * A section on the Synthetic player, covering decision-making,influence maps, finite-state machines, flocking, fuzzy sets andprobabilistic reasoning. * In-depth treatment of network communication including deadreckoning, local perception filters and cheating prevention. * 51 ready-to-use algorithms and 178 illustrative exercises. Algorithms and Networking for Computer Games is amust-read text for advanced undergraduate and graduate students oncomputer game-related courses, postgraduate researchers ingame-related topics, and game developers interested in newapproaches and the theoretical background to games.