CHAPTER 7 BIBLIOGRAPHY
|
|
- Ilene Atkins
- 5 years ago
- Views:
Transcription
1 CHAPTER 7 BIBLIOGRAPHY 1. Ian Millington and John Funge, Artificial Intelligence for Games, Second Edition, 2. De Voogt A, A classification of board games, New Approaches to Board Game Research : Asian origins and Future Perspectives 3. Cameron Browne, Automatic Generation and Evaluation of Recombination Games, Ph D thesis E de Groote, Machine learning in Go- Supervised learning of move prediction, Thesis March T. Srinivasan, P.J.S. Srikanth, K. Praveen and L. Harish Subramaniam, AI Game Playing Approach for Fast Processor Allocation in Hypercube Systems using Veitch diagram (AIPA), IADIS International Conference on Applied Computing 2005, vol. 1, Feb. 2005, pp Brian Rose, Othello A minute to learn A life time to master A book registered to Anjar Co, Julian Togelius, Optimization, Imitation and Innovation: Computational Intelligence and Games, Ph D Thesis September Raph Koster, A theory of fun for game design, Paraglyph press, Thomas W. Malone, What makes things fun to learn? heuristics for designing instructional computer games, In Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems, pages , Monroe Newborn, Kasparov Vs. Deep Blue: Computer Chess Comes of Age, Springer, 1997.
2 Bibliography Jonathan Schaeffer, Joseph Culberson, Norman Treloar, Brent Knight, Paul Lu, and Duane Szafron, A world championship caliber checkers program, Artificial Intelligence, 53(2 3): , Michael Buro, The evolution of strong othello programs, In Entertainment Computing - Technology and Applications, pages Kluwer, David E. Moriarty and Risto Miikkulainen, Discovering complex Othello strategies through evolutionary neural networks, Connection Science, 7(2): , Michael Buro, Improving heuristic mini-max search by supervised learning 15. Thomas Robert Lincke, Exploring the Computational Limits of Large Exhaustive Search Problems, Ph D Thesis, Jing Yang, Simon Liao, and Mirek Pawlak, A Decomposition Method for Finding Solution in Game Hex 7x7, International Conference On Application and Development of Computer Games in the 21st Century, pages , Jing Yang, Simon Liao, and Mirek Pawlak, A New Solution for 7x7 Hex Game to appear, L. Victor Allis, Searching for Solutions in Games and Artificial Intelligence, Ph D thesis, University of Limburg, Maastricht, The Netherlands, Marco Kunze, Sebastian Nowozin, An AI for Gomoku/Wuziqi and more Erik van der Werf, AI techniques for the game of GO Ph D thesis, January E. A. Heinz, Scalable Search in Computer Chess, Vieweg Verlag, Braunschweig, Germany, D. J. C. MacKay. Information Theory, Inference and Learning Algorithms. Cambridge University Press, Cambridge, UK, A. Junghanns and J. Schaeffer, Search versus knowledge in game-playing programs revisited, In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages Morgan Kaufmann, San Francisco, CA, J. Schaeffer, Experiments in Search and Knowledge, Ph.D. thesis, Department of Computing Science, University of Waterloo, Waterloo, Canada, Stuart Russel & Peter Norvig, Artificial Intelligence A modern Approach Second Edition
3 Bibliography Andrea Schalk, AI and Games Part 1: The Theory of Games, September Fogel, D., Hays, T., Hahn, S., Quon, J, A self-learning evolutionary chess program, Proceedings of the IEEE 92 (2004) 27. Holland, J. H., Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence, Ann Arbor, MI: University of Michigan Press. 28. Goldberg, D. E, Genetic Algorithms in Search, Optimization and Machine Learning Reading, MA: Addison-Wesley. 29. Randy L Haupt & Sue Ellen Haupt, Practical Genetic Algorithms, Second Edition, John Willey & Sons 30. Dorigo M and G. Maria, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Trans. Evolv. Comput. 1: Holland, J. H, Genetic Algorithms Sci. Am. 267: Man, K. F., Tang, K. S., Kwong, S., and Halang, W. A, Genetic Algorithms: Concepts and Designs Springer-Verlag. 33. Mitchell, Melanie. An Introduction to Genetic Algorithms MA: The MIT Press 34. Stender, Joachim, Hillebrand, and Kingdon, J. Genetic Algorithms in Optimization, Simulation, and Modeling, Amsterdam: IOS Publishing. 35. Coley, David A., An introduction to Genetic Algorithms for Scientists and Engineers, Singapore: World Scientific 36. Kennedy J and R. C. Eberhart, Swarm Intelligence, San Fransisco: Moragan Kaufmann 37. Kennedy J and R. C Eberhart, Particle Swarm Optimization, Proc. IEEE Int. Conf. on Neural networks IV, NJ: IEEE Service center, pp Rosenbloom, P, A world championship level Othello program, Artificial Intelligence, 19: Billman, D., and Shaman, D, Strategy knowledge and strategy change in skilled performance: A study of the game Othello, American Journal of Psychology, 103: Koza, John R. Genetic Programming: On the Programming of Computers by Means of Natural Selection, Cambridge, MA: The MIT Press.
4 Bibliography Langdon, William B. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! Amsterdam: Kluwer Academic Publishers. 42. Radha Shankarmani, Saurabh Jain & Gaurang Sinha, Game Architecture and Programming,Wiley India Pvt. Ltd., website Buyya, Selvi & Chu, Object Oriented Programming with Java essentials and applications, McGrawHill 45. Blaha & Rambuagh, Object oriented modeling & Design with UML Pearson, Second Edition 46. Scott Oaks & Henry Wong, Java Threads, O reilly 47. Ralph Morelli & Ralph Walde, Java, Java, Java : Object-Oriented Problem Solving, Prentice Hall 48. Ting Qian, Using Genetic Algorithm to Solve Sliding Tile Puzzles 49. Thomas Weise., Global Optimization Algorithms Theory and Application, Jorg Heitkotter and David Beasley, Hitch-Hiker s Guide to Evolutionary Computation: A List of Frequently Asked Questions (FAQ), ENCORE (The EvolutioNary Computation REpository Network), USENET 51. Agostinho Rosa, Solving Puzzles and Games by Evolutionary Algorithms, Carlos Artemio and Ceollo Coello, A comprehensive survey of evolutionary based multiobjective optimization techniques, Knowledge and Information Systems, 1(3): , August Carlos Artemio and Ceollo Coello, An updated survey of evolutionary multiobjective optimization techniques: State of the art and future trends, In 1999 Congress on Evolutionary Computation, pages 3 13, Darse Billings, Algorithms and Assessment in Computer Poker, Ph D Thesis, Robert Abrey Hearn, Games, Puzzles and Computation, Ph D Thesis, 2006
5 Bibliography Sanaz Mostaghim, Multi-objective Evolutionary Algorithms: Data structures, Convergence and, Diversity PhD thesis, Deutschland (Germany), Sharker Verlag, Todd Blackman, Genetic Algorithm for a Multiagent Approach to the Game of GO, Master of Science Thesis, Warren D Smith, Mathematical Definition of Intelligence (and Consequences), Franz Rothlauf, Representations for Genetic and Evolutionary Algorithms. Physica-Verlag, second edition, August 2002 (1st ed.), 2006 (2nd ed.) 60. Eric Krevice Prebys, Genetic Algorithm in Computer Science 61. T. Hashimoto, Y. Kajihara, N. Sasaki, H. Iida, J. Yoshimura, An evaluation function for amazons,h.j. van den Herik, B.Monien (Eds.), Advances in Computer Games, Vol. 9, Universiteit Maastricht, Maastricht, 2001, pp M. Winands, J. Uiterwijk, J. van den Herik, The quad heuristic in Lines of Action, J. Internat. Computer Chess Assoc. 24 (1) (2001) J. Schaeffer, J. Culberson, N. Treloar, B. Knight, P. Lu, D. Szafron, Reviving the game of checkers, D.N.L. Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad, Ellis Horwood, Chichester, 1991, pp J. Schaeffer, R. Lake, Solving the game of checkers, in: R.J. Nowakowski (Ed.), Games of No Chance, MSRI Publications, Vol. 29, Cambridge University Press, Cambridge, MA, 1996, pp J. Allen, A note on the computer solution of Connect-Four, D.N.L. Levy, D.F. Beal (Eds.), Heuristic Programming in Artificial Intelligence: The First Computer Olympiad, Ellis Horwood, Chichester, 1989, pp L.V. Allis, A knowledge-based approach of Connect Four: The game is over, white to move wins, M.Sc. Thesis, Vrije Universiteit Report No. IR-163, Faculty of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, 1988.
6 Bibliography J. Schaeffer, Conspiracy numbers, in: D.F. Beal (Ed.), Advances in Computer Chess, Vol. 5, Elsevier Science, Amsterdam, 1989, pp Also published in: Artificial Intelligence 43 (1) (1990) L.V. Allis, P.N.A. Schoo, Qubic solved again, in: H.J. van den Herik, L.V. Allis (Eds.), Heuristic Programming in Artificial Intelligence 3: The Third Computer Olympiad, Ellis Horwood, Chichester, 1992, pp J. Wágner, I. Virág, Solving Renju, ICGA J. 24 (1) (2001) H.J. van den Herik, I.S. Herschberg, The construction of an omniscient endgame data base, ICCA J. 8 (2) (1985) P.J. Jansen, Using knowledge about the opponent in game-tree search, Ph.D. Thesis, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, D.M. Breuker, J.W.H.M. Uiterwijk, H.J. van den Herik, Replacement schemes for transposition tables, ICCA J. 17 (4) (1994) T. Thomsen, Lambda-search in game trees With application to Go, ICGA J. 23 (4) (2000) L.V. Allis, M. van der Meulen, H.J. van den Herik, Proof-number search, Artificial Intelligence 66 (1) (1994) M. Seo, H. Iida, J.W.H.M. Uiterwijk, The PN*- search algorithm: Application to Tsume-Shogi, Artificial Intelligence 129 (1 2) (2001) J. van Rijswijck, Computer Hex: Are bees better than fruitflies?, M.Sc. Thesis, University of Alberta, Edmonton, AB, 2000.
NOTE 6 6 LOA IS SOLVED
234 ICGA Journal December 2008 NOTE 6 6 LOA IS SOLVED Mark H.M. Winands 1 Maastricht, The Netherlands ABSTRACT Lines of Action (LOA) is a two-person zero-sum game with perfect information; it is a chess-like
More informationRetrograde Analysis of Woodpush
Retrograde Analysis of Woodpush Tristan Cazenave 1 and Richard J. Nowakowski 2 1 LAMSADE Université Paris-Dauphine Paris France cazenave@lamsade.dauphine.fr 2 Dept. of Mathematics and Statistics Dalhousie
More informationStrategic Evaluation in Complex Domains
Strategic Evaluation in Complex Domains Tristan Cazenave LIP6 Université Pierre et Marie Curie 4, Place Jussieu, 755 Paris, France Tristan.Cazenave@lip6.fr Abstract In some complex domains, like the game
More informationGames solved: Now and in the future
Games solved: Now and in the future by H. J. van den Herik, J. W. H. M. Uiterwijk, and J. van Rijswijck Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Which game
More informationMIA: A World Champion LOA Program
MIA: A World Champion LOA Program Mark H.M. Winands and H. Jaap van den Herik MICC-IKAT, Universiteit Maastricht, Maastricht P.O. Box 616, 6200 MD Maastricht, The Netherlands {m.winands, herik}@micc.unimaas.nl
More informationTwo-Player Perfect Information Games: A Brief Survey
Two-Player Perfect Information Games: A Brief Survey Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Domain: two-player games. Which game characters are predominant
More informationEvaluation-Function Based Proof-Number Search
Evaluation-Function Based Proof-Number Search Mark H.M. Winands and Maarten P.D. Schadd Games and AI Group, Department of Knowledge Engineering, Faculty of Humanities and Sciences, Maastricht University,
More informationProgramming Bao. Jeroen Donkers and Jos Uiterwijk 1. IKAT, Dept. of Computer Science, Universiteit Maastricht, Maastricht, The Netherlands.
Programming Bao Jeroen Donkers and Jos Uiterwijk IKAT, Dept. of Computer Science, Universiteit Maastricht, Maastricht, The Netherlands. ABSTRACT The mancala games Awari and Kalah have been studied in Artificial
More informationReal-Time Connect 4 Game Using Artificial Intelligence
Journal of Computer Science 5 (4): 283-289, 2009 ISSN 1549-3636 2009 Science Publications Real-Time Connect 4 Game Using Artificial Intelligence 1 Ahmad M. Sarhan, 2 Adnan Shaout and 2 Michele Shock 1
More informationTwo-Player Perfect Information Games: A Brief Survey
Two-Player Perfect Information Games: A Brief Survey Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Domain: two-player games. Which game characters are predominant
More informationSolving 8 8 Domineering
Theoretical Computer Science 230 (2000) 195 206 www.elsevier.com/locate/tcs Mathematical Games Solving 8 8 Domineering D.M. Breuker, J.W.H.M. Uiterwijk, H.J. van den Herik Department of Computer Science,
More informationThe Evolution of Knowledge and Search in Game-Playing Systems
The Evolution of Knowledge and Search in Game-Playing Systems Jonathan Schaeffer Abstract. The field of artificial intelligence (AI) is all about creating systems that exhibit intelligent behavior. Computer
More informationInternational Journal of Modern Trends in Engineering and Research. Optimizing Search Space of Othello Using Hybrid Approach
International Journal of Modern Trends in Engineering and Research www.ijmter.com Optimizing Search Space of Othello Using Hybrid Approach Chetan Chudasama 1, Pramod Tripathi 2, keyur Prajapati 3 1 Computer
More informationOn Games And Fairness
On Games And Fairness Hiroyuki Iida Japan Advanced Institute of Science and Technology Ishikawa, Japan iida@jaist.ac.jp Abstract. In this paper we conjecture that the game-theoretic value of a sophisticated
More informationUsing a genetic algorithm for mining patterns from Endgame Databases
0 African Conference for Sofware Engineering and Applied Computing Using a genetic algorithm for mining patterns from Endgame Databases Heriniaina Andry RABOANARY Department of Computer Science Institut
More informationA Move Generating Algorithm for Hex Solvers
A Move Generating Algorithm for Hex Solvers Rune Rasmussen, Frederic Maire, and Ross Hayward Faculty of Information Technology, Queensland University of Technology, Gardens Point Campus, GPO Box 2434,
More informationFACTORS AFFECTING DIMINISHING RETURNS FOR SEARCHING DEEPER 1
Factors Affecting Diminishing Returns for ing Deeper 75 FACTORS AFFECTING DIMINISHING RETURNS FOR SEARCHING DEEPER 1 Matej Guid 2 and Ivan Bratko 2 Ljubljana, Slovenia ABSTRACT The phenomenon of diminishing
More informationGeneration of Patterns With External Conditions for the Game of Go
Generation of Patterns With External Conditions for the Game of Go Tristan Cazenave 1 Abstract. Patterns databases are used to improve search in games. We have generated pattern databases for the game
More informationPonnuki, FiveStones and GoloisStrasbourg: three software to help Go teachers
Ponnuki, FiveStones and GoloisStrasbourg: three software to help Go teachers Tristan Cazenave Labo IA, Université Paris 8, 2 rue de la Liberté, 93526, St-Denis, France cazenave@ai.univ-paris8.fr Abstract.
More informationLambda Depth-first Proof Number Search and its Application to Go
Lambda Depth-first Proof Number Search and its Application to Go Kazuki Yoshizoe Dept. of Electrical, Electronic, and Communication Engineering, Chuo University, Japan yoshizoe@is.s.u-tokyo.ac.jp Akihiro
More informationUnderstanding Coevolution
Understanding Coevolution Theory and Analysis of Coevolutionary Algorithms R. Paul Wiegand Kenneth A. De Jong paul@tesseract.org kdejong@.gmu.edu ECLab Department of Computer Science George Mason University
More informationSOLVING KALAH ABSTRACT
Solving Kalah 139 SOLVING KALAH Geoffrey Irving 1 Jeroen Donkers and Jos Uiterwijk 2 Pasadena, California Maastricht, The Netherlands ABSTRACT Using full-game databases and optimized tree-search algorithms,
More informationTowards A World-Champion Level Computer Chess Tutor
Towards A World-Champion Level Computer Chess Tutor David Levy Abstract. Artificial Intelligence research has already created World- Champion level programs in Chess and various other games. Such programs
More informationA Study of Machine Learning Methods using the Game of Fox and Geese
A Study of Machine Learning Methods using the Game of Fox and Geese Kenneth J. Chisholm & Donald Fleming School of Computing, Napier University, 10 Colinton Road, Edinburgh EH10 5DT. Scotland, U.K. k.chisholm@napier.ac.uk
More informationScripting the Game of Lemmings with a Genetic Algorithm
Scripting the Game of Lemmings with a Genetic Algorithm Graham Kendall School of Computer Science & IT University of Nottingham Nottingham NG8 1BB, UK Email: gxk@cs.nott.ac.uk Kristian Spoerer School of
More informationA Re-Examination of Brute-Force Search
From: AAAI Technical Report FS-93-02. Compilation copyright 1993, AAAI (www.aaai.org). All rights reserved. A Re-Examination of Brute-Force Search Jonathan Schaeffer Paul Lu Duane Szafron Robert Lake Department
More informationA Desktop Grid Computing Service for Connect6
A Desktop Grid Computing Service for Connect6 I-Chen Wu*, Chingping Chen*, Ping-Hung Lin*, Kuo-Chan Huang**, Lung- Ping Chen***, Der-Johng Sun* and Hsin-Yun Tsou* *Department of Computer Science, National
More informationBibliography Alien Newell
Bibliography Alien Newell Ernst, G. W. & Newell, A. (1967a) GPS and generality. Pittsburgh: Carnegie Institute of Technology Ernst, G. W. & Newell, A. (1967b) Some issues of representation in a general
More informationThe Surakarta Bot Revealed
The Surakarta Bot Revealed Mark H.M. Winands Games and AI Group, Department of Data Science and Knowledge Engineering Maastricht University, Maastricht, The Netherlands m.winands@maastrichtuniversity.nl
More informationENHANCED REALIZATION PROBABILITY SEARCH
New Mathematics and Natural Computation c World Scientific Publishing Company ENHANCED REALIZATION PROBABILITY SEARCH MARK H.M. WINANDS MICC-IKAT Games and AI Group, Faculty of Humanities and Sciences
More informationAyo, the Awari Player, or How Better Represenation Trumps Deeper Search
Ayo, the Awari Player, or How Better Represenation Trumps Deeper Search Mohammed Daoud, Nawwaf Kharma 1, Ali Haidar, Julius Popoola Dept. of Electrical and Computer Engineering, Concordia University 1455
More informationCritical Position Identification in Application to Speculative Play. Khalid, Mohd Nor Akmal; Yusof, Umi K Author(s) Hiroyuki; Ishitobi, Taichi
JAIST Reposi https://dspace.j Title Critical Position Identification in Application to Speculative Play Khalid, Mohd Nor Akmal; Yusof, Umi K Author(s) Hiroyuki; Ishitobi, Taichi Citation Proceedings of
More informationHybrid of Evolution and Reinforcement Learning for Othello Players
Hybrid of Evolution and Reinforcement Learning for Othello Players Kyung-Joong Kim, Heejin Choi and Sung-Bae Cho Dept. of Computer Science, Yonsei University 134 Shinchon-dong, Sudaemoon-ku, Seoul 12-749,
More informationOpponent Models and Knowledge Symmetry in Game-Tree Search
Opponent Models and Knowledge Symmetry in Game-Tree Search Jeroen Donkers Institute for Knowlegde and Agent Technology Universiteit Maastricht, The Netherlands donkers@cs.unimaas.nl Abstract In this paper
More informationGo-Moku Solved by New Search Techniques
Go-Moku Solved by New Search Techniques L.V. Ailis H.J. van den Herik University of Limburg P.O. Box 616 6200 MD Maastricht, The Netherlands { allis,herik }@cs.mlimburg.nl M.P.H. Huntjens Vrije Universiteit
More informationMachine Learning Using a Genetic Algorithm to Optimise a Draughts Program Board Evaluation Function
Machine Learning Using a Genetic Algorithm to Optimise a Draughts Program Board Evaluation Function Kenneth J. Chisholm and Peter V.G. Bradbeer. Department of Computer Studies, Napier University, Edinburgh,
More informationCreating a Havannah Playing Agent
Creating a Havannah Playing Agent B. Joosten August 27, 2009 Abstract This paper delves into the complexities of Havannah, which is a 2-person zero-sum perfectinformation board game. After determining
More informationThe Behavior Evolving Model and Application of Virtual Robots
The Behavior Evolving Model and Application of Virtual Robots Suchul Hwang Kyungdal Cho V. Scott Gordon Inha Tech. College Inha Tech College CSUS, Sacramento 253 Yonghyundong Namku 253 Yonghyundong Namku
More informationComputer Chess Compendium
Computer Chess Compendium To Alastair and Katherine David Levy, Editor Computer Chess Compendium Springer Science+Business Media, LLC First published 1988 David Levy 1988 Originally published by Springer-Verlag
More informationA Quoridor-playing Agent
A Quoridor-playing Agent P.J.C. Mertens June 21, 2006 Abstract This paper deals with the construction of a Quoridor-playing software agent. Because Quoridor is a rather new game, research about the game
More informationReactive Planning with Evolutionary Computation
Reactive Planning with Evolutionary Computation Chaiwat Jassadapakorn and Prabhas Chongstitvatana Intelligent System Laboratory, Department of Computer Engineering Chulalongkorn University, Bangkok 10330,
More informationBSc Knowledge Engineering, Maastricht University, , Cum Laude Thesis topic: Operation Set Problem
Maarten P.D. Schadd Curriculum Vitae Product Manager Blueriq B.V. De Gruyterfabriek Veemarktkade 8 5222 AE s-hertogenbosch The Netherlands Phone: 06-29524605 m.schadd@blueriq.com Maarten Schadd Phone:
More informationMuangkasem, Apimuk; Iida, Hiroyuki; Author(s) Kristian. and Multimedia, 2(1):
JAIST Reposi https://dspace.j Title Aspects of Opening Play Muangkasem, Apimuk; Iida, Hiroyuki; Author(s) Kristian Citation Asia Pacific Journal of Information and Multimedia, 2(1): 49-56 Issue Date 2013-06
More informationBlunder Cost in Go and Hex
Advances in Computer Games: 13th Intl. Conf. ACG 2011; Tilburg, Netherlands, Nov 2011, H.J. van den Herik and A. Plaat (eds.), Springer-Verlag Berlin LNCS 7168, 2012, pp 220-229 Blunder Cost in Go and
More informationA Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design
SMDtP A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design 2015 10 15 1 2 Chia-Feng Juang, Member 3 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS-PART B: CYBERNETICS,
More informationA Generalized Heuristic for Can t Stop
Proceedings of the Twenty-Second International FLAIRS Conference (009) A Generalized Heuristic for Can t Stop James Glenn and Christian Aloi Department of Computer Science Loyola College in Maryland Baltimore,
More informationCreating a Poker Playing Program Using Evolutionary Computation
Creating a Poker Playing Program Using Evolutionary Computation Simon Olsen and Rob LeGrand, Ph.D. Abstract Artificial intelligence is a rapidly expanding technology. We are surrounded by technology that
More informationThe Game of Lasker Morris
The Game of Lasker Morris Peter Stahlhacke Lehrstuhl Mathematische Optimierung Fakultät Mathematik und Informatik Friedrich-Schiller-Universität Jena 00 Jena Germany May 00 ABSTRACT. We describe a retrograde
More informationCarnegie Mellon University, University of Pittsburgh
Carnegie Mellon University, University of Pittsburgh Carnegie Mellon University, University of Pittsburgh Artificial Intelligence (AI) and Deep Learning (DL) Overview Paola Buitrago Leader AI and BD Pittsburgh
More informationQuiescence Search for Stratego
Quiescence Search for Stratego Maarten P.D. Schadd Mark H.M. Winands Department of Knowledge Engineering, Maastricht University, The Netherlands Abstract This article analyses quiescence search in an imperfect-information
More informationBLUFF WITH AI. CS297 Report. Presented to. Dr. Chris Pollett. Department of Computer Science. San Jose State University. In Partial Fulfillment
BLUFF WITH AI CS297 Report Presented to Dr. Chris Pollett Department of Computer Science San Jose State University In Partial Fulfillment Of the Requirements for the Class CS 297 By Tina Philip May 2017
More informationLecture Notes in Computer Science 2883 Edited by G. Goos, J. Hartmanis, and J. van Leeuwen
Lecture Notes in Computer Science 2883 Edited by G. Goos, J. Hartmanis, and J. van Leeuwen 3 Berlin Heidelberg New York Hong Kong London Milan Paris Tokyo Jonathan Schaeffer Martin Müller Yngvi Björnsson
More informationPlayout Search for Monte-Carlo Tree Search in Multi-Player Games
Playout Search for Monte-Carlo Tree Search in Multi-Player Games J. (Pim) A.M. Nijssen and Mark H.M. Winands Games and AI Group, Department of Knowledge Engineering, Faculty of Humanities and Sciences,
More informationExploiting Graph Properties of Game Trees
Exploiting Graph Properties of Game Trees Aske Plaat,1, Jonathan Schaeffer 2, Wim Pijls 1, Arie de Bruin 1 plaat@theory.lcs.mit.edu, jonathan@cs.ualberta.ca, whlmp@cs.few.eur.nl, arie@cs.few.eur.nl 1 Erasmus
More informationSearch versus Knowledge for Solving Life and Death Problems in Go
Search versus Knowledge for Solving Life and Death Problems in Go Akihiro Kishimoto Department of Media Architecture, Future University-Hakodate 6-2, Kamedanakano-cho, Hakodate, Hokkaido, 04-86, Japan
More informationEARIN Jarosław Arabas Room #223, Electronics Bldg.
EARIN http://elektron.elka.pw.edu.pl/~jarabas/earin.html Jarosław Arabas jarabas@elka.pw.edu.pl Room #223, Electronics Bldg. Paweł Cichosz pcichosz@elka.pw.edu.pl Room #215, Electronics Bldg. EARIN Jarosław
More informationEvolutionary Othello Players Boosted by Opening Knowledge
26 IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 26 Evolutionary Othello Players Boosted by Opening Knowledge Kyung-Joong Kim and Sung-Bae
More informationINTRODUCTION. a complex system, that using new information technologies (software & hardware) combined
COMPUTATIONAL INTELLIGENCE & APPLICATIONS INTRODUCTION What is an INTELLIGENT SYSTEM? a complex system, that using new information technologies (software & hardware) combined with communication technologies,
More informationαβ-based Play-outs in Monte-Carlo Tree Search
αβ-based Play-outs in Monte-Carlo Tree Search Mark H.M. Winands Yngvi Björnsson Abstract Monte-Carlo Tree Search (MCTS) is a recent paradigm for game-tree search, which gradually builds a gametree in a
More informationUpgrading Checkers Compositions
Upgrading s Compositions Yaakov HaCohen-Kerner, Daniel David Levy, Amnon Segall Department of Computer Sciences, Jerusalem College of Technology (Machon Lev) 21 Havaad Haleumi St., P.O.B. 16031, 91160
More informationEnsemble Approaches in Evolutionary Game Strategies: A Case Study in Othello
Ensemble Approaches in Evolutionary Game Strategies: A Case Study in Othello Kyung-Joong Kim and Sung-Bae Cho Abstract In pattern recognition area, an ensemble approach is one of promising methods to increase
More informationMonte-Carlo Tree Search Enhancements for Havannah
Monte-Carlo Tree Search Enhancements for Havannah Jan A. Stankiewicz, Mark H.M. Winands, and Jos W.H.M. Uiterwijk Department of Knowledge Engineering, Maastricht University j.stankiewicz@student.maastrichtuniversity.nl,
More informationCASPER: a Case-Based Poker-Bot
CASPER: a Case-Based Poker-Bot Ian Watson and Jonathan Rubin Department of Computer Science University of Auckland, New Zealand ian@cs.auckland.ac.nz Abstract. This paper investigates the use of the case-based
More informationThe Computer (R)Evolution
The Games Computers The Computer (R)Evolution (and People) Play Need to re-think what it means to think. Jonathan Schaeffer Department of Computing Science University of Alberta Edmonton, Alberta Canada
More informationConstructing an Abalone Game-Playing Agent
18th June 2005 Abstract This paper will deal with the complexity of the game Abalone 1 and depending on this complexity, will explore techniques that are useful for constructing an Abalone game-playing
More informationPlaying Othello Using Monte Carlo
June 22, 2007 Abstract This paper deals with the construction of an AI player to play the game Othello. A lot of techniques are already known to let AI players play the game Othello. Some of these techniques
More informationInfluence of Search Depth on Position Evaluation
Influence of Search Depth on Position Evaluation Matej Guid and Ivan Bratko Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia Abstract. By using a well-known chess
More informationGO for IT. Guillaume Chaslot. Mark Winands
GO for IT Guillaume Chaslot Jaap van den Herik Mark Winands (UM) (UvT / Big Grid) (UM) Partnership for Advanced Computing in EUROPE Amsterdam, NH Hotel, Industrial Competitiveness: Europe goes HPC Krasnapolsky,
More informationFurther Evolution of a Self-Learning Chess Program
Further Evolution of a Self-Learning Chess Program David B. Fogel Timothy J. Hays Sarah L. Hahn James Quon Natural Selection, Inc. 3333 N. Torrey Pines Ct., Suite 200 La Jolla, CA 92037 USA dfogel@natural-selection.com
More informationChinook: The World Man-Machine Checkers Champion
Chinook: The World Man-Machine Checkers Champion Jonathan Schaeffer, Robert Lake, Paul Lu and Martin Bryant ABSTRACT In 1992, the seemingly unbeatable World Checker Champion, Dr. Marion Tinsley, defended
More informationMonte-Carlo Tree Search in Settlers of Catan
Monte-Carlo Tree Search in Settlers of Catan István Szita 1, Guillaume Chaslot 1, and Pieter Spronck 2 1 Maastricht University, Department of Knowledge Engineering 2 Tilburg University, Tilburg centre
More informationIntelligent Gaming Techniques for Poker: An Imperfect Information Game
Intelligent Gaming Techniques for Poker: An Imperfect Information Game Samisa Abeysinghe and Ajantha S. Atukorale University of Colombo School of Computing, 35, Reid Avenue, Colombo 07, Sri Lanka Tel:
More informationUNIVERSITY OF REGINA FACULTY OF ENGINEERING. TIME TABLE: Once every two weeks (tentatively), every other Friday from pm
1 UNIVERSITY OF REGINA FACULTY OF ENGINEERING COURSE NO: ENIN 880AL - 030 - Fall 2002 COURSE TITLE: Introduction to Intelligent Robotics CREDIT HOURS: 3 INSTRUCTOR: Dr. Rene V. Mayorga ED 427; Tel: 585-4726,
More informationHyperNEAT-GGP: A HyperNEAT-based Atari General Game Player. Matthew Hausknecht, Piyush Khandelwal, Risto Miikkulainen, Peter Stone
-GGP: A -based Atari General Game Player Matthew Hausknecht, Piyush Khandelwal, Risto Miikkulainen, Peter Stone Motivation Create a General Video Game Playing agent which learns from visual representations
More informationThe Evolution of Blackjack Strategies
The Evolution of Blackjack Strategies Graham Kendall University of Nottingham School of Computer Science & IT Jubilee Campus, Nottingham, NG8 BB, UK gxk@cs.nott.ac.uk Craig Smith University of Nottingham
More informationAddressing NP-Complete Puzzles with Monte-Carlo Methods 1
Addressing NP-Complete Puzzles with Monte-Carlo Methods 1 Maarten P.D. Schadd and Mark H.M. Winands H. Jaap van den Herik and Huib Aldewereld 2 Abstract. NP-complete problems are a challenging task for
More informationSWARM INTELLIGENCE. Mario Pavone Department of Mathematics & Computer Science University of Catania
Worker Ant #1: I'm lost! Where's the line? What do I do? Worker Ant #2: Help! Worker Ant #3: We'll be stuck here forever! Mr. Soil: Do not panic, do not panic. We are trained professionals. Now, stay calm.
More informationSearch Versus Knowledge in Game-Playing Programs Revisited
Search Versus Knowledge in Game-Playing Programs Revisited Abstract Andreas Junghanns, Jonathan Schaeffer University of Alberta Dept. of Computing Science Edmonton, Alberta CANADA T6G 2H1 Email: fandreas,jonathang@cs.ualberta.ca
More informationAnca ANDREICA Producția științifică
Anca ANDREICA Producția științifică Lucrări categoriile A, B și C Lucrări categoriile A și B puncte 9 puncte Lucrări categoria A A. Agapie, A. Andreica, M. Giuclea, Probabilistic Cellular Automata, Journal
More informationEvolving Speciated Checkers Players with Crowding Algorithm
Evolving Speciated Checkers Players with Crowding Algorithm Kyung-Joong Kim Dept. of Computer Science, Yonsei University 134 Shinchon-dong, Sudaemoon-ku, Seoul 12-749, Korea uribyul@candy.yonsei.ac.kr
More informationCOMPUTER CHESS: State of the Art
COMPUTER CHESS: State of the Art Lessons for computer Shogi and Go Jos Uiterwijk 1 University of Limburg MATRIKS Research Institute Abstract In this paper an overview is given of the present state of the
More informationOptimal Rhode Island Hold em Poker
Optimal Rhode Island Hold em Poker Andrew Gilpin and Tuomas Sandholm Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 {gilpin,sandholm}@cs.cmu.edu Abstract Rhode Island Hold
More informationAnkur Sinha, Ph.D. Indian Institute of Technology, Kanpur, India Bachelor of Technology, Department of Mechanical Engineering, 2006
Ankur Sinha, Ph.D. Department of Information and Service Economy Aalto University School of Business Former: Helsinki School of Economics Helsinki 00100 Finland Email: Ankur.Sinha@aalto.fi EDUCATION Aalto
More informationSINCE THE beginning of the computer age, people have
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 9, NO. 6, DECEMBER 2005 615 Systematically Incorporating Domain-Specific Knowledge Into Evolutionary Speciated Checkers Players Kyung-Joong Kim, Student
More informationSearch Depth. 8. Search Depth. Investing. Investing in Search. Jonathan Schaeffer
Search Depth 8. Search Depth Jonathan Schaeffer jonathan@cs.ualberta.ca www.cs.ualberta.ca/~jonathan So far, we have always assumed that all searches are to a fixed depth Nice properties in that the search
More informationAI MAGAZINE AMER ASSOC ARTIFICIAL INTELL UNITED STATES English ANNALS OF MATHEMATICS AND ARTIFICIAL
Title Publisher ISSN Country Language ACM Transactions on Autonomous and Adaptive Systems ASSOC COMPUTING MACHINERY 1556-4665 UNITED STATES English ACM Transactions on Intelligent Systems and Technology
More informationOutline. What is AI? A brief history of AI State of the art
Introduction to AI Outline What is AI? A brief history of AI State of the art What is AI? AI is a branch of CS with connections to psychology, linguistics, economics, Goal make artificial systems solve
More informationComputer Analysis of Connect-4 PopOut
Computer Analysis of Connect-4 PopOut University of Oulu Department of Information Processing Science Master s Thesis Jukka Pekkala May 18th 2014 2 Abstract In 1988, Connect-4 became the second non-trivial
More informationMemory-Based Approaches To Learning To Play Games
From: AAAI Technical Report FS-93-02. Compilation copyright 1993, AAAI (www.aaai.org). All rights reserved. Memory-Based Approaches To Learning To Play Games Christopher G. Atkeson Department of Brain
More informationINTELLIGENT DECISION AND CONTROL INTELLIGENT SYSTEMS
INTELLIGENT DECISION AND CONTROL INTELLIGENT SYSTEMS João Miguel da Costa Sousa Universidade de Lisboa, Instituto Superior Técnico CenterofIntelligentSystems, IDMEC, LAETA, Portugal jmsousa@tecnico.ulisboa.pt
More informationAssociating shallow and selective global tree search with Monte Carlo for 9x9 go
Associating shallow and selective global tree search with Monte Carlo for 9x9 go Bruno Bouzy Université Paris 5, UFR de mathématiques et d informatique, C.R.I.P.5, 45, rue des Saints-Pères 75270 Paris
More informationACCURACY AND SAVINGS IN DEPTH-LIMITED CAPTURE SEARCH
ACCURACY AND SAVINGS IN DEPTH-LIMITED CAPTURE SEARCH Prakash Bettadapur T. A.Marsland Computing Science Department University of Alberta Edmonton Canada T6G 2H1 ABSTRACT Capture search, an expensive part
More informationEvolving Neural Networks to Focus. Minimax Search. David E. Moriarty and Risto Miikkulainen. The University of Texas at Austin.
Evolving Neural Networks to Focus Minimax Search David E. Moriarty and Risto Miikkulainen Department of Computer Sciences The University of Texas at Austin Austin, TX 78712 moriarty,risto@cs.utexas.edu
More informationOpen Research Online The Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs Power system fault prediction using artificial neural networks Conference or Workshop Item How
More informationRobust Game Play Against Unknown Opponents
Robust Game Play Against Unknown Opponents Nathan Sturtevant Department of Computing Science University of Alberta Edmonton, Alberta, Canada T6G 2E8 nathanst@cs.ualberta.ca Michael Bowling Department of
More informationHex 2017: MOHEX wins the 11x11 and 13x13 tournaments
222 ICGA Journal 39 (2017) 222 227 DOI 10.3233/ICG-170030 IOS Press Hex 2017: MOHEX wins the 11x11 and 13x13 tournaments Ryan Hayward and Noah Weninger Department of Computer Science, University of Alberta,
More informationAppendix A: Further Reading
The Game Stats Appendix A: Further Reading Checkers Organizations American Checker Federation (ACF). http://usacheckers.com. Membership includes the bimonthly ACF Bulletin. English Draughts Association
More informationMemetic Crossover for Genetic Programming: Evolution Through Imitation
Memetic Crossover for Genetic Programming: Evolution Through Imitation Brent E. Eskridge and Dean F. Hougen University of Oklahoma, Norman OK 7319, USA {eskridge,hougen}@ou.edu, http://air.cs.ou.edu/ Abstract.
More informationUniversity of Alberta
University of Alberta Nearly Optimal Minimax Tree Search? by Aske Plaat, Jonathan Schaeffer, Wim Pijls and Arie de Bruin Technical Report TR 94 19 December 1994 DEPARTMENT OF COMPUTING SCIENCE The University
More informationAdversarial Search and Game Playing
Games Adversarial Search and Game Playing Russell and Norvig, 3 rd edition, Ch. 5 Games: multi-agent environment q What do other agents do and how do they affect our success? q Cooperative vs. competitive
More information