๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Algorithms and Networking for Computer Games

โœ Scribed by Jouni Smed, Harri Hakonen


Publisher
Wiley
Year
2006
Tongue
English
Leaves
289
Edition
1
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


I teach a college course on network game programming and this is probably the best resource that I've yet seen on the subject. Only the last few chapters specifically deal with network programming however they are extremely good and cover a lot of the core issues with network gaming. Some of the topics include dealing with lag via dead reckoning and splines, local perception filters, area of interest filters, as well as some information on cheating and how to deal with it.

This book is absolutely NOT for someone just starting out with network programming or programming in general; I would recommend this for someone who knows the fundamentals of networking and using sockets and is a fairly strong C/C++ programmer and is interested in developing moderately simple network games. More inexperienced developers will probably benefit from this book if they have someone who can help clarify and explain the concepts.


๐Ÿ“œ SIMILAR VOLUMES


Algorithms and Networking for Computer G
โœ Jouni Smed, Harri Hakonen ๐Ÿ“‚ Library ๐Ÿ“… 2006 ๐Ÿ› Wiley ๐ŸŒ English

I teach a college course on network game programming and this is probably the best resource that I've yet seen on the subject. Only the last few chapters specifically deal with network programming however they are extremely good and cover a lot of the core issues with network gaming. Some of the t

Algorithms and Networking for Computer G
โœ Jouni Smed, Harri Hakonen ๐Ÿ“‚ Library ๐Ÿ“… 2006 ๐ŸŒ English

Algorithms and Networking for Computer Games is an essential guide to solving the algorithmic and networking problems of modern commercial computer games, written from the perspective of a computer scientist. Combining algorithmic knowledge and game-related problems, the authors discuss all the comm