Algorithms and Networking for Computer Games

Algorithms and Networking for Computer Games

Volumn , Issue , 2006, Pages 1-264

  Smed, Jouni ^a   Hakonen, Harri ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40749131992     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0470029757     Document Type: Book

References (164)

1. Abramson B 1989 Control strategies for two-player games. ACM Computing Surveys 21(2), 137-161.
2. Albers S and Mitzenmacher M 1998 Average case analyses of list update algorithms, with applications to data compression. Algorithmica 21(3), 312-329.
3. Aldous D and Diaconis P 1986 Shuffling cards and stopping times. American Mathematical Monthly 93(5), 333-348.
4. Alexander T 2002 GoCap: Game observation capture. In AI Game Programming Wisdom (ed. Rabin S), pp. 579-589. Charles River Media, Hingham, MA, USA.
5. Aylett R and Louchart S 2003 Towards a narrative theory of virtual reality. Virtual Reality 7(1), 2-9.
6. Bachrach R and El-Yaniv R 1997 Online list accessing algorithms and their applications: Recent empirical evidence. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), pp. 53-62. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
7. Ballard BW 1983 The ×-minimax search procedure for trees containing chance nodes. Artificial Intelligence 21(3), 327-350.
8. Bartle R 1990 Interactive multi-user computer games. Technical report, British Telecom. http://www.mud.co.uk/richard/imucg.htm.
9. Baughman NE and Levine BN 2001 Cheat-proof playout for centralized and distributed online games. Proceedings of the Twentieth IEEE Computer and Communication Society INFOCOM Conference, Anchorage, AK, USA.
10. Bayer D and Diaconis P 1992 Trailing the dovetail shuffle to its lair. Annals of Applied Probability 2(2), 294-313.
11. Bellman RE and Zadeh LA 1970 Decision-making in a fuzzy environment. Management Science 17(4), 141-164.
12. Benford S, Bowers J, Fahlén LE, Mariani J and Rodden T 1994 Supporting cooperative work in virtual environments. Computer Journal 37(8), 653-668.
13. Benford S, Greenhalgh C, Reynard G, Brown C and Koleva B 1998 Understanding and constructing shared spaces with mixed-reality boundaries. ACM Transactions on Computer-Human Interaction 5(3), 185-223.
14. Benford S, Greenhalgh C, Rodden T and Pycock J 2001 Collaborative virtual environments. Communications of the ACM 44(7), 79-85.
15. Berglund EJ and Cheriton DR 1985 Amaze: A multiplayer computer game. IEEE Software 2(3), 30-39.
16. Bettner P and Terrano M 2001 1500 archers on a 28.8: Network programming in Age of Empires and beyond. Gamasutra. http://www.gamasutra.com/features/20010322/terrano 01.htm.
17. Box GEP and Muller ME 1958 A note on the generation of random normal deviates. The Annals of Mathematical Statistics 29(2), 610-611.
18. Bratley P, Fox BL and Schrage LE 1983 A Guide to Simulation. Springer-Verlag, New York, USA.
19. Bringsjord S 2001 Is it possible to build dramatically compelling interactive digital entertainment? Game Studies 1(1). http://www.gamestudies.org/0101/bringsjord/.
20. Buschmann F, Meunier R, Rohnert H, Sommerland P and Stal M 1996 Pattern-Oriented Software Architecture: A System of Patterns, vol. 1 of Software Design Patterns. John Wiley & Sons, West Sussex, UK.
21. Cai W, Lee FBS and Chen L 1999 An auto-adaptive dead reckoning algorithm for distributed interactive simulation. Proceedings of the Thirteenth Workshop on Parallel and Distributed Simulation, pp. 82-89, Atlanta, GA, USA.
22. Castronova E 2001 Virtual worlds: A first-hand account of market and society on the cyberian frontier. CESifo Working Paper Series No. 618. http://ssrn.com/abstract=294828.
23. Chang YI 1996 A simulation study on distributed mutual exclusion. Journal of Parallel and Distributed Computing 33(2), 107-121.
24. Charles F, Mead SJ and Cavazza M 2002 Generating dynamic storylines through characters' interactions. International Journal of Intelligent Games & Simulation 1(1), 5-11.
25. Chazelle B 1991 Triangulating a simple polygon in linear time. Discrete & Computational Geometry 6(5), 485-524.
26. Cormen TH, Leiserson CE, Rivest RL and Stein C 2001 Introduction to Algorithms, second edn. MIT Press, Cambridge, MA, USA.
27. Costikyan G 2002 I have no words & I must design: Toward a critical vocabulary for games. In Computer Games and Digital Cultures Conference Proceedings (ed. Mäyrä F), pp. 9-33, Tampere University Press, Tampere, Finland.
28. Crawford C 1984 The Art of Computer Game Design. Osborne/McGraw-Hill, Berkeley, CA, USA. http://www.vancouver.wsu.edu/fac/peabody/game-book/Coverpage.html.
29. Cronin E, Filstrup B and Jamin S 2003 Cheat-proofing dead reckoned multiplayer games. In Proceedings of the 2nd International Conference on Application and Development of Computer Games (eds. Sing LW, Man WH and Wai W), pp. 23-29. Hong Kong SAR, China.
30. Dahl OJ, Dijkstra EW and Hoare CAR 1972 Structured Programming, number 8 in A.P.I.C. Studies in Data Processing. Academic Press, London, UK.
31. Defense Advanced Research Projects Agency 1981 Internet protocol Internet RFC 791. http://www.faqs.org/rfcs/rfc791.html.
32. Dewdney AK 1984 Computer recreations: In the game called Core War hostile programs engage in a battle of bits. Scientific American 250(5), 14-22.
33. Dijkstra EW 1968 Letters to the editor: Go to statement considered harmful. Communications of the ACM 11(3), 147-148.
34. Diot C and Gautier L 1999 A distributed architecture for multiplayer interactive applications on the Internet. IEEE Networks Magazine 13(4), 6-15.
35. Dubois D, Fargier H and Prade H 1996 Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty. Applied Intelligence 6, 287-309.
36. Dybsand E 2004 GDC 2004 AI Roundtables Moderator Report. http://www.gameai.com/cgdc04notes.dybsand.html.
37. Encyclopædia Britannica 2005 Game Encyclopædia Britannica Online. http://search.eb.com/eb/article-9035963.
38. Entacher K 1999 Parallel streams of linear random numbers in the spectral test. ACM Transactions on Modeling and Computer Simulation 9(1), 31-44.
39. Evans R 2002 Varieties of learning. In AI Game Programming Wisdom (ed. Rabin S), pp. 567-578. Charles River Media Hingham, MA, USA.
40. Fairclough C and Cunningham P 2002 An interactive story engine. In Proceedings of the 13th Irish International Conference on Artificial Intelligence and Cognitive Science (eds. O'Neill M, Sutcliffe RFE, Ryan C, Eaton M and Griffith NJL), vol. 2464 of Lecture Notes in Artificial Intelligence, pp. 171-176. Springer-Verlag, Limerick, Ireland.
41. Federation Internationale de Football Association 2003 Laws of the Game. http://www.fifa.com/ref/laws E.html.
42. Finkel RA and Fishburn JP 1982 Parallelism in alpha-beta search. Artificial Intelligence 19(1), 89-106.
43. Fishburn JP 1983 Another optimization of alpha-beta search. ACM SIGART Bulletin 84, 37-38.
44. Fournier A, Fussell D and Carpenter L 1982 Computer rendering of stochastic models. Communications of the ACM 26(6), 371-384.
45. Frécon E and Stenius M 1998 DIVE: A scaleable network architecture for distributed virtual environments. Distributed Systems Engineering 5(3), 91-100.
46. Freeman JA and Skapura DM 1991 Neural Networks: Algorithms, Applications, and Programming Techniques. Addison-Wesley, Redwood City, CA, USA.
47. Fullér R and Carlsson C 1996 Fuzzy multiple criteria decision making: Recent developments. Fuzzy Sets and Systems 78, 139-153.
48. Game Developers' Association of Australia 2003 Game Industry Fact Sheet. http://www.gdaa.asn.au/about/gdaaindustryfactsheetoct2003.pdf.
49. Gamma E, Helm R, Johnson R and Vlissides J 1995 Design Patterns: Elements of Reusable Object-Oriented Software, Addison-Wesley Professional Computing Series. Addison-Wesley, Reading, MA, USA.
50. Glover F 1989 Tabu search-part I. ORSA Journal of Computing 1(3), 190-206.
51. Goldberg DE 1989 Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, USA.
52. Graetz JM 1981 The origin of Spacewar. Creative Computing pp. 56-67. http://www.wheels.org/ spacewar/creative/SpacewarOrigin.html.
53. Greenhalgh C 1998 Awareness-based communication management in the MASSIVE systems. Distributed Systems Engineering 5(3), 129-137.
54. Guesgen HW 1994 A formal framework for weak constraint satisfaction based on fuzzy sets. Proceedings of ANZIIS-94, pp. 199-203, Brisbane, Australia.
55. Gustafson JL 1988 Reevaluating Amdahl's law. Communications of the ACM 31(5), 532-533.
56. Hakonen H, Leppänen V and Salakoski T 2000 Object integrity while allowing aliasing. In Proceedings of Conference on Software: Theory and Practice (eds. Feng Y, Notkin D and Gaudel MC), pp. 91-96, 16th IFIP WCC2000, Publishing House of Electronics Industry, Beijing, China.
57. Harel D 1987 Algorithmics: The Spirit of Computing. Addison-Wesley, Wokingham, UK.
58. Hauk T, Buro M and Schaeffer J 2005 Rediscovering ×-minimax search. Proceedings of the Fourth International Conference on Computers and Games, Forthcoming in Lecture Notes in Computer Science. Springer-Verlag.
59. Hellekalek P 1998 Good random number generators are (not so) easy to find. Mathematics and Computers in Simulation 46(5-6), 485-505.
60. Herrera F and Verdegay JL 1997 Fuzzy sets and operations research. Perspectives. Fuzzy Sets and Systems 90, 207-218.
61. Hertel S and Mehlhorn K 1985 Fast triangulation of the plane with respect to simple polygons. Information and Control 64(1-3), 52-76.
62. Higgins D 2002 Pathfinding design architectur. In AI Game Programming Wisdom (ed. Rabin S), pp. 122-132. Charles River Media, Hingham, MA, USA, Hudak P 1989 Conception, evolution, and application of functional programming languages. ACM Computing Surveys 21(3), 359-411.
63. Huizinga J 1955 Homo Ludens: A Study of the Play-Element in Culture. The Beacon Press, Boston, MA, USA.
64. Intel Platform Security Division 1999 Intel Random Number Generator. Intel Corporation.
65. International Game Developers Association 2003 IGDA Curriculum Framework: The Study of Games and Game Development. http://www.igda.org/academia/IGDA Curriculum Framework Feb03.pdf.
66. International Game Developers Association 2004 Foundations of Interactive Storytelling. http://www.igda.org/writing/InteractiveStorytelling.htm.
67. Jensen K, Wirth N, Mickel AB and Miner JF 1985 Pascal-User Manual and Report, third edn. Springer-Verlag, New York, NY, USA.
68. Johansson U, Sönströd C and König R 2003 Cheating by sharing information - the doom of online poker? In Proceedings of the 2nd International Conference on Application and Development of Computer Games (eds. Sing LW, Man WH and Wai W), pp. 16-22. Hong Kong SAR, China.
69. Johnson G 2003 Avoiding dynamic obstacles and hazards. In AI Game Programming Wisdom 2 (ed. Rabin S), pp. 161-170. Charles River Media, Hingham, MA, USA.
70. Kaukoranta T, Smed J and Hakonen H 2003 Understanding pattern recognition methods. In AI Game Programming Wisdom 2 (ed. Rabin S), pp. 579-589. Charles River Media, Hingham, MA, USA.
71. Keil JM 1985 Decomposing a polygon into simpler components. SIAM Journal on Computing 14(4), 799-817.
72. Kelley AD, Malin MC and Nielson GM 1988 Terrain simulation using a model of stream erosion. Computer Graphics 22(4), 263-268.
73. Kennedy J, Eberhart RC and Shi Y 2001 Swarm Intelligence. Morgan Kaufmann, San Francisco, CA, USA.
74. Kimppa KK and Bissett A 2005 Is cheating in network computer games a question worth raising? In Ethics of New Information Technology: Proceedings of the Sixth International Conference of Computer Ethics (eds. Brey P, Grodzinsky F and Introna L), pp. 261-267. Center for Telematics and Information Technology (CTIT), Enschede, The Netherlands.
75. Kirkpatrick S, Gelatt CD and Vecchi MP 1983 Optimization by simulated annealing. Science 220(4598), 671-680.
76. Kirmse A 2000 A network protocol for online games. In Game Programming Gems (ed. DeLoura M), pp. 104-108. Charles River Media, Hingham, MA, USA.
77. Kirmse A and Kirmse C 1997 Security in online games. Game Developer 4(4), 20-28.
78. Knuth DE 1998a Fundamental Algorithms, vol. 1 of The Art of Computer Programming, third edn. Addison-Wesley, Reading, MA, USA.
79. Knuth DE 1998b Seminumerical Algorithms, vol. 2 of The Art of Computer Programming, third edn. Addison-Wesley, Reading, MA, USA.
80. Knuth DE 1998c Sorting and Searching, vol. 3 of The Art of Computer Programming, second edn. Addison-Wesley, Reading, MA, USA.
81. Knuth DE 2005 Combinatorial Algorithms: Graph and Network Algorithms, vol. 4B of The Art of Computer Programming. Pre-fascicle. http://www-cs-faculty.stanford.edu/knuth/taocp.html.
82. Knuth DE and Moore RW 1975 An analysis of alpha-beta pruning. Artificial Intelligence 6(4), 293-326.
83. Kohonen T 1995 Self-Organizing Maps. Springer-Verlag, Berlin, Germany.
84. Krasner GE and Pope ST 1988 A cookbook for using the model-view-controller user interface paradigm in Smalltalk-80. Journal of Object-Oriented Programming 1(3), 26-49.
85. Kronmal RA and Peterson AV 1979 The alias and alias-rejection-mixture methods for generating random variables from probability distributions. Proceedings of the 11th Conference on Winter Simulation (WSC'79), vol. 1, pp. 269-280. IEEE Press, Piscataway, NJ, USA.
86. Lamport L and Lynch N 1990 Distributed computing: Models and methods. In Handbook of Theoretical Computer Science (ed. van Leeuwen J), vol. B: Formal Models and Semantics, pp. 1157-1199. Elsevier, Amsterdam, The Netherlands.
87. Lecky-Thompson GW 1999 Algorithms for infinite universe. Gamasutra. http://www.gamasutra. com/features/19990917/infinite 01.htm.
88. L'Ecuyer P 1988 Efficient and portable combined random number generators. Communications of the ACM 31(6), 742-749,774.
89. L'Ecuyer P 1999 Tables of linear congruential generators of different sizes and good lattice structure. Mathematics of Computation 68(225), 249-260.
90. L'Ecuyer P, Blouin F and Couture R 1993 A search for good multiple recursive random number generators. ACM Transactions on Modeling and Computer Simulation 3(2), 87-98.
91. L'Ecuyer P and Ĉoté S 1991 Implementing a random number package with splitting facilities. ACM Transactions on Mathematical Software 17(1), 98-111.
92. Lee H, Kozlowski E, Lenker S and Jamin S 2002 Multiplayer game cheating prevention with pipelined lockstep protocol. In Entertainment Computing: Technologies and Applications, IFIP First International Workshop on Entertainment Computing (eds. Nakatsu R and Hoshino J), pp. 31-39. Kluwer, Makuhari, Japan.
93. Lewis JP 1987 Generalized stochastic subdivision. ACM Transactions on Graphics 6(3), 167-190.
94. Lewis PA, Goodman AS and Miller JM 1969 A pseudo-random number generator for the System/360. IBM Systems Journal 8(2), 136-146.
95. Lindley CA and Eladhari M 2002 Causal normalization: A methodology for coherent story logic design in computer role-playing games. In Proceedings of the Third International Conference on Computers and Games (eds. Schaeffer J, Müller M and Björnsson Y), vol. 2883 of Lecture Notes in Computer Science, pp. 292-307. Springer-Verlag, Edmonton, Canada.
96. Mackenzie D 2002 The mathematics of shuffling: The Stanford flip. Discover 23(10), 22-23. http://www.discover.com/oct 02/featmath.html.
97. Marsland TA and Campbell M 1982 Parallel search of strongly ordered game trees. ACM Computing Surveys 14(4), 533-551.
98. Matias Y, Vitter JS and Ni WC 1993 Dynamic generation of discrete random variates. Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pp. 361-370. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA.
99. McLeod AI 1985 Remark AS R58: A remark on algorithm AS 183. An efficient and portable pseudorandom number generato. Applied Statistics 34(2), 198-200.
100. Meyer B 1997 Object-Oriented Software Construction, second edn. Prentice Hall, Upper Saddle River, NJ, USA.
101. Michie D 1966 Game-playing and game-learning automata. In Advances in Programming and Non-Numerical Computation (ed. Fox L), pp. 183-200. Pergamon Press, Oxford, UK.
102. Miller GSP 1986 The definition and rendering of terrain maps. Computer Graphics 20(4), 39-48.
103. Morse KL, Bic L and Dillencourt M 2000 Interest management in large-scale virtual environments. Presence 9(1), 52-68.
104. Murdoch SJ and Zielínski P 2004 Covert channels for collusion in online computer games. In Information Hiding: 6th InternationalWorkshop (ed. Fridrich J), vol. 3200 of Lecture Notes in Computer Science, pp. 355-369. Springer-Verlag, Toronto, Canada.
105. Neyland DL 1997 Virtual Combat: A Guide to Distributed Interactive Simulation. Stackpole Books, Mechanicsburg, PA, USA.
106. Object Management Group 2005 Unified Modeling Language: Superstructure, Version 2.0. Formal/05-07-04. http://www.uml.org.
107. Park KS and Kenyon RV 1999 Effects of network characteristics on human performance in a collaborative virtual environment. Proceedings of IEEE International Conference on Virtual Reality, Houston, TX, USA.
108. Park SK and Miller KW 1988 Random number generators: Good ones are hard to find. Communications of the ACM 31(10), 1192-1201.
109. Patel AJ 2003 Amit's thoughts on Path-Finding. http://theory.stanford.edu/amitp/GameProgramming/.
110. Pearl J 1986 Fusion, propagation, and structuring in belief networks. Artificial Intelligence 29(3), 241-364.
111. Peinado F and Gervás P 2004 Transferring game mastering laws to interactive digital storytelling. In Technologies for Interactive Digital Storytelling and Entertainment (eds. Göbel S, Spierling U, Hoffman A, Iurgel I, Schneider O, Dechau J and Feix A), vol. 3105 of Lecture Notes in Computer Science, pp. 48-54. Springer-Verlag, Darmstadt, Germany.
112. Perlin K 1985 An image synthesizer. Computer Graphics 19(3), 287-296.
113. Pottinger DC 2000 Terrain analysis in realtime strategy games. 2000 Game Developer Conference Proceedings, San Jose, CA, USA. http://www.gdconf.com/archives/2000/pottinger.doc.
114. Pritchard M 2000 How to hurt hackers: The scoop on Internet cheating and how you can combat it. Gamasutra. http://www.gamasutra.com/features/20000724/pritchard 01.htm.
115. Propp V 1968 Morphology of the Folktale. University of Texas Press, Austin, TX, USA.
116. Rabiner LR and Juang BH 1986 An introduction to hidden Markov models. IEEE Acoustics, Speech, and Signal Processing Magazine 3(1), 4-16.
117. Reynolds CW 1987 Flocks, herds, and schools: A distributed behavioral model. Computer Graphics 21(4), 25-34.
118. Rivest R 1992 The MD5 Message Digest Algorithm Internet RFC 1321. http://theory.lcs.mit.edu/rivest/Rivest-MD5.txt.
119. Ryan MD and Sharkey PM 1999 The causal surface and its effect on distribution transparency in a distributed virtual environment. Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, vol. 6, pp. 75-80, Tokyo, Japan.
120. Salen K and Zimmerman E 2004 Rules of Play: Game Design Fundamentals. MIT Press, Cambridge, MA, USA.
121. Samuel AL 1959 Some studies in machine learning using the game of checkers. IBM Journal of Research and Development 3(3), 210-229. Reprinted in IBM Journal of Research and Development 44(1/2), 206-226, 2000.
122. Samuel AL 1967 Some studies in machine learning using the game of checkers. II-recent progress. IBM Journal of Research and Development 11(6), 601-617.
123. Sanderson D 1999 Online justice systems. Game Developer 6(4), 42-49.
124. Schmidt D, Stal M, Rohnert H and Buschmann F 2000 Pattern-Oriented Software Architecture: Patterns for Concurrent and Networked Objects vol. 2 of Software Design Patterns. John Wiley & Sons, West Sussex, UK.
125. Sedgewick R 1977 Permutation generation methods. Computing Surveys 9(2), 137-164.
126. Seidel R 1991 A simple and fast incremental randomized algorithms for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry 1(1), 51-64.
127. Shafer G 1990 Perspectives on the theory and practice of belief functions. International Journal of Approximate Reasoning 4(5-6), 323-362.
128. Sharkey PM, Ryan MD and Roberts DJ 1998 A local perception filter for distributed virtual environments. Proceedings of IEEE Virtual Reality Annual International Symposium, pp. 242-249, Atlanta, GA, USA.
129. Shirmohammadi S and Georganas ND 2001 An end-to-end communication architecture for collaborative virtual environments. Computer Networks 35(2-3), 351-367.
130. Siira A 2004 Automatic commentators, Master's thesis, University of Turku, Department of Information Technology, Turku, Finland.
131. Singhal SK 1996 Effective Remote Modeling in Large-Scale Distributed Simulation and Visualization Environments, PhD thesis, Standford University, Standford, CA, USA.
132. Singhal SK and Zyda MJ 1999 Networked Virtual Environments: Design and Implementation. Addison Wesley, Reading, MA, USA.
133. Slany W 1994 Fuzzy Scheduling, PhD thesis, Technische Universität Wien, Vienna, Austria. CDTechnical Report 94/66.
134. Slany W 1995 Comparing partial constraint satisfaction models. Workshop Notes of the CP'95 Workshop on Over-Constraint Systems, pp. 151-159, Cassis, France.
135. Smed J and Hakonen H 2003 Towards a definition of a computer game. Technical Report 553, Turku Centre for Computer Science, Turku, Finland.
136. Smed J and Hakonen H 2005a Preventing look-ahead cheating with active objects. Proceedings of the Fourth International Conference on Computers and Games, Forthcoming in Lecture Notes in Computer Science. Springer-Verlag.
137. Smed J and Hakonen H 2005b Synthetic players: A quest for artificial intelligence in computer games. Human IT 7(3), 57-77.
138. Smed J, Kaukoranta T and Hakonen H 2002 Aspects of networking in multiplayer computer games. The Electronic Library 20(2), 87-97.
139. Smed J, Kaukoranta T and Hakonen H 2003 Networking and multiplayer computer games-the story so far. International Journal of Intelligent Games & Simulation 2(2), 101-110.
140. Smed J, Niinisalo H and Hakonen H 2005 Realizing the bullet time effect in multiplayer games with local perception filters. Computer Networks 49(1), 27-37.
141. Snook G 2000 Simplified 3D movement and pathfinding using navigation meshes. In Game Programming Gems (ed. DeLoura M), pp. 288-304. Charles River Media, Hingham, MA, USA.
142. Spierling U 2002 Editorial: Digital storytelling. Computers & Graphics 26(1), 1-2.
143. Spierling U, Grasbon D, Braun N and Iurgel I 2002 Setting the scene: Playing digital director in interactive storytelling and creation. Computers & Graphics 26(1), 31-44.
144. Street G, Petersen S and Kidd M 2001 How to balance a real time strategy game: Lessons from the Age of Empires series. http://www.gdconf.com/archives/2001/gstreetprintable3.ppt.
145. Tozour P 2003 Search space representations. In AI Game Programming Wisdom 2 (ed. Rabin S), pp. 85-102. Charles River Media, Hingham, MA, USA.
146. van der Sterren W 2003 Path look-up tables-small is beautiful. In AI Game Programming Wisdom 2 (ed. Rabin S), pp. 115-129. Charles River Media, Hingham, MA, USA.
147. Verna D, Fabre Y and Pitel G 2000 Urbi et Orbi: Unusual design and implementation choices for distributed virtual environments. In VSMM 2000: Sixth International Conference on Virtual Systems and Multimedia (ed. Thwaites H), pp. 714-724. IOS Press, Amsterdam, The Netherlands, Gifu, Japan.
148. Wang X and Yu H 2005 How to break MD5 and other hash functions. In Advances in Cryptology-EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques (ed. Cramer R), vol. 3494 of Lecture Notes in Artificial Intelligence, pp. 19-25. Springer-Verlag, Aarhus, Denmark.
149. Watt A 2000 3D Computer Graphics, third edn. Addison-Wesley, Harlow, UK.
150. Wichmann BA and Hill ID 1982 Algorithm AS 183: An efficient and portable pseudo-random number generator. Applied Statistics 31(2), 188-190. See also McLeod (1985); Wichmann and Hill (1984); Zeisel (1986).
151. Wichmann BA and Hill ID 1984 Correction: Algorithm AS 183: An efficient and portable pseudorandom number generator. Applied Statistics 33(1), 123.
152. Witten IH, Moffat A and Bell TC 1999 Managing Gigabytes: Compressing and Indexing Documents and Images, second edn. Morgan Kaufmann, San Francisco, CA, USA.
153. Woodcock S 2002 Recognizing strategic dispositions: Engaging the enemy. In AI Game Programming Wisdom (ed. Rabin S), pp. 221-232. Charles River Media, Hingham, MA, USA.
154. Wu J and Sheng L 2001 An efficient sorting algorithm for a sequence of kings in a tournament. Information Processing Letters 79(6), 297-299.
155. Yager RR 1981 A new methodology for ordinal multiobjective decisions based on fuzzy sets. Decision Sciences 12, 589-600.
156. Yager RR 1988 On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Transactions on Systems, Man, and Cybernetics 18(1), 183-190.
157. Yager RR and Filev DP 1994 Essentials of Fuzzy Modeling and Control. John Wiley & Sons, New York, NY, USA.
158. Yan J 2003 Security design in online games. Proceedings of the 19th Annual Computer Security Applications Conference (ACSAC'03), pp. 286-297, Las Vegas, NV, USA.
159. Yan JJ and Choi HJ 2002 Security issues in online games. The Electronic Library 20(2), 125-133.
160. Yob G 1975 Hunt the Wumpus. Creative Computing 1(5), 51-54. http://atariarchives.planetmirror.com/bcc1/showpage.php?page=247.
161. Yu SJ and Choy YC 2001 A dynamic message filtering technique for 3D cyberspaces. Computer Communications 24(18), 1745-1758.
162. Zadeh LA 1965 Fuzzy sets. Information and Control 8(3), 338-353.
163. Zeisel H 1986 Remark ASR61: A remark on algorithm AS 183. An efficient and portable pseudorandom number generator. Applied Statistics 35(1), 89.
164. Zobrist AL 1969 A model of visual organization for the game of Go. Proceedings of AFIPS Spring Joint Computer Conference, pp. 103-112, Boston, MA, USA.