Procedural generation in game design / authors, Tanya X. Short and Tarn Adams.
"Making a game can be an intensive process, and if not planned accurately can easily run over budget. The use of procedural generation in game design can help with the intricate and multifarious aspects of game development; thus facilitating cost reduction. This form of development enables game...
Saved in:
| Online Access: |
Full Text (via EBSCO) |
|---|---|
| Main Authors: | , |
| Format: | eBook |
| Language: | English |
| Published: |
Boca Raton :
Taylor & Francis, CRC Press,
2017.
|
| Subjects: |
MARC
| LEADER | 00000cam a2200000xi 4500 | ||
|---|---|---|---|
| 001 | b10041775 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 170619s2017 flu ob 001 0 eng d | ||
| 005 | 20240520202550.4 | ||
| 019 | |a 1076715635 | ||
| 020 | |a 9781315156378 |q (electronic bk.) | ||
| 020 | |a 1315156377 |q (electronic bk.) | ||
| 020 | |a 9781498799201 |q (ebk) | ||
| 020 | |a 1498799205 | ||
| 020 | |z 9781498799195 | ||
| 020 | |z 1498799191 | ||
| 020 | |z 9781138743311 | ||
| 020 | |z 1138743313 | ||
| 035 | |a (OCoLC)ebs990267798 | ||
| 035 | |a (OCoLC)990267798 |z (OCoLC)1076715635 | ||
| 037 | |a ebs1535777 | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d YDX |d IUL |d CRCPR |d COO |d IDEBK |d OCLCQ |d OCLCF |d OCLCO |d INT |d WYU |d OCLCQ |d LVT |d TYFRS |d OCLCQ |d UKAHL |d OCLCO |d OCLCQ | ||
| 049 | |a GWRE | ||
| 050 | 4 | |a QA76.76.C672 |b S543 2017eb | |
| 100 | 1 | |a Short, Tanya X., |e author. |0 http://id.loc.gov/authorities/names/n2018059457. | |
| 245 | 1 | 0 | |a Procedural generation in game design / |c authors, Tanya X. Short and Tarn Adams. |
| 264 | 1 | |a Boca Raton : |b Taylor & Francis, CRC Press, |c 2017. | |
| 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. | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | 0 | |g Machine generated contents note: |g ch. 1 |t When and Why to Use Procedural Generation -- |t Planning When To Use Procedural Generation / |r Darren Grey -- |t Integral / |r Darren Grey -- |t Drafting Content / |r Darren Grey -- |t Modal / |r Darren Grey -- |t Segmented / |r Darren Grey -- |t When PCG Is A Bad Idea / |r Darren Grey -- |t Quality Assurance / |r Darren Grey -- |t Time Restrictions / |r Darren Grey -- |t Authored Experience / |r Darren Grey -- |t Multiplayer / |r Darren Grey -- |t Just Random / |r Darren Grey -- |t Overreliance on PCG / |r Darren Grey -- |t Why Use Procedural Generation? / |r Darren Grey -- |t Utilitarian / |r Darren Grey -- |t Unique / |r Darren Grey -- |g ch. 2 |t Managing Output: Boredom versus Chaos / |r Darren Grey -- |g ch. 3 |t Aesthetics in Procedural Generation / |r Kenny Backus -- |t Atmosphere In Sunless Sea / |r Liam Welton -- |t Establishing The Rules / |r Liam Welton -- |t Blurring The Boundaries / |r Liam Welton -- |t Result / |r Liam Welton -- |g ch. 4 |t Designing for Modularity / |r Liam Welton -- |t Modules And Gestalts / |r Jason Grinblat -- |t Assembly Mechanisms And Gestalt Spaces / |r Jason Grinblat -- |t Enabling Play / |r Jason Grinblat -- |t Mechanics As Shared Substrates / |r Jason Grinblat -- |t Orthogonality / |r Jason Grinblat -- |t Equivalence Of Impact / |r Jason Grinblat -- |t Plotting Desirable Gestalts / |r Jason Grinblat -- |t Inserting Memorable Asymmetry / |r Jason Grinblat -- |t Reference / |r Jason Grinblat -- |g ch. 5 |t Ethical Procedural Generation / |r Jason Grinblat -- |t Talking In Code / |r Michael Cook -- |t Big Wide World / |r Michael Cook -- |t You Are What You Eat / |r Michael Cook -- |t Talking The Talk / |r Michael Cook -- |t Future / |r Michael Cook -- |g ch. 6 |t Level Design I: Case Study / |r Michael Cook -- |t Overview / |r Chris Chung -- |t Rules / |r Chris Chung -- |t How It Works / |r Chris Chung -- |t Conclusion / |r Chris Chung -- |g ch. 7 |t Level Design II: Handcrafted Integration / |r Chris Chung -- |t Standard Dungeons / |r Jim Shepard -- |t Crypt Generation / |r Jim Shepard -- |t Best Practices / |r Jim Shepard -- |t Dungeonmans Dungeon Generation Pseudocode / |r Jim Shepard -- |t Dungeonmans Crypt Generation Pseudocode / |r Jim Shepard -- |g ch. 8 |t Level Design III: Architecture and Destruction / |r Jim Shepard -- |t Architecture Generation / |r Evan Hahn -- |t Step 1: Calculate the Bounding Box / |r Evan Hahn -- |t Step 2: Split the Box into Regions / |r Evan Hahn -- |t Step 3: Skim Perimeter Regions / |r Evan Hahn -- |t Step 4: Place Connections / |r Evan Hahn -- |t Step 5: Assign Region Types / |r Evan Hahn -- |t Step 6: Make Adjustments / |r Evan Hahn -- |t Step 7: Generate the Regions / |r Evan Hahn -- |t Discussion / |r Evan Hahn -- |g ch. 9 |t Cyclic Generation / |r Evan Hahn -- |t Cycles / |r Joris Dormans -- |t Using Graphs To Express Cycles / |r Joris Dormans -- |t Patterns / |r Joris Dormans -- |t Implementation / |r Joris Dormans -- |t Aside: Lock-And-Key Attributes / |r Joris Dormans -- |t Locks Might Be Conditional, Dangerous, or Uncertain / |r Joris Dormans -- |t Locks Are Permanent, Reversible, Temporary, or Collapsing / |r Joris Dormans -- |t Locks Might Be Valves or Asymmetrical / |r Joris Dormans -- |t Locks and Keys Can Be Safe or Unsafe / |r Joris Dormans -- |t Keys Can Be Single Purpose or Multipurpose / |r Joris Dormans -- |t Keys Are Particular or Nonparticular / |r Joris Dormans -- |t Keys Might Be Consumed or Persistent / |r Joris Dormans -- |t Keys Might Be Fixed in Place / |r Joris Dormans -- |t Tilemaps / |r Joris Dormans -- |t Discussion / |r Joris Dormans -- |g ch. 10 |t Worlds / |r Joris Dormans -- |t Brief History Of World Generation / |r Mark R. Johnson -- |t Why Make Worlds? / |r Mark R. Johnson -- |t Exploration / |r Mark R. Johnson -- |t Expansive Or Complex Worlds / |r Mark R. Johnson -- |t Gameplay Variation / |r Mark R. Johnson -- |t Qualitative Procedural Generation / |r Mark R. Johnson -- |g ch. 11 |t Puzzles / |r Mark R. Johnson -- |t Procedurally Generating Puzzles / |r Danny Day -- |t Puzzle-Spaces / |r Danny Day -- |t Desired Outputs / |r Danny Day -- |t Puzzle Generation Approaches / |r Danny Day -- |t Random Start State / |r Danny Day -- |t Backward From Goal State / |r Danny Day -- |t Heuristics / |r Danny Day -- |t Extra Bonus: Permutations / |r Danny Day -- |t Desktop Dungeons, The Puzzle Roguelike / |r Danny Day -- |t More Puzzle Than Roguelike? / |r Danny Day -- |t More Roguelike Than Puzzle? / |r Danny Day -- |t Player Hope As A Resource / |r Danny Day -- |t Guaranteeing Solvability / |r Danny Day -- |t Generating Hope / |r Danny Day -- |t Conclusion / |r Danny Day -- |g ch. 12 |t Procedural Logic / |r Danny Day -- |t Background / |r Ben Kane -- |t Usual Approach To Procedural Generation / |r Ben Kane -- |t Different Application: Procedural Logic / |r Ben Kane -- |t How The Rule Logic Is Generated / |r Ben Kane -- |t Trivial Case / |r Ben Kane -- |t Countable Problems / |r Ben Kane -- |t Not So Trivial: Procedural Logic / |r Ben Kane -- |t Generating Rules / |r Ben Kane -- |t Queries: Asking Questions / |r Ben Kane -- |t Solutions: Taking Action / |r Ben Kane -- |t Improving The Process / |r Ben Kane -- |t Better Queries / |r Ben Kane -- |t Compound Queries / |r Ben Kane -- |t Query Contexts / |r Ben Kane -- |t Better Solutions / |r Ben Kane -- |t Rigging The Deck: Random That Feels Good / |r Ben Kane -- |t Dealing with Degenerates / |r Ben Kane -- |t Avoiding the Impossible / |r Ben Kane -- |t Putting It All Together / |r Ben Kane -- |t Conclusion / |r Ben Kane -- |g ch. 13 |t Artificial Intelligence / |r Ben Kane -- |t Unpredictability And Artificial Intelligence / |r Mark R. Johnson -- |t Movement And Combat / |r Mark R. Johnson -- |t Ambient Behavior / |r Mark R. Johnson -- |t Emergent Phenomena / |r Mark R. Johnson -- |t Conversations / |r Mark R. Johnson -- |t Dialects / |r Mark R. Johnson -- |t Conversation System / |r Mark R. Johnson -- |t Conclusion / |r Mark R. Johnson -- |g ch. 14 |t Procedural Enemy Waves / |r Mark R. Johnson -- |t Method 1: Spawn By Timer / |r Wyatt Cheng -- |t Spawn By Timer Pseudocode / |r Wyatt Cheng -- |t Commentary / |r Wyatt Cheng -- |t Key Characteristics / |r Wyatt Cheng -- |t Method 2: Spawn On Completion / |r Wyatt Cheng -- |t Spawn On Completion Pseudocode / |r Wyatt Cheng -- |t Commentary / |r Wyatt Cheng -- |t Key Characteristics / |r Wyatt Cheng -- |t Method 3: Continuously Escalating Total / |r Wyatt Cheng -- |t Continuously Escalating Total Pseudocode / |r Wyatt Cheng -- |t Commentary / |r Wyatt Cheng -- |t Key Characteristics / |r Wyatt Cheng -- |t Method 4: Hitpoint Progression / |r Wyatt Cheng -- |t Hitpoint Progression Pseudocode / |r Wyatt Cheng -- |t Commentary / |r Wyatt Cheng -- |t Key Characteristics / |r Wyatt Cheng -- |t Conclusion / |r Wyatt Cheng -- |g ch. 15 |t Generative Artwork / |r Wyatt Cheng -- |t Techniques / |r Loren Schmidt -- |t Perception Of Intent / |r Loren Schmidt -- |g ch. 16 |t Generative Art Toys / |r Loren Schmidt -- |t Building Art Toys, For Experts And Novices / |r Kate Compton -- |t Experience Of Art Toys / |r Kate Compton -- |t Trading Control For Power / |r Kate Compton -- |t Design And Construction Of Art Toys / |r Kate Compton -- |t Inputs / |r Kate Compton -- |t Data and Transformations / |r Kate Compton -- |t Points and Rotations / |r Kate Compton -- |t Connectivity and Meshes / |r Kate Compton -- |t Gestural Curves / |r Kate Compton -- |t Forces and Acceleration / |r Kate Compton -- |t Rendering / |r Kate Compton -- |t Outside The Generator: Judgment, Sharing, And Curation / |r Kate Compton -- |t Conclusions: Creativity For Anyone / |r Kate Compton -- |g ch. 17 |t Audio and Composition / |r Kate Compton -- |t Procedural Audio In Skipping Stones / |r Bronson Zgeb -- |t Sampling / |r Bronson Zgeb -- |t Pitch / |r Bronson Zgeb -- |t Implementation / |r Bronson Zgeb -- |t Procedural Composition In Skipping Stones / |r Bronson Zgeb -- |t Beat / |r Bronson Zgeb -- |t Scale / |r Bronson Zgeb -- |t Steps / |r Bronson Zgeb -- |t Chords / |r Bronson Zgeb -- |t Motif and Repetition / |r Bronson Zgeb -- |t Conclusion / |r Bronson Zgeb -- |g ch. 18 |t Story and Plot Generation / |r Bronson Zgeb -- |t Grammars And Story Grammars / |r Ben Kybartas -- |t Game World / |r Ben Kybartas -- |t Story Model / |r Ben Kybartas -- |t Rule Design / |r Ben Kybartas -- |t Secondary Rewrite Rules / |r Ben Kybartas -- |t Game World Simulation / |r Ben Kybartas -- |t Metric-Guided Generation / |r Ben Kybartas -- |t Conclusions / |r Ben Kybartas -- |g ch. |
| 505 | 0 | 0 | |t 19 |t Emergent Narratives and Story Volumes / |r Ben Kybartas -- |t Motivation / |r Jason Grinblat -- |t Voice In The Machine / |r Jason Grinblat -- |t Fiasco: A Case Study / |r Jason Grinblat -- |t Unpacking Your Themes / |r Jason Grinblat -- |t Grist For The Narrative Mill / |r Jason Grinblat -- |g ch. 20 |t Poetry Generation / |r Jason Grinblat -- |g ch. 21 |t Characters and Personalities / |r Harry Tuffs -- |t Introduction / |r Emily Short -- |t Source Material / |r Emily Short -- |t Realization / |r Emily Short -- |t Selecting Dialogue / |r Emily Short -- |t Layering Dialogue Features / |r Emily Short -- |t Character And World Interaction / |r Emily Short -- |t Creation / |r Emily Short -- |t Orthogonal / |r Emily Short -- |t Mechanically Significant / |r Emily Short -- |t Easy To Communicate / |r Emily Short -- |t Meaningful In Combination / |r Emily Short -- |t Recurring Strategies / |r Emily Short -- |t Combining Output From Several Layers Of Simulation Or Gameplay / |r Emily Short -- |t Bringing Character Into Every Interaction / |r Emily Short -- |t Juxtaposing Events And Interpretation / |r Emily Short -- |t Callbacks To Earlier Events / |r Emily Short -- |t Pitfalls / |r Emily Short -- |t Overgeneralization / |r Emily Short -- |t Overrealism / |r Emily Short -- |t Untamed Simulation / |r Emily Short -- |g ch. 22 |t Understanding the Generated / |r Emily Short -- |t Expressive Range And Generative Spaces / |r Gillian Smith -- |t Qualities Of The Generated / |r Gillian Smith -- |t Types Of Qualities / |r Gillian Smith -- |t Example / |r Gillian Smith -- |t Formalizing Qualities Into Metrics / |r Gillian Smith -- |t Example / |r Gillian Smith -- |t Metrics Versus Requirements / |r Gillian Smith -- |t Qualities Of The Generator / |r Gillian Smith -- |t Visualizing Expressive Range / |r Gillian Smith -- |t Histograms / |r Gillian Smith -- |t Example / |r Gillian Smith -- |t Distance-Based Clustering / |r Gillian Smith -- |t Conclusion / |r Gillian Smith -- |t References / |r Gillian Smith. |
| 505 | 0 | 0 | |g Note continued: |g ch. 23 |t Content Tools Case Study / |r Gillian Smith -- |t System Overview / |r Kepa Auwae -- |t Example Room / |r Kepa Auwae -- |g ch. 24 |t Automated Game Tuning / |r Kepa Auwae -- |t Step 1: Set Parameters / |r Aaron Isaksen -- |t Step 2: Generate The Game Level / |r Aaron Isaksen -- |t Step 3: Simulate The Game / |r Aaron Isaksen -- |t Step 4: Analyze The Data / |r Aaron Isaksen -- |t Step 5: Visualize The Data And Make Adjustments / |r Aaron Isaksen -- |t Conclusion / |r Aaron Isaksen -- |t Acknowledgments / |r Aaron Isaksen -- |g ch. 25 |t Generating Rules / |r Aaron Isaksen -- |t Mix And Match / |r Michael Cook -- |t Game Design 101 / |r Michael Cook -- |t Throwing Out The Rulebook / |r Michael Cook -- |g ch. 26 |t Algorithms and Approaches / |r Michael Cook -- |t Random Numbers / |r Brian Bucklew -- |t Pseudorandom Number Generators / |r Brian Bucklew -- |t Making Use of Repeatable Series / |r Brian Bucklew -- |t Seeds and Hashing / |r Brian Bucklew -- |t Rolling Dice / |r Brian Bucklew -- |t Normal Distributions / |r Brian Bucklew -- |t Weighted Distributions / |r Brian Bucklew -- |t Heightmaps / |r Brian Bucklew -- |t Box Linear Filters / |r Brian Bucklew -- |t Midpoint Displacement / |r Brian Bucklew -- |t Perlin and Simplex Noise / |r Brian Bucklew -- |t Sequence Generation / |r Brian Bucklew -- |t Lindenmayer Systems (L-Systems) / |r Brian Bucklew -- |t Markov Chains / |r Brian Bucklew -- |t Filling Space / |r Brian Bucklew -- |t Random Walks / |r Brian Bucklew -- |t One-Dimensional Random Walks / |r Brian Bucklew -- |t Two-Dimensional Random Walks / |r Brian Bucklew -- |t Cellular Automata / |r Brian Bucklew -- |t Settling / |r Brian Bucklew -- |t Wang Tiles / |r Brian Bucklew -- |t Partitioning Space / |r Brian Bucklew -- |t Binary Space Partition / |r Brian Bucklew -- |t Voronoi Diagrams / |r Brian Bucklew -- |t Dijkstra Maps / |r Brian Bucklew -- |t Tree Mapping / |r Brian Bucklew -- |t Putting It All Together / |r Brian Bucklew -- |g ch. 27 |t Meaning / |r Brian Bucklew -- |t Meaning In Games / |r Mark R. Johnson -- |t Meaninglessness In Games / |r Mark R. Johnson -- |t Designer And Player Meaning / |r Mark R. Johnson -- |t Meaning In Qualitative Procedural Generation / |r Mark R. Johnson -- |t Conclusion / |r Mark R. Johnson. |
| 520 | 2 | |a "Making a game can be an intensive process, and if not planned accurately can easily run over budget. The use of procedural generation in game design can help with the intricate and multifarious aspects of game development; thus facilitating cost reduction. This form of development enables games to create their play areas, objects and stories based on a set of rules, rather than relying on the developer to handcraft each element individually. Readers will learn to create randomized maps, weave accidental plotlines, and manage complex systems that are prone to unpredictable behavior. Tanya Short's and Tarn Adams' Procedural Generation in Game Design offers a wide collection of chapters from various experts that cover the implementation and enactment of procedural generation in games. Designers from a variety of studios provide concrete examples from their games to illustrate the many facets of this emerging sub-discipline."--Provided by publisher. | |
| 588 | 0 | |a Print version record. | |
| 650 | 0 | |a Level design (Computer science) |0 http://id.loc.gov/authorities/subjects/sh2009003431. | |
| 650 | 0 | |a Compter games |x Design. | |
| 650 | 7 | |a Level design (Computer science) |2 fast |0 (OCoLC)fst01747885. | |
| 700 | 1 | |a Adams, Tarn, |e author. |0 http://id.loc.gov/authorities/names/n2017002558. | |
| 776 | 0 | 8 | |i Print version: |a Short, Tanya X. |t Procedural generation in game design. |d Boca Raton : Taylor & Francis, CRC Press, 2017 |z 9781498799195 |w (DLC) 2016054480 |w (OCoLC)969973336. |
| 856 | 4 | 0 | |u https://colorado.idm.oclc.org/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&site=ehost-live&AN=1535777 |z Full Text (via EBSCO) |
| 907 | |a .b100417759 |b 08-18-22 |c 03-20-18 | ||
| 907 | |a .b100417759 |b 06-22-21 |c 03-20-18 | ||
| 915 | |a - | ||
| 944 | |a MARS | ||
| 956 | |a EBSCO ebook collection | ||
| 956 | |b All EBSCO eBooks | ||
| 998 | |a web |b 06-22-21 |c b |d b |e - |f eng |g flu |h 0 |i 1 | ||
| 999 | f | f | |i c49e2736-6d2f-5420-b5d3-6fe7f0668bc2 |s f0800188-dcab-5605-82e0-4b70e2d393df |
| 952 | f | f | |p Can circulate |a University of Colorado Boulder |b Online |c Online |d Online |e QA76.76.C672 S543 2017eb |h Library of Congress classification |i web |n 1 |