Algorithms and Networking for Computer Games
(eBook)

Book Cover
Your Rating: 0 stars
Star rating for

Contributors:
Published:
[United States] : Wiley, 2017.
Format:
eBook
Content Description:
1 online resource
Status:

Description

The essential guide to solving algorithmic and networking problems in commercial computer games, revised and extended Algorithms and Networking for Computer Games, Second Edition is written from the perspective of the computer scientist. Combining algorithmic knowledge and game-related problems, it explores the most common problems encountered in game programing. The first part of the book presents practical algorithms for solving "classical" topics, such as random numbers, procedural generation, tournaments, group formations and game trees. The authors also focus on how to find a path in, create the terrain of, and make decisions in the game world. The second part introduces networking related problems in computer games, focusing on four key questions: how to hide the inherent communication delay, how to best exploit limited network resources, how to cope with cheating and how to measure the on-line game data. Thoroughly revised, updated, and expanded to reflect the many constituent changes occurring in the commercial gaming industry since the original, this Second Edition, like the first, is a timely, comprehensive resource offering deeper algorithmic insight and more extensive coverage of game-specific networking problems than ordinarily encountered in game development books. Algorithms and Networking for Computer Games, Second Edition: - Provides algorithmic solutions in pseudo-code format, which emphasises the idea behind the solution, and can easily be written into a programming language of choice - Features a section on the Synthetic player, covering decision-making, influence maps, finite-state machines, flocking, fuzzy sets, and probabilistic reasoning and noise generation - Contains in-depth treatment of network communication, including dead-reckoning, local perception filters, cheating prevention and on-line metrics - Now includes 73 ready-to-use algorithms and 247 illustrative exercises Algorithms and Networking for Computer Games, Second Edition is a must-have resource for advanced undergraduate and graduate students taking computer game related courses, postgraduate researchers in game-related topics, and developers interested in deepening their knowledge of the theoretical underpinnings of computer games and in learning new approaches to game design and programming.

Also in This Series

More Like This

More Details

Language:
English
ISBN:
9781119259831, 1119259835

Notes

Restrictions on Access
Instant title available through hoopla.
Description
The essential guide to solving algorithmic and networking problems in commercial computer games, revised and extended Algorithms and Networking for Computer Games, Second Edition is written from the perspective of the computer scientist. Combining algorithmic knowledge and game-related problems, it explores the most common problems encountered in game programing. The first part of the book presents practical algorithms for solving "classical" topics, such as random numbers, procedural generation, tournaments, group formations and game trees. The authors also focus on how to find a path in, create the terrain of, and make decisions in the game world. The second part introduces networking related problems in computer games, focusing on four key questions: how to hide the inherent communication delay, how to best exploit limited network resources, how to cope with cheating and how to measure the on-line game data. Thoroughly revised, updated, and expanded to reflect the many constituent changes occurring in the commercial gaming industry since the original, this Second Edition, like the first, is a timely, comprehensive resource offering deeper algorithmic insight and more extensive coverage of game-specific networking problems than ordinarily encountered in game development books. Algorithms and Networking for Computer Games, Second Edition: - Provides algorithmic solutions in pseudo-code format, which emphasises the idea behind the solution, and can easily be written into a programming language of choice - Features a section on the Synthetic player, covering decision-making, influence maps, finite-state machines, flocking, fuzzy sets, and probabilistic reasoning and noise generation - Contains in-depth treatment of network communication, including dead-reckoning, local perception filters, cheating prevention and on-line metrics - Now includes 73 ready-to-use algorithms and 247 illustrative exercises Algorithms and Networking for Computer Games, Second Edition is a must-have resource for advanced undergraduate and graduate students taking computer game related courses, postgraduate researchers in game-related topics, and developers interested in deepening their knowledge of the theoretical underpinnings of computer games and in learning new approaches to game design and programming.
System Details
Mode of access: World Wide Web.

Reviews from GoodReads

Loading GoodReads Reviews.

Citations

APA Citation (style guide)

Hakonen, H. (2017). Algorithms and Networking for Computer Games. Wiley.

Chicago / Turabian - Author Date Citation (style guide)

Hakonen, Harri. 2017. Algorithms and Networking for Computer Games. Wiley.

Chicago / Turabian - Humanities Citation (style guide)

Hakonen, Harri, Algorithms and Networking for Computer Games. Wiley, 2017.

MLA Citation (style guide)

Hakonen, Harri. Algorithms and Networking for Computer Games. Wiley, 2017.

Note! Citation formats are based on standards as of July 2022. Citations contain only title, author, edition, publisher, and year published. Citations should be used as a guideline and should be double checked for accuracy.

Staff View

Grouped Work ID:
ff6846e0-6ce7-4d0e-9cf7-4a0317278e8e
Go To Grouped Work

Hoopla Extract Information

Extract Information was matched by id in access url instead of record id.
hooplaId14883953
titleAlgorithms and Networking for Computer Games
languageENGLISH
kindEBOOK
series
season
publisherWiley
price1.99
active1
pa
profanity
children
demo
duration
rating
abridged
fiction
purchaseModelINSTANT
dateLastUpdatedMay 06, 2025 06:40:56 PM

Record Information

Last File Modification TimeMay 02, 2025 11:29:11 PM
Last Grouped Work Modification TimeMay 02, 2025 10:24:25 PM

MARC Record

LEADER03796nam a22004095i 4500
001MWT18089691
003MWT
00520250403081027.1
006m     o  d        
007cr cn|||||||||
008250403s2017    xxu    eo     000 0 eng d
020 |a 9781119259831 |q (electronic bk.)
020 |a 1119259835 |q (electronic bk.)
02842 |a MWT18089691
029 |a https://d2snwnmzyr8jue.cloudfront.net/jws_9781119259831_180.jpeg
037 |a 18089691 |b Midwest Tape, LLC |n http://www.midwesttapes.com
040 |a Midwest |e rda
099 |a eBook hoopla
1001 |a Hakonen, Harri, |e author.
24510 |a Algorithms and Networking for Computer Games |h [electronic resource] / |c Harri Hakonen and Jouni Smed.
2641 |a [United States] : |b Wiley, |c 2017.
2642 |b Made available through hoopla
300 |a 1 online resource
336 |a text |b txt |2 rdacontent
337 |a computer |b c |2 rdamedia
338 |a online resource |b cr |2 rdacarrier
347 |a text file |2 rda
506 |a Instant title available through hoopla.
520 |a The essential guide to solving algorithmic and networking problems in commercial computer games, revised and extended Algorithms and Networking for Computer Games, Second Edition is written from the perspective of the computer scientist. Combining algorithmic knowledge and game-related problems, it explores the most common problems encountered in game programing. The first part of the book presents practical algorithms for solving "classical" topics, such as random numbers, procedural generation, tournaments, group formations and game trees. The authors also focus on how to find a path in, create the terrain of, and make decisions in the game world. The second part introduces networking related problems in computer games, focusing on four key questions: how to hide the inherent communication delay, how to best exploit limited network resources, how to cope with cheating and how to measure the on-line game data. Thoroughly revised, updated, and expanded to reflect the many constituent changes occurring in the commercial gaming industry since the original, this Second Edition, like the first, is a timely, comprehensive resource offering deeper algorithmic insight and more extensive coverage of game-specific networking problems than ordinarily encountered in game development books. Algorithms and Networking for Computer Games, Second Edition: - Provides algorithmic solutions in pseudo-code format, which emphasises the idea behind the solution, and can easily be written into a programming language of choice - Features a section on the Synthetic player, covering decision-making, influence maps, finite-state machines, flocking, fuzzy sets, and probabilistic reasoning and noise generation - Contains in-depth treatment of network communication, including dead-reckoning, local perception filters, cheating prevention and on-line metrics - Now includes 73 ready-to-use algorithms and 247 illustrative exercises Algorithms and Networking for Computer Games, Second Edition is a must-have resource for advanced undergraduate and graduate students taking computer game related courses, postgraduate researchers in game-related topics, and developers interested in deepening their knowledge of the theoretical underpinnings of computer games and in learning new approaches to game design and programming.
538 |a Mode of access: World Wide Web.
6500 |a Algorithms.
6500 |a Computer programming.
6500 |a Computers.
6500 |a Electronic books.
7102 |a hoopla digital.
85640 |u https://www.hoopladigital.com/title/14883953?utm_source=MARC&Lid=hh4435 |z Instantly available on hoopla.
85642 |z Cover image |u https://d2snwnmzyr8jue.cloudfront.net/jws_9781119259831_180.jpeg