![]() Algorithms and Networking for Computer Games
ISBN: 978-0-470-01812-5
Hardcover
286 pages
June 2006
US $100.00
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 5-6 days delivery time. The book is not returnable.
Other Available Formats: E-Book
|
An online version of this product is available through our subscription-based content service. Visit Wiley Online Library now |
· Gives algorithmic solutions in pseudocode format, which not only emphasizes the idea behind the solution, but also can easily be written into the programming language of your choice.
· Covers random numbers, game trees and path finding.
· Includes a section on the Synthetic player, covering decision-making, influence maps, finite-state machines, flocking, fuzzy sets, neural networks and Bayesian belief.
· Details resource handling, including packet compression and aggregation, area-of-interest filtering, multicast filtering, and enhancing architectural design.
· Provides in-depth treatment of cheating prevention methods, including the MD5 algorithm and lock-step protocol.
Includes an accompanying website with errata and additional code samples.



Share This