Algorithms and networking for computer games:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ, USA
John Wiley & Sons Inc.
[2017]
|
| Ausgabe: | Second edition |
| Schlagworte: | |
| Online-Zugang: | FRO01 UBG01 URL des Erstveröffentlichers Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index Algorithms and Networking for Computer Games; Contents; List of Figures; List of Tables; List of Algorithms; Preface; Acknowledgements; 1 Introduction; 1.1 Anatomy of Computer Games; 1.2 Game Development; 1.2.1 Phases of development; 1.2.2 Documentation; 1.2.3 Other considerations; 1.3 Synthetic Players; 1.3.1 Humanness; 1.3.2 Stance; 1.4 Multiplaying; 1.5 Interactive Storytelling; 1.5.1 Approaches; 1.5.2 Storytelling in games; 1.6 Outline of the Book; 1.6.1 Algorithms; 1.6.2 Networking; 1.7 Summary; Exercises; Part I Algorithms; 2 Random Numbers; 2.1 Linear Congruential Method 2.1.1 Choice of parameters2.1.2 Testing the randomness; 2.1.3 Using the generators; 2.2 Discrete Finite Distributions; 2.3 Random Shuffling; 2.4 Summary; Exercises; 3 Noise; 3.1 Applying Noise; 3.2 Origin of Noise; 3.3 Visualization; 3.4 Interpolation; 3.4.1 Utility routines for value conversions; 3.4.2 Interpolation in a single parameter; 3.4.3 Interpolation in two parameters; 3.5 Composition of Noise; 3.6 Periodic Noise; 3.7 Perlin Noise; 3.8 Worley Noise; 3.9 Summary; Exercises; 4 Procedural Generation; 4.1 Terrain Generation; 4.2 Maze Algorithms; 4.2.1 Depth-first algorithm 4.2.2 Randomized Kruskal's algorithm4.2.3 Randomized Prim's algorithm; 4.3 L-Systems; 4.3.1 Examples; 4.3.2 City generation; 4.4 Hierarchical Universe Generation; 4.5 Summary; Exercises; 5 Tournaments; 5.1 Rank Adjustment Tournaments; 5.2 Elimination Tournaments; 5.3 Scoring Tournaments; 5.4 Summary; Exercises; 6 Game Trees; 6.1 Minimax; 6.1.1 Analysis; 6.1.2 Partial minimax; 6.2 Alpha-Beta Pruning; 6.2.1 Analysis; 6.2.2 Principal variation search; 6.3 Monte Carlo Tree Search; 6.4 Games of Chance; 6.5 Summary; Exercises; 7 Path Finding; 7.1 Discretization of the Game World; 7.1.1 Grid 7.1.2 Navigation mesh7.2 Finding the Minimum Path; 7.2.1 Evaluation function; 7.2.2 Properties; 7.2.3 Algorithm A*; 7.3 Realizing the Movement; 7.4 Summary; Exercises; 8 Group Movement; 8.1 Flocking; 8.2 Formations; 8.2.1 Coordinating formations; 8.2.2 Behaviour-based steering; 8.2.3 Fuzzy logic control; 8.2.4 Mass-spring systems; 8.3 Summary; Exercises; 9 Decision-Making; 9.1 Background; 9.1.1 Levels of decision-making; 9.1.2 Modelled knowledge; 9.1.3 Methods; 9.2 Finite State Machines; 9.2.1 Computational FSM; 9.2.2 Mealy and Moore machines; 9.2.3 Implementation; 9.2.4 Discussion 9.3 Influence Maps9.4 Automated Planning; 9.5 Summary; Exercises; 10 Modelling Uncertainty; 10.1 Statistical Reasoning; 10.1.1 Bayes' theorem; 10.1.2 Bayesian networks; 10.1.3 Dempster-Shafer theory; 10.2 Fuzzy Sets; 10.2.1 Membership function; 10.2.2 Fuzzy operations; 10.2.3 Defuzzification; 10.3 Fuzzy Constraint Satisfaction Problem; 10.3.1 Modelling the criteria as fuzzy sets; 10.3.2 Weighting the importance of criteria; 10.3.3 Aggregating the criteria; 10.3.4 Making a decision; 10.4 Summary; Exercises; Part II Networking; 11 Communication Layers; 11.1 Physical Platform |
| Beschreibung: | 1 online resource |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044426990 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170726s2017 |||| o||u| ||||||eng d | ||
| 020 | |z 9781119259770 |9 9781119259770 | ||
| 020 | |z 1119259770 |9 1119259770 | ||
| 020 | |z 9781119259763 |c Print |9 9781119259763 | ||
| 024 | 7 | |a 10.1002/9781119259770 |2 doi | |
| 035 | |a (OCoLC)1002261233 | ||
| 035 | |a (DE-599)BVBBV044426990 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-861 | ||
| 082 | 0 | |a 794.8/1526 | |
| 100 | 1 | |a Smed, Jouni |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms and networking for computer games |c Dr. Jouni Smed, Dr. Harri Hakonen |
| 250 | |a Second edition | ||
| 264 | 1 | |a Hoboken, NJ, USA |b John Wiley & Sons Inc. |c [2017] | |
| 300 | |a 1 online resource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 500 | |a Algorithms and Networking for Computer Games; Contents; List of Figures; List of Tables; List of Algorithms; Preface; Acknowledgements; 1 Introduction; 1.1 Anatomy of Computer Games; 1.2 Game Development; 1.2.1 Phases of development; 1.2.2 Documentation; 1.2.3 Other considerations; 1.3 Synthetic Players; 1.3.1 Humanness; 1.3.2 Stance; 1.4 Multiplaying; 1.5 Interactive Storytelling; 1.5.1 Approaches; 1.5.2 Storytelling in games; 1.6 Outline of the Book; 1.6.1 Algorithms; 1.6.2 Networking; 1.7 Summary; Exercises; Part I Algorithms; 2 Random Numbers; 2.1 Linear Congruential Method | ||
| 500 | |a 2.1.1 Choice of parameters2.1.2 Testing the randomness; 2.1.3 Using the generators; 2.2 Discrete Finite Distributions; 2.3 Random Shuffling; 2.4 Summary; Exercises; 3 Noise; 3.1 Applying Noise; 3.2 Origin of Noise; 3.3 Visualization; 3.4 Interpolation; 3.4.1 Utility routines for value conversions; 3.4.2 Interpolation in a single parameter; 3.4.3 Interpolation in two parameters; 3.5 Composition of Noise; 3.6 Periodic Noise; 3.7 Perlin Noise; 3.8 Worley Noise; 3.9 Summary; Exercises; 4 Procedural Generation; 4.1 Terrain Generation; 4.2 Maze Algorithms; 4.2.1 Depth-first algorithm | ||
| 500 | |a 4.2.2 Randomized Kruskal's algorithm4.2.3 Randomized Prim's algorithm; 4.3 L-Systems; 4.3.1 Examples; 4.3.2 City generation; 4.4 Hierarchical Universe Generation; 4.5 Summary; Exercises; 5 Tournaments; 5.1 Rank Adjustment Tournaments; 5.2 Elimination Tournaments; 5.3 Scoring Tournaments; 5.4 Summary; Exercises; 6 Game Trees; 6.1 Minimax; 6.1.1 Analysis; 6.1.2 Partial minimax; 6.2 Alpha-Beta Pruning; 6.2.1 Analysis; 6.2.2 Principal variation search; 6.3 Monte Carlo Tree Search; 6.4 Games of Chance; 6.5 Summary; Exercises; 7 Path Finding; 7.1 Discretization of the Game World; 7.1.1 Grid | ||
| 500 | |a 7.1.2 Navigation mesh7.2 Finding the Minimum Path; 7.2.1 Evaluation function; 7.2.2 Properties; 7.2.3 Algorithm A*; 7.3 Realizing the Movement; 7.4 Summary; Exercises; 8 Group Movement; 8.1 Flocking; 8.2 Formations; 8.2.1 Coordinating formations; 8.2.2 Behaviour-based steering; 8.2.3 Fuzzy logic control; 8.2.4 Mass-spring systems; 8.3 Summary; Exercises; 9 Decision-Making; 9.1 Background; 9.1.1 Levels of decision-making; 9.1.2 Modelled knowledge; 9.1.3 Methods; 9.2 Finite State Machines; 9.2.1 Computational FSM; 9.2.2 Mealy and Moore machines; 9.2.3 Implementation; 9.2.4 Discussion | ||
| 500 | |a 9.3 Influence Maps9.4 Automated Planning; 9.5 Summary; Exercises; 10 Modelling Uncertainty; 10.1 Statistical Reasoning; 10.1.1 Bayes' theorem; 10.1.2 Bayesian networks; 10.1.3 Dempster-Shafer theory; 10.2 Fuzzy Sets; 10.2.1 Membership function; 10.2.2 Fuzzy operations; 10.2.3 Defuzzification; 10.3 Fuzzy Constraint Satisfaction Problem; 10.3.1 Modelling the criteria as fuzzy sets; 10.3.2 Weighting the importance of criteria; 10.3.3 Aggregating the criteria; 10.3.4 Making a decision; 10.4 Summary; Exercises; Part II Networking; 11 Communication Layers; 11.1 Physical Platform | ||
| 650 | 4 | |a Computer algorithms / fast / (OCoLC)fst00872010 | |
| 650 | 4 | |a Computer games / Programming / fast / (OCoLC)fst00872114 | |
| 650 | 4 | |a GAMES / Board / bisacsh | |
| 650 | 4 | |a Computer games / Programming | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Computerspiel |0 (DE-588)4010457-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Computerspiel |0 (DE-588)4010457-6 |D s |
| 689 | 0 | 1 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Hakonen, Harri |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029828469&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ZDB-35-WIC | ||
| 940 | 1 | |q UBG_PDA_WIC | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029828469 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770 |l FRO01 |p ZDB-35-WIC |q FRO_PDA_WIC |x Verlag |3 Volltext | |
| 966 | e | |u https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770 |l UBG01 |p ZDB-35-WIC |q UBG_PDA_WIC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804177726173609984 |
|---|---|
| adam_text | Titel: Algorithms and networking for computer games
Autor: Smed, Jouni
Jahr: 2017
Contents
List of Figures xi
List of Tables xv
List of Algorithms xvii
Preface xix
1 Introduction 1
1.1 Anatomy of Computer Games 4
1.2 Game Development 5
1.2.1 Phases of development 7
1.2.2 Documentation 8
1.2.3 Other considerations 9
1.3 Synthetic Players 10
1.3.1 Humanness 11
1.3.2 Stance 12
1.4 Multiplying 12
1.5 Interactive Storytelling 13
1.5.1 Approaches 14
1.5.2 Storytelling in games 15
1.6 Outline of the Book 17
1.6.1 Algorithms 17
1.6.2 Networking 18
1.7 Summary 18
Exercises 19
Part I Algorithms 23
2 Random Numbers 25
2.1 Linear Congruential Method 26
2.1.1 Choice of parameters 29
2.1.2 Testing the randomness 30
2.1.3 Using the generators 31
2.2 Discrete Finite Distributions 33
2.3 Random Shuffling 38
2.4 Summary 41
Exercises 41
vi 1 Contents
3 Noise 47
3.1 Applying Noise 47
3.2 Origin of Noise 49
3.3 Visualization 51
3.4 Interpolation 52
3.4.1 Utility routines for value conversions 53
3.4.2 Interpolation in a single parameter 56
3.4.3 Interpolation in two parameters 58
3.5 Composition of Noise 60
3.6 Periodic Noise 62
3.7 Perlin Noise 63
3.8 Worley Noise 68
3.9 Summary 76
Exercises 76
4 Procedural Generation 81
4.1 Terrain Generation 82
4.2 Maze Algorithms 88
4.2.1 Depth-first algorithm 91
4.2.2 Randomized Kruskal s algorithm 91
4.2.3 Randomized Prim s algorithm 93
4.3 L-Systems 93
4.3.1 Examples 95
4.3.2 City generation 96
4.4 Hierarchical Universe Generation 99
4.5 Summary 101
Exercises 102
5 Tournaments 105
5.1 Rank Adjustment Tournaments 107
5.2 Elimination Tournaments 112
5.3 Scoring Tournaments 119
5.4 Summary 122
Exercises 125
6 Game Trees 129
6.1 Minimax 130
6.1.1 Analysis 132
6.1.2 Partial minimax 134
6.2 Alpha-Beta Pruning 137
6.2.1 Analysis 139
6.2.2 Principal variation search 140
6.3 Monte Carlo Tree Search 142
6.4 Games of Chance 149
6.5 Summary 153
Exercises 153
Contents j vii
7 Path Finding 159
7.1 Discretization of the Game World 160
7.1.1 Grid 160
7.1.2 Navigation mesh 162
7.2 Finding the Minimum Path 164
7.2.1 Evaluation function 165
7.2.2 Properties 165
7.2.3 Algorithm A* 167
7.3 Realizing the Movement 169
7.4 Summary 171
Exercises 171
8 Group Movement 175
8.1 Flocking 175
8.2 Formations 180
8.2.1 Coordinating formations 181
8.2.2 Behaviour-based steering 183
8.2.3 Fuzzy logic control 184
8.2.4 Mass-spring systems 186
8.3 Summary 187
Exercises 187
9 Decision-Making 189
9.1 Background 189
9.1.1 Levels of decision-making 190
9.1.2 Modelled knowledge 191
9.1.3 Methods 192
9.2 Finite State Machines 196
9.2.1 Computational FSM 198
9.2.2 Mealy and Moore machines 202
9.2.3 Implementation 203
9.2.4 Discussion 205
9.3 Influence Maps 208
9.4 Automated Planning 210
9.5 Summary 214
Exercises 215
10 Modelling Uncertainty 221
10.1 Statistical Reasoning 221
10.1.1 Bayes theorem 221
10.1.2 Bayesian networks 223
10.1.3 Dempster-Shafer theory 224
10.2 Fuzzy Sets 227
10.2.1 Membership function 228
10.2.2 Fuzzy operations 229
10.2.3 Defuzzification 231
10.3 Fuzzy Constraint Satisfaction Problem 231
viii | Contents
10.3.1 Modelling the criteria as fuzzy sets 233
10.3.2 Weighting the importance of criteria 235
10.3.3 Aggregating the criteria 235
10.3.4 Making a decision 236
10.4 Summary 238
Exercises 238
Part II Networking 241
11 Communication Layers 243
11.1 Physical Platform 244
11.1.1 Resource limitations 245
11.1.2 Transmission techniques and protocols 246
11.2 Logical Platform 247
11.2.1 Communication architecture 247
11.2.2 Data and control architecture 249
11.3 Networked Application 250
11.4 Summary 251
Exercises 252
12 Compensating Resource Limitations 255
12.1 Aspects of Compensation 256
12.1.1 Consistency and responsiveness 256
12.1.2 Scalability 258
12.2 Protocol Optimization 262
12.2.1 Message compression 262
12.2.2 Message aggregation 263
12.3 Dead Reckoning 263
12.3.1 Prediction 264
12.3.2 Convergence 266
12.4 Local Perception Filters 268
12.4.1 Linear temporal contour 271
12.4.2 Adding bullet time to the delays 275
12.5 Synchronized Simulation 277
12.6 Interest Management 279
12.6.1 Aura-based interest management 279
12.6.2 Zone-based interest management 280
12.6.3 Visibility-based interest management 280
12.6.4 Class-based interest management 281
12.7 Compensation by Game Design 282
12.7.1 Short active turns 283
12.7.2 Semi-autonomous avatars 284
12.7.3 Interaction via proxies 284
12.8 Summary 285
Exercises 286
Contents | ix
13 Cheating Prevention 289
13.1 Technical Exploitations 290
13.1.1 Packet tampering 291
13.1.2 Look-ahead cheating 292
13.1.3 Cracking and other attacks 297
13.2 Collusion 298
13.2.1 Classification 299
13.2.2 Collusion detection 301
13.3 Rule Violations 303
13.4 Summary 304
Exercises 304
14 Online Metrics 307
14.1 Players 310
14.2 Monetization 311
14.3 Acquisition 312
14.4 Game Session 313
14.5 Summary 313
Exercises 314
Appendices 315
A Pseudocode Conventions 317
A.l Changing the Flow of Control 320
A.1.1 Expressions 320
A.1.2 Control structures 322
A.2 Data Structures 325
A.2.1 Values and entities 325
A.2.2 Data collections 326
A.3 Format of Algorithms 330
A.4 Conversion to Existing Programming Languages 332
B Practical Vectors and Matrices 337
B.l Points and Vectors 338
B.2 Matrices 347
B.3 Conclusion 353
Bibliography 357
Ludography 375
Index 377
|
| any_adam_object | 1 |
| author | Smed, Jouni |
| author_facet | Smed, Jouni |
| author_role | aut |
| author_sort | Smed, Jouni |
| author_variant | j s js |
| building | Verbundindex |
| bvnumber | BV044426990 |
| collection | ZDB-35-WIC |
| ctrlnum | (OCoLC)1002261233 (DE-599)BVBBV044426990 |
| dewey-full | 794.8/1526 |
| dewey-hundreds | 700 - The arts |
| dewey-ones | 794 - Indoor games of skill |
| dewey-raw | 794.8/1526 |
| dewey-search | 794.8/1526 |
| dewey-sort | 3794.8 41526 |
| dewey-tens | 790 - Recreational and performing arts |
| discipline | Sport |
| edition | Second edition |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05358nmm a2200601zc 4500</leader><controlfield tag="001">BV044426990</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170726s2017 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781119259770</subfield><subfield code="9">9781119259770</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1119259770</subfield><subfield code="9">1119259770</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781119259763</subfield><subfield code="c">Print</subfield><subfield code="9">9781119259763</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1002/9781119259770</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1002261233</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044426990</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-861</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">794.8/1526</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Smed, Jouni</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and networking for computer games</subfield><subfield code="c">Dr. Jouni Smed, Dr. Harri Hakonen</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ, USA</subfield><subfield code="b">John Wiley & Sons Inc.</subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Algorithms and Networking for Computer Games; Contents; List of Figures; List of Tables; List of Algorithms; Preface; Acknowledgements; 1 Introduction; 1.1 Anatomy of Computer Games; 1.2 Game Development; 1.2.1 Phases of development; 1.2.2 Documentation; 1.2.3 Other considerations; 1.3 Synthetic Players; 1.3.1 Humanness; 1.3.2 Stance; 1.4 Multiplaying; 1.5 Interactive Storytelling; 1.5.1 Approaches; 1.5.2 Storytelling in games; 1.6 Outline of the Book; 1.6.1 Algorithms; 1.6.2 Networking; 1.7 Summary; Exercises; Part I Algorithms; 2 Random Numbers; 2.1 Linear Congruential Method</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">2.1.1 Choice of parameters2.1.2 Testing the randomness; 2.1.3 Using the generators; 2.2 Discrete Finite Distributions; 2.3 Random Shuffling; 2.4 Summary; Exercises; 3 Noise; 3.1 Applying Noise; 3.2 Origin of Noise; 3.3 Visualization; 3.4 Interpolation; 3.4.1 Utility routines for value conversions; 3.4.2 Interpolation in a single parameter; 3.4.3 Interpolation in two parameters; 3.5 Composition of Noise; 3.6 Periodic Noise; 3.7 Perlin Noise; 3.8 Worley Noise; 3.9 Summary; Exercises; 4 Procedural Generation; 4.1 Terrain Generation; 4.2 Maze Algorithms; 4.2.1 Depth-first algorithm</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">4.2.2 Randomized Kruskal's algorithm4.2.3 Randomized Prim's algorithm; 4.3 L-Systems; 4.3.1 Examples; 4.3.2 City generation; 4.4 Hierarchical Universe Generation; 4.5 Summary; Exercises; 5 Tournaments; 5.1 Rank Adjustment Tournaments; 5.2 Elimination Tournaments; 5.3 Scoring Tournaments; 5.4 Summary; Exercises; 6 Game Trees; 6.1 Minimax; 6.1.1 Analysis; 6.1.2 Partial minimax; 6.2 Alpha-Beta Pruning; 6.2.1 Analysis; 6.2.2 Principal variation search; 6.3 Monte Carlo Tree Search; 6.4 Games of Chance; 6.5 Summary; Exercises; 7 Path Finding; 7.1 Discretization of the Game World; 7.1.1 Grid</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">7.1.2 Navigation mesh7.2 Finding the Minimum Path; 7.2.1 Evaluation function; 7.2.2 Properties; 7.2.3 Algorithm A*; 7.3 Realizing the Movement; 7.4 Summary; Exercises; 8 Group Movement; 8.1 Flocking; 8.2 Formations; 8.2.1 Coordinating formations; 8.2.2 Behaviour-based steering; 8.2.3 Fuzzy logic control; 8.2.4 Mass-spring systems; 8.3 Summary; Exercises; 9 Decision-Making; 9.1 Background; 9.1.1 Levels of decision-making; 9.1.2 Modelled knowledge; 9.1.3 Methods; 9.2 Finite State Machines; 9.2.1 Computational FSM; 9.2.2 Mealy and Moore machines; 9.2.3 Implementation; 9.2.4 Discussion</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">9.3 Influence Maps9.4 Automated Planning; 9.5 Summary; Exercises; 10 Modelling Uncertainty; 10.1 Statistical Reasoning; 10.1.1 Bayes' theorem; 10.1.2 Bayesian networks; 10.1.3 Dempster-Shafer theory; 10.2 Fuzzy Sets; 10.2.1 Membership function; 10.2.2 Fuzzy operations; 10.2.3 Defuzzification; 10.3 Fuzzy Constraint Satisfaction Problem; 10.3.1 Modelling the criteria as fuzzy sets; 10.3.2 Weighting the importance of criteria; 10.3.3 Aggregating the criteria; 10.3.4 Making a decision; 10.4 Summary; Exercises; Part II Networking; 11 Communication Layers; 11.1 Physical Platform</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms / fast / (OCoLC)fst00872010</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer games / Programming / fast / (OCoLC)fst00872114</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GAMES / Board / bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer games / Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computerspiel</subfield><subfield code="0">(DE-588)4010457-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computerspiel</subfield><subfield code="0">(DE-588)4010457-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hakonen, Harri</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029828469&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-35-WIC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">UBG_PDA_WIC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029828469</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">FRO_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-35-WIC</subfield><subfield code="q">UBG_PDA_WIC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044426990 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:52:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029828469 |
| oclc_num | 1002261233 |
| open_access_boolean | |
| owner | DE-861 |
| owner_facet | DE-861 |
| physical | 1 online resource |
| psigel | ZDB-35-WIC UBG_PDA_WIC ZDB-35-WIC FRO_PDA_WIC ZDB-35-WIC UBG_PDA_WIC |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | John Wiley & Sons Inc. |
| record_format | marc |
| spelling | Smed, Jouni Verfasser aut Algorithms and networking for computer games Dr. Jouni Smed, Dr. Harri Hakonen Second edition Hoboken, NJ, USA John Wiley & Sons Inc. [2017] 1 online resource txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references and index Algorithms and Networking for Computer Games; Contents; List of Figures; List of Tables; List of Algorithms; Preface; Acknowledgements; 1 Introduction; 1.1 Anatomy of Computer Games; 1.2 Game Development; 1.2.1 Phases of development; 1.2.2 Documentation; 1.2.3 Other considerations; 1.3 Synthetic Players; 1.3.1 Humanness; 1.3.2 Stance; 1.4 Multiplaying; 1.5 Interactive Storytelling; 1.5.1 Approaches; 1.5.2 Storytelling in games; 1.6 Outline of the Book; 1.6.1 Algorithms; 1.6.2 Networking; 1.7 Summary; Exercises; Part I Algorithms; 2 Random Numbers; 2.1 Linear Congruential Method 2.1.1 Choice of parameters2.1.2 Testing the randomness; 2.1.3 Using the generators; 2.2 Discrete Finite Distributions; 2.3 Random Shuffling; 2.4 Summary; Exercises; 3 Noise; 3.1 Applying Noise; 3.2 Origin of Noise; 3.3 Visualization; 3.4 Interpolation; 3.4.1 Utility routines for value conversions; 3.4.2 Interpolation in a single parameter; 3.4.3 Interpolation in two parameters; 3.5 Composition of Noise; 3.6 Periodic Noise; 3.7 Perlin Noise; 3.8 Worley Noise; 3.9 Summary; Exercises; 4 Procedural Generation; 4.1 Terrain Generation; 4.2 Maze Algorithms; 4.2.1 Depth-first algorithm 4.2.2 Randomized Kruskal's algorithm4.2.3 Randomized Prim's algorithm; 4.3 L-Systems; 4.3.1 Examples; 4.3.2 City generation; 4.4 Hierarchical Universe Generation; 4.5 Summary; Exercises; 5 Tournaments; 5.1 Rank Adjustment Tournaments; 5.2 Elimination Tournaments; 5.3 Scoring Tournaments; 5.4 Summary; Exercises; 6 Game Trees; 6.1 Minimax; 6.1.1 Analysis; 6.1.2 Partial minimax; 6.2 Alpha-Beta Pruning; 6.2.1 Analysis; 6.2.2 Principal variation search; 6.3 Monte Carlo Tree Search; 6.4 Games of Chance; 6.5 Summary; Exercises; 7 Path Finding; 7.1 Discretization of the Game World; 7.1.1 Grid 7.1.2 Navigation mesh7.2 Finding the Minimum Path; 7.2.1 Evaluation function; 7.2.2 Properties; 7.2.3 Algorithm A*; 7.3 Realizing the Movement; 7.4 Summary; Exercises; 8 Group Movement; 8.1 Flocking; 8.2 Formations; 8.2.1 Coordinating formations; 8.2.2 Behaviour-based steering; 8.2.3 Fuzzy logic control; 8.2.4 Mass-spring systems; 8.3 Summary; Exercises; 9 Decision-Making; 9.1 Background; 9.1.1 Levels of decision-making; 9.1.2 Modelled knowledge; 9.1.3 Methods; 9.2 Finite State Machines; 9.2.1 Computational FSM; 9.2.2 Mealy and Moore machines; 9.2.3 Implementation; 9.2.4 Discussion 9.3 Influence Maps9.4 Automated Planning; 9.5 Summary; Exercises; 10 Modelling Uncertainty; 10.1 Statistical Reasoning; 10.1.1 Bayes' theorem; 10.1.2 Bayesian networks; 10.1.3 Dempster-Shafer theory; 10.2 Fuzzy Sets; 10.2.1 Membership function; 10.2.2 Fuzzy operations; 10.2.3 Defuzzification; 10.3 Fuzzy Constraint Satisfaction Problem; 10.3.1 Modelling the criteria as fuzzy sets; 10.3.2 Weighting the importance of criteria; 10.3.3 Aggregating the criteria; 10.3.4 Making a decision; 10.4 Summary; Exercises; Part II Networking; 11 Communication Layers; 11.1 Physical Platform Computer algorithms / fast / (OCoLC)fst00872010 Computer games / Programming / fast / (OCoLC)fst00872114 GAMES / Board / bisacsh Computer games / Programming Computer algorithms Computerspiel (DE-588)4010457-6 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf Computerspiel (DE-588)4010457-6 s Programmierung (DE-588)4076370-5 s 1\p DE-604 Hakonen, Harri Sonstige oth https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770 Verlag URL des Erstveröffentlichers Volltext HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029828469&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Smed, Jouni Algorithms and networking for computer games Computer algorithms / fast / (OCoLC)fst00872010 Computer games / Programming / fast / (OCoLC)fst00872114 GAMES / Board / bisacsh Computer games / Programming Computer algorithms Computerspiel (DE-588)4010457-6 gnd Programmierung (DE-588)4076370-5 gnd |
| subject_GND | (DE-588)4010457-6 (DE-588)4076370-5 |
| title | Algorithms and networking for computer games |
| title_auth | Algorithms and networking for computer games |
| title_exact_search | Algorithms and networking for computer games |
| title_full | Algorithms and networking for computer games Dr. Jouni Smed, Dr. Harri Hakonen |
| title_fullStr | Algorithms and networking for computer games Dr. Jouni Smed, Dr. Harri Hakonen |
| title_full_unstemmed | Algorithms and networking for computer games Dr. Jouni Smed, Dr. Harri Hakonen |
| title_short | Algorithms and networking for computer games |
| title_sort | algorithms and networking for computer games |
| topic | Computer algorithms / fast / (OCoLC)fst00872010 Computer games / Programming / fast / (OCoLC)fst00872114 GAMES / Board / bisacsh Computer games / Programming Computer algorithms Computerspiel (DE-588)4010457-6 gnd Programmierung (DE-588)4076370-5 gnd |
| topic_facet | Computer algorithms / fast / (OCoLC)fst00872010 Computer games / Programming / fast / (OCoLC)fst00872114 GAMES / Board / bisacsh Computer games / Programming Computer algorithms Computerspiel Programmierung |
| url | https://onlinelibrary.wiley.com/doi/book/10.1002/9781119259770 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=029828469&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT smedjouni algorithmsandnetworkingforcomputergames AT hakonenharri algorithmsandnetworkingforcomputergames |