Author: Jouni Smed
Publisher: John Wiley & Sons
ISBN: 1119259835
Category : Computers
Languages : en
Pages : 497
Book 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.
Algorithms and Networking for Computer Games
Author: Jouni Smed
Publisher: John Wiley & Sons
ISBN: 1119259835
Category : Computers
Languages : en
Pages : 497
Book 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.
Publisher: John Wiley & Sons
ISBN: 1119259835
Category : Computers
Languages : en
Pages : 497
Book 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.
Algorithms and Networking for Computer Games
Author: Jouni Smed
Publisher: John Wiley & Sons
ISBN: 1119259827
Category : Computers
Languages : en
Pages : 415
Book 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.
Publisher: John Wiley & Sons
ISBN: 1119259827
Category : Computers
Languages : en
Pages : 415
Book 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.
Game Programming Algorithms and Techniques
Author: Sanjay Madhav
Publisher: Pearson Education
ISBN: 0321940156
Category : Computers
Languages : en
Pages : 352
Book Description
Game Programming Algorithms and Techniques is a detailed overview of many of the important algorithms and techniques used in video game programming today. Designed for programmers who are familiar with object-oriented programming and basic data structures, this book focuses on practical concepts that see actual use in the game industry. Sanjay Madhav takes a unique platform- and framework-agnostic approach that will help develop virtually any game, in any genre, with any language or framework. He presents the fundamental techniques for working with 2D and 3D graphics, physics, artificial intelligence, cameras, and much more. Each concept is illuminated with pseudocode that will be intuitive to any C#, Java, or C++ programmer, and has been refined and proven in Madhav's game programming courses at the University of Southern California. Review questions after each chapter help solidify the most important concepts before moving on. Madhav concludes with a detailed analysis of two complete games: a 2D iOS side-scroller (written in Objective-Cusing cocos2d) and a 3D PC/Mac/Linux tower defense game (written in C# using XNA/ MonoGame). These games illustrate many of the algorithms and techniques covered in the earlier chapters, and the full source code is available at gamealgorithms.net. Coverage includes Game time management, speed control, and ensuring consistency on diverse hardware Essential 2D graphics techniques for modern mobile gaming Vectors, matrices, and linear algebra for 3D games 3D graphics including coordinate spaces, lighting and shading, z-buffering, and quaternions Handling today's wide array of digital and analog inputs Sound systems including sound events, 3D audio, and digital signal processing Fundamentals of game physics, including collision detection and numeric integration Cameras: first-person, follow, spline, and more Artificial intelligence: pathfinding, state-based behaviors, and strategy/planning User interfaces including menu systems and heads-up displays Scripting and text-based data files: when, how, and where to use them Basics of networked games including protocols and network topology
Publisher: Pearson Education
ISBN: 0321940156
Category : Computers
Languages : en
Pages : 352
Book Description
Game Programming Algorithms and Techniques is a detailed overview of many of the important algorithms and techniques used in video game programming today. Designed for programmers who are familiar with object-oriented programming and basic data structures, this book focuses on practical concepts that see actual use in the game industry. Sanjay Madhav takes a unique platform- and framework-agnostic approach that will help develop virtually any game, in any genre, with any language or framework. He presents the fundamental techniques for working with 2D and 3D graphics, physics, artificial intelligence, cameras, and much more. Each concept is illuminated with pseudocode that will be intuitive to any C#, Java, or C++ programmer, and has been refined and proven in Madhav's game programming courses at the University of Southern California. Review questions after each chapter help solidify the most important concepts before moving on. Madhav concludes with a detailed analysis of two complete games: a 2D iOS side-scroller (written in Objective-Cusing cocos2d) and a 3D PC/Mac/Linux tower defense game (written in C# using XNA/ MonoGame). These games illustrate many of the algorithms and techniques covered in the earlier chapters, and the full source code is available at gamealgorithms.net. Coverage includes Game time management, speed control, and ensuring consistency on diverse hardware Essential 2D graphics techniques for modern mobile gaming Vectors, matrices, and linear algebra for 3D games 3D graphics including coordinate spaces, lighting and shading, z-buffering, and quaternions Handling today's wide array of digital and analog inputs Sound systems including sound events, 3D audio, and digital signal processing Fundamentals of game physics, including collision detection and numeric integration Cameras: first-person, follow, spline, and more Artificial intelligence: pathfinding, state-based behaviors, and strategy/planning User interfaces including menu systems and heads-up displays Scripting and text-based data files: when, how, and where to use them Basics of networked games including protocols and network topology
Fundamentals of Network Game Development
Author: Guy W. Lecky-Thompson
Publisher:
ISBN: 9781584505570
Category : Computers
Languages : en
Pages : 0
Book Description
Learn to create network games from start to finish with "Fundamentals of Network Game Development." Covering all the essential elements of network game development, this book provides the techniques and strategies necessary to create a quality game. Organized into three core sections--design, design and development, and development--the book explores all the unique, underlying aspects that game designers and developers need to consider when building a game that uses a network to connect players both with the game and with each other. You'll examine the characteristics that set a network game apart from one that is played offline, the different types of games and networks, how the design and development processes differ depending on the type of game, how design elements affect development implementation and vice versa, how to prevent cheating and hacking, and how to test the final product. Throughout each chapter, real games are used as case studies to help guide you through the challenges of creating your own games. "Fundamentals of Network Game Development" provides you with the foundation you need to create professional-caliber network games.
Publisher:
ISBN: 9781584505570
Category : Computers
Languages : en
Pages : 0
Book Description
Learn to create network games from start to finish with "Fundamentals of Network Game Development." Covering all the essential elements of network game development, this book provides the techniques and strategies necessary to create a quality game. Organized into three core sections--design, design and development, and development--the book explores all the unique, underlying aspects that game designers and developers need to consider when building a game that uses a network to connect players both with the game and with each other. You'll examine the characteristics that set a network game apart from one that is played offline, the different types of games and networks, how the design and development processes differ depending on the type of game, how design elements affect development implementation and vice versa, how to prevent cheating and hacking, and how to test the final product. Throughout each chapter, real games are used as case studies to help guide you through the challenges of creating your own games. "Fundamentals of Network Game Development" provides you with the foundation you need to create professional-caliber network games.
Handbook of Algorithms for Wireless Networking and Mobile Computing
Author: Azzedine Boukerche
Publisher: CRC Press
ISBN: 1420035096
Category : Computers
Languages : en
Pages : 1042
Book Description
The Handbook of Algorithms for Wireless Networking and Mobile Computing focuses on several aspects of mobile computing, particularly algorithmic methods and distributed computing with mobile communications capability. It provides the topics that are crucial for building the foundation for the design and construction of future generations of mobile and wireless networks, including cellular, wireless ad hoc, sensor, and ubiquitous networks. Following an analysis of fundamental algorithms and protocols, the book offers a basic overview of wireless technologies and networks. Other topics include issues related to mobility, aspects of QoS provisioning in wireless networks, future applications, and much more.
Publisher: CRC Press
ISBN: 1420035096
Category : Computers
Languages : en
Pages : 1042
Book Description
The Handbook of Algorithms for Wireless Networking and Mobile Computing focuses on several aspects of mobile computing, particularly algorithmic methods and distributed computing with mobile communications capability. It provides the topics that are crucial for building the foundation for the design and construction of future generations of mobile and wireless networks, including cellular, wireless ad hoc, sensor, and ubiquitous networks. Following an analysis of fundamental algorithms and protocols, the book offers a basic overview of wireless technologies and networks. Other topics include issues related to mobility, aspects of QoS provisioning in wireless networks, future applications, and much more.
Twenty Lectures on Algorithmic Game Theory
Author: Tim Roughgarden
Publisher: Cambridge University Press
ISBN: 1316781178
Category : Computers
Languages : en
Pages : 356
Book Description
Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.
Publisher: Cambridge University Press
ISBN: 1316781178
Category : Computers
Languages : en
Pages : 356
Book Description
Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.
Algorithms for Next Generation Networks
Author: Graham Cormode
Publisher: Springer Science & Business Media
ISBN: 1848827652
Category : Computers
Languages : en
Pages : 469
Book Description
Data networking now plays a major role in everyday life and new applications continue to appear at a blinding pace. Yet we still do not have a sound foundation for designing, evaluating and managing these networks. This book covers topics at the intersection of algorithms and networking. It builds a complete picture of the current state of research on Next Generation Networks and the challenges for the years ahead. Particular focus is given to evolving research initiatives and the architecture they propose and implications for networking. Topics: Network design and provisioning, hardware issues, layer-3 algorithms and MPLS, BGP and Inter AS routing, packet processing for routing, security and network management, load balancing, oblivious routing and stochastic algorithms, network coding for multicast, overlay routing for P2P networking and content delivery. This timely volume will be of interest to a broad readership from graduate students to researchers looking to survey recent research its open questions.
Publisher: Springer Science & Business Media
ISBN: 1848827652
Category : Computers
Languages : en
Pages : 469
Book Description
Data networking now plays a major role in everyday life and new applications continue to appear at a blinding pace. Yet we still do not have a sound foundation for designing, evaluating and managing these networks. This book covers topics at the intersection of algorithms and networking. It builds a complete picture of the current state of research on Next Generation Networks and the challenges for the years ahead. Particular focus is given to evolving research initiatives and the architecture they propose and implications for networking. Topics: Network design and provisioning, hardware issues, layer-3 algorithms and MPLS, BGP and Inter AS routing, packet processing for routing, security and network management, load balancing, oblivious routing and stochastic algorithms, network coding for multicast, overlay routing for P2P networking and content delivery. This timely volume will be of interest to a broad readership from graduate students to researchers looking to survey recent research its open questions.
Distributed Graph Algorithms for Computer Networks
Author: Kayhan Erciyes
Publisher: Springer Science & Business Media
ISBN: 1447151739
Category : Computers
Languages : en
Pages : 328
Book Description
This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.
Publisher: Springer Science & Business Media
ISBN: 1447151739
Category : Computers
Languages : en
Pages : 328
Book Description
This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.
Algorithmic and Architectural Gaming Design: Implementation and Development
Author: Kumar, Ashok
Publisher: IGI Global
ISBN: 1466616350
Category : Computers
Languages : en
Pages : 477
Book Description
Video games represent a unique blend of programming, art, music, and unbridled creativity. To the general public, they are perhaps the most exciting computer applications ever undertaken. In the field of computer science, they have been the impetus for a continuous stream of innovations designed to provide gaming enthusiasts with the most realistic and enjoyable gaming experience possible. Algorithmic and Architectural Gaming Design: Implementation and Development discusses the most recent advances in the field of video game design, with particular emphasis on practical examples of game development, including design and implementation. The target audience of this book includes educators, students, practitioners, professionals, and researchers working in the area of video game design and development. Anyone actively developing video games will benefit from the practical application of fundamental computer science concepts demonstrated in this book.
Publisher: IGI Global
ISBN: 1466616350
Category : Computers
Languages : en
Pages : 477
Book Description
Video games represent a unique blend of programming, art, music, and unbridled creativity. To the general public, they are perhaps the most exciting computer applications ever undertaken. In the field of computer science, they have been the impetus for a continuous stream of innovations designed to provide gaming enthusiasts with the most realistic and enjoyable gaming experience possible. Algorithmic and Architectural Gaming Design: Implementation and Development discusses the most recent advances in the field of video game design, with particular emphasis on practical examples of game development, including design and implementation. The target audience of this book includes educators, students, practitioners, professionals, and researchers working in the area of video game design and development. Anyone actively developing video games will benefit from the practical application of fundamental computer science concepts demonstrated in this book.
Handbook on Interactive Storytelling
Author: Jouni Smed
Publisher: John Wiley & Sons
ISBN: 1119688175
Category : Computers
Languages : en
Pages : 224
Book Description
HANDBOOK ON INTERACTIVE STORYTELLING Discover the latest research on crafting compelling narratives in interactive entertainment Electronic games are no longer considered “mere fluff” alongside the “real” forms of entertainment, like film, music, and television. Instead, many games have evolved into an art form in their own right, including carefully constructed stories and engaging narratives enjoyed by millions of people around the world. In Handbook on Interactive Storytelling, readers will find a comprehensive discussion of the latest research covering the creation of interactive narratives that allow users to experience a dramatically compelling story that responds directly to their actions and choices. Systematically organized, with extensive bibliographies and academic exercises included in each chapter, the book offers readers new perspectives on existing research and fresh avenues ripe for further study. In-depth case studies explore the challenges involved in crafting a narrative that comprises one of the main features of the gaming experience, regardless of the technical aspects of a game’s production. Readers will also enjoy: A thorough introduction to interactive storytelling, including discussions of narrative, plot, story, interaction, and a history of the phenomenon, from improvisational theory to role-playing games A rigorous discussion of the background of storytelling, from Aristotle’s Poetics to Joseph Campbell and the hero’s journey Compelling explorations of different perspectives in the interactive storytelling space, including different platforms, designers, and interactors, as well as an explanation of storyworlds Perfect for game designers, developers, game and narrative researchers, academics, undergraduate and graduate students studying storytelling, game design, gamification, and multimedia systems, Handbook on Interactive Storytelling is an indispensable resource for anyone interested in the deployment of compelling narratives in an interactive context.
Publisher: John Wiley & Sons
ISBN: 1119688175
Category : Computers
Languages : en
Pages : 224
Book Description
HANDBOOK ON INTERACTIVE STORYTELLING Discover the latest research on crafting compelling narratives in interactive entertainment Electronic games are no longer considered “mere fluff” alongside the “real” forms of entertainment, like film, music, and television. Instead, many games have evolved into an art form in their own right, including carefully constructed stories and engaging narratives enjoyed by millions of people around the world. In Handbook on Interactive Storytelling, readers will find a comprehensive discussion of the latest research covering the creation of interactive narratives that allow users to experience a dramatically compelling story that responds directly to their actions and choices. Systematically organized, with extensive bibliographies and academic exercises included in each chapter, the book offers readers new perspectives on existing research and fresh avenues ripe for further study. In-depth case studies explore the challenges involved in crafting a narrative that comprises one of the main features of the gaming experience, regardless of the technical aspects of a game’s production. Readers will also enjoy: A thorough introduction to interactive storytelling, including discussions of narrative, plot, story, interaction, and a history of the phenomenon, from improvisational theory to role-playing games A rigorous discussion of the background of storytelling, from Aristotle’s Poetics to Joseph Campbell and the hero’s journey Compelling explorations of different perspectives in the interactive storytelling space, including different platforms, designers, and interactors, as well as an explanation of storyworlds Perfect for game designers, developers, game and narrative researchers, academics, undergraduate and graduate students studying storytelling, game design, gamification, and multimedia systems, Handbook on Interactive Storytelling is an indispensable resource for anyone interested in the deployment of compelling narratives in an interactive context.