Chess Beyond the Rules
|
|
- Conrad Page
- 5 years ago
- Views:
Transcription
1 Chess Beyond the Rules Heikki Hyötyniemi Control Engineering Laboratory P.O. Box 5400 FIN Helsinki Univ. of Tech. Pertti Saariluoma Cognitive Science P.O. Box 13 FIN Helsinki University 1. Introduction Chess memory has been vital problem in the field of expertise research. It has been the forefront of general skills research for decades and a large number of important insights has been made firstly by chess researchers. Djakov et al. (1926) as well as de Groot (1965, 1966) showed that there are essential differences between players of various skill levels in their ability to recall chess positions unfamiliar to them. A Dutch research group illustrated that skill differences disappear with random positions and short presentations times (see Vicente and de Groot 1990), which data allowed the first synthesis (Chase and Simon 1973). This synthesis laid on several important theoretical insights. Firstly, it assumed that experts store the showed chess positions into their working memory. Secondly, it was assumed that they have a large storage of chess specific patterns in their long-term memory, which they can use like ordinary people use words for storing texts. They build chunks of several pieces, and this allows them to store positions in sets of few patterns instead of few individual pieces. Since chunks occupy working memory as much as individual pieces, the performance of pattern-based recall is much better. Four chunks with four to
2 five pieces give the outcome of recalled pieces, while novices recalling individual pieces cannot reach more that 4-5 piece in all (Chase and Simon 1973). The basic empirical findings have been confirmed numerous times since and new information about chess masters memory has been received on regular basis. The initial view is gradually changing. Charness (1976) illustrated that experts do not store presented chess positions into their working memory, Goldin (1978) that recognition as a process is not similar as recall in chess, and Saariluoma (1985) that experts are better at detecting information both in game and random positions. During this decade both new insights as well as accurate reanalysis have been published. The most relevant series of experiments concern location coding (Gobet and Simon 1996, Saariluoma 1984, 1994). This problem refers to the function of location information in the chess specific memory representation of chess players. When a chunk is a set of a few regularly organized pieces, it must entail information about the kind and color of the pieces. It is much more problematic, whether the absolute location of the pieces in terms of board coordinates is also a part of the chunks representation, so that a pawn chain a2, b3, c4, for example, is differently represented than a pawn chain a3, b4, c5. Experiments, which have manipulated the location of the chunks, systematically speak for the absolute location coding. The main problem we raise here concerns argumentation. It has been very commonplace to argue since Chase and Simon (1973) and Simon and Gilmartin (1973) that chess players have in their memory a vast storage of chess specific chunks. What is the structure of this knowledge is very open question. In computer simulation models, which have been used to argue for the large
3 storage of chunks, the representation is a list (Gobet and Simon 1996, Simon and Gilmartin 1973). However, the development of computational modeling during the last two decades has provided us with very powerful new means to investigate memory representations. Various versions of neural computing systems give as new possibilities to analyze the structure of information in human memory. In this paper we set the problem of pattern structure from neural point of view. We want to ask, whether connectionist approaches could provide us with some alternative chunks descriptions than list-like representations typical to current models. 2. About the data model The approach to chunk modeling here is connectionistic rather than symbolic. This data-oriented starting point means that the discussion becomes somewhat mathematical. In the experiments, the situations on a chess board were presented as 768 dimensional binary vectors (one bit for each piece in each location, together 12 times 64 bits; the bit is 1 if the corresponding piece happens to be there, and 0 otherwise). Only the actual piece configurations are coded; no rules of chess, not even information about the succession of configurations are utilized in any way. The 768 dimensional observation samples define the configuration space. The observed configurations, typical positions during chess games, are now seen as measurement data. In Fig. 1, some typical expert-level games in the configuration space are shown: the 768 dimensional configuration space has been projected onto two dimensions, spanned by the two most significant principal components of the chess data (see Basilevsky, 1994). In Fig. 2, the data samples that were used in the experiments are all shown projected in a three dimensional subspace.
4 Figure 1. Some complete chess games shown as trajectories in the configuration space. The original piece configuration is shown on the right; as more and more pieces are captured, the trajectory gets nearer to the origin of the configuration space Figure 2. The 2500 training configurations shown as a three dimensional image
5 The statistical model (see Fig. 2) does not make the relevant data properties visible. When the high dimensional data is mechanically projected onto lower dimension, the structure underlying the piece configurations can no more be recognized. What would be a better framework for the chess data? The ontological assumption now is that the data is concentrated in clusters that are varied by special features. These clusters and features are now together identified as chunks. This statistical view of chunks can be illustrated as shown in Fig. 3: the data points in the configuration space are concentrated around prototypical clusters. Different opening strategies, for example, should determine cluster centers of their own; special features, or variations around the center are caused by pieces that are not in their nominal locations. Figure 3. A schematic view of configuration categories as cluster centers in the configuration space. The opening library examples are rather trivial chunk prototypes; in this case the category extends over the whole board, and dislocated pieces push the points in the configuration space away from the category center
6 Figure 4. A rather typical local chunk standing for castling. Note that in practice the contents of the chunk vectors are numeric and continuous; only after thresholding, visually understandable images can be obtained The same chunk structure can be used to represent the cluster (or category) centers and the fine-tuning features alike. One could speak of global and local chunks, respectively. An example of a local chunk is shown in Fig. 4. The numeric nature of the chunks enhances their expressive power. Whereas the traditional, symbolic chunks are mutually exclusive, now linear weighted sums of the chunks can be used to reconstruct the piece configurations: f = a1c1+ L + a n c n. Above, f represents the observed board as represented using the configuration space coordinates, c i stands for the chunk number i, and a i is its weight. This formulation explicitly shows that the dimension of the chunk vectors is the same as the dimension of the configuration space is; in principle, the chunks extend over the whole board (most of the vector entries being negligible, though).
7 3. Chunking experiments The data model was trained using 2500 configurations from expert level games; 256 chunks were extracted. The actual training process is not elaborated on here, only the results of using the final model are presented (for details, see Hyötyniemi, 1997). In Fig. 5, the reconstruction errors during one game are plotted. It seems that when the configurations are typical, as in the beginning of the game, the skilled chunks can accurately explain the configuration. Figure 5. Reconstruction errors during one game (compare to Figs. 6 and 8). Only seven most appropriate of the all available chunk prototypes are utilized ( sparse coding ; compare to the human short-term memory capacity). Towards the end, when there are no more many pieces on the board, the unskilled trivial chunks (explained later) can efficiently represent individual pieces (zero error being obtained, of course, if only 7 pieces were remaining). However, note that the skilled model cannot be beaten easily, even if there is much more memory capacity allocated for this task in the extended model
8 Figure 6. A typical chess configuration (cf. Fig. 5) Figure 7. The reconstructed board standing for the typical situation in Fig. 6. Different numbers of chunks are used; first, only one chunk (the category prototype) is utilized (a), then three chunks (b), five chunks (c), and finally seven chunks (d)
9 Figure 8. An untypical chess configuration (cf. Fig. 5) Figure 9. Reconstruction of non-typical configuration shown in Fig. 8. On the left, 7 out of 256 skilled chunks are used; on the right, 7 out of a set of 256 skilled and 768 unskilled chunks are utilized. The unskilled chunks are in this case extremely localized; each of them represents one piece/location combination (so that 768 of them exhaust all one-piece alternatives). It is not a surprise that the non-optimized chunks enhance the robustness of the reconstruction in non-typical piece configurations
10 Figure 10. One of the 256 skilled and very specialized chunks: on the left, the chunk vector c horse has been selected alone, so that its weight is a horse = 1, all other chunk weights being zeros; on the right, the weighting of the same chunk is now a horse = 1 (note thresholding). It seems that this chunk has been allocated for distinguishing between the two knight orientations applying this chunk toggles between the two alternatives. In a way, it can be argued that the system has learned a complete chess move, even if no rules of chess or no succession of piece configurations has been shown to the algorithm explicitly 4. Discussion In traditional connectionist approaches it is usually assumed that the input output mapping is all that matters (for example, see Bishop, 1995); now, on the other hand, it is assumed that structure is essential. This internal structure is reflected in the chunks; it seems that sometimes this structure that is based on simple statistical correlations may reveal something that feels appealing (see Fig. 10). The role of representation rather than computation is emphasized as a tool to gain intuition. The view of chunks is now very different as compared to the original chunks are in this case genuinely additive real-valued vectors spanning subspaces in the metric configuration space. The automatically emerging chunks often seem to
11 be natural and easily interpreted. Some of the chunks (those standing for basic configuration categories) extend over the whole board; it is not a surprise that specially the pawns that do not move very much constitute the skeleton in these chunks. On the other hand, there also emerge very specialized chunks that can be utilized to modify the basic category prototype. One striking difference compared to the standard chunk paradigm is that whereas chunks usually are thought to expand when trained, now the opposite takes place: originally the chunk prototypes, starting from random values, extend over the whole board, whereas training makes them shrink as the representation becomes sparse and the chunks become more specialized. The compact view of mental images as sums of chunks helps to attack some of the difficult questions in chess expertise: The model explains the expert vs. novice performance in typical vs. untypical situations. Recognition process (or, actually, matching in this case) does not become more complex as new knowledge is acquired; rather, the operation becomes more automated when using the skilled chunks. Errors that are made in piece recall are rather plausible. There are some experiments presented in the literature that can readily be simulated also in this framework; the results using the numerical chunk model reflect nicely the behavior of human subjects. For example, see (Saariluoma, 1994): in Fig. 11, the interchange of quadrants is simulated. Similarly, the novice learning of chess configurations can be simulated in this framework (see Fig. 12; refer to Laine et al., 1998). It seems that the connectionist approach has real potential.
12 Figure 11. Quadrants reversed (compare to Fig. 6): the distorted configuration on the left, and its reconstruction on the right. The simulation reflects the experimental results: the quadrants that are intact are recalled rather well, whereas the interchanged ones cannot be recalled (note that according to the chunk model there must be a king in g1! ) Figure 12. Novice learning of chess configurations. The learning pattern in simulations resembles that of human subjects
13 Bibliography Basilevsky, A.: Statistical Factor Analysis and Related Methods. John Wiley & Sons, New York, Bishop, C.M.: Neural Networks for Pattern Recognition. Clarendon Press, Oxford, Charness, N.: Memory for chess positions: Resistance to interference. Journal of Experimental Psychology: Human Learning and Memory, 2, 1976, pp Chase, W. G. and Simon H. A.: The mind s eye in chess. In W. Chase (ed.), Visual information processing. Academic Press, New York, de Groot, A. D.: Thought and Choice in Chess. Mouton, The Hague, de Groot, A. D.: Perception and memory versus thought: Some old ideas and recent findings. In B. Kleinmuntz (ed.), Problem Solving. New York, Djakov, I. N., Petrovsky, N. B., and Rudik, P. A.: Psihologia Shahmatnoi Igry (Chess psychology). Avtorov, Moscow, Gobet, F. and Simon, H.A.: Templates in Chess Memory: A Mechanism for Recalling Several Boards. Cognitive Psychology, 31, 1996, pp Goldin, S. E.: The effects of orienting tasks on recognition of chess positions. American Journal of Psychology, 91, 1978, pp Hyötyniemi, H.: On the statistical nature of complex data. In SCAI'97 Sixth Scandinavian Conference on Artificial Intelligence: Research Announcements (ed. Grahne, G.), Helsinki University, Department of Computer Science, Report C , Helsinki, Finland, 1997, pp Available from Laine, T., Hyötyniemi, H., and Saariluoma, P.: The foundations of simulative theorizing. Proceedings of ECAI 98 (ed. Prade, H.), John Wiley & Sons, New York, 1998, pp Saariluoma, P.: Coding problem spaces in chess. Commentationes scientiarum socialium, 23, 1984, Turku: Societas Scientiarum Fennica. Saariluoma, P.: Chess players' intake of task relevant cues. Memory and Cognition, 13, 1985, pp Saariluoma, P.: Location Coding in Chess. The Quarterly Journal of Experimental Psychology, 47A (3), 1994, pp Simon, H. A. and Gilmartin, K.: A simulation of memory for chess positions. Cognitive Psychology, 5, 1973, pp Vicente, K. J. and de Groot, A. D.: The memory recall paradigm: Straightening out the historical record. American Psychologist, 45, 1990, pp
MITECS: Chess, Psychology of
Page 1 of 5 Historically, chess has been one of the leading fields in the study of EXPERTISE (see De Groot and Gobet 1996 and Holding 1985 for reviews). This popularity as a research domain is explained
More informationA computer model of chess memory 1
Gobet, F. (1993). A computer model of chess memory. Proceedings of 15th Annual Meeting of the Cognitive Science Society, p. 463-468. Hillsdale, NJ: Erlbaum. A computer model of chess memory 1 Fernand Gobet
More informationRecall of rapidly presented random chess positions is a function of skill
1 Gobet, F. & Simon, H. A. (1996). Recall of random and distorted positions: Implications for the theory of expertise. Memory & Cognition, 24, 493-503. Recall of rapidly presented random chess positions
More informationEffect of expertise acquisition on strategic perception: The example of chess
THE QUARTERLY JOURNAL OF EXPERIMENTAL PSYCHOLOGY 2008, 61 (8), 1265 1280 Effect of expertise acquisition on strategic perception: The example of chess Vincent Ferrari University of Provence, Aix-en-Provence,
More informationDynamic perception in chess
THE QUARTERLY JOURNAL OF EXPERIMENTAL PSYCHOLOGY 2006, 59 (2), 397 410 Dynamic perception in chess Vincent Ferrari, André Didierjean, and Evelyne Marmèche University of Provence, Aix-en-Provence, France
More informationComputational Modelling of Mental Imagery in Chess: A Sensitivity Analysis
Computational Modelling of Mental Imagery in Chess: A Sensitivity Analysis Fernand.Gobet (fernand.gobet@brunel.ac.uk) Centre for the Study of Expertise, Brunel University Cleveland Road, Uxbridge UB8 3PH
More informationThe Use of Memory and Causal Chunking in the Game of Shogi
The Use of Memory and Causal Chunking in the Game of Shogi Takeshi Ito 1, Hitoshi Matsubara 2 and Reijer Grimbergen 3 1 Department of Computer Science, University of Electro-Communications < ito@cs.uec.ac.jp>
More informationThe Effects of Speed on Skilled Chess Performance. Bruce D. Burns. Michigan State University
Speed and chess skill 1 To appear in Psychological Science The Effects of Speed on Skilled Chess Performance Bruce D. Burns Michigan State University Address for correspondence: Bruce Burns Department
More informationVisual Search in Ecological and Non-Ecological Displays: Evidence for a Non-Monotonic Effect of Complexity on Performance
Visual Search in Ecological and Non-Ecological Displays: Evidence for a Non-Monotonic Effect of Complexity on Performance Philippe Chassy 1 *, Fernand Gobet 2 1 Department of Psychology, Liverpool Hope
More informationData mining of chess chunks: a novel distance-based structure
Data mining of chess chunks: a novel distance-based structure A. Linhares The Getulio Vargas Foundation, Brazil Abstract What can the disciplines of artificial intelligence and the cognitive sciences obtain
More informationThe perceptual aspect of skilled performance in chess: Evidence from eye movements
Memory & Cognition 2001, 29 (8), 1146-1152 The perceptual aspect of skilled performance in chess: Evidence from eye movements NEIL CHARNESS Florida State University, Tallahassee, Florida and EYAL M. REINGOLD,
More informationRole of presentation time in Recall of Game and Random Chess Positions
December 16, 1994 Presentation time in chess recall Role of presentation time in Recall of Game and Random Chess Positions Fernand Gobet and Herbert A. Simon Department of Psychology Carnegie Mellon University
More informationMaster Artificial Intelligence
Master Artificial Intelligence Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability to evaluate, analyze and interpret relevant
More informationRunning head: MENTAL IMAGERY AND CHUNKS. Mental Imagery and Chunks: Empirical and Computational Findings. Andrew J. Waters
Running head: MENTAL IMAGERY AND CHUNKS Mental Imagery and Chunks: Empirical and Computational Findings Andrew J. Waters The University of Texas M. D. Anderson Cancer Center Fernand Gobet Brunel University
More informationAn Experiment in Students Acquisition of Problem Solving Skill from Goal-Oriented Instructions
An Experiment in Students Acquisition of Problem Solving Skill from Goal-Oriented Instructions Matej Guid, Ivan Bratko Artificial Intelligence Laboratory Faculty of Computer and Information Science, University
More informationA Robust Neural Robot Navigation Using a Combination of Deliberative and Reactive Control Architectures
A Robust Neural Robot Navigation Using a Combination of Deliberative and Reactive Control Architectures D.M. Rojas Castro, A. Revel and M. Ménard * Laboratory of Informatics, Image and Interaction (L3I)
More informationExpertise in Complex Decision Making: The Role of Search in Chess 70 Years After de Groot
Cognitive Science 35 (2011) 1567 1579 Copyright Ó 2011 Cognitive Science Society, Inc. All rights reserved. ISSN: 0364-0213 print / 1551-6709 online DOI: 10.1111/j.1551-6709.2011.01196.x Expertise in Complex
More informationAppendices master s degree programme Artificial Intelligence
Appendices master s degree programme Artificial Intelligence 2015-2016 Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability
More informationComputational Chunking in Chess
Computational Chunking in Chess By Andrew Cook A thesis submitted to The University of Birmingham for the degree of Doctor of Philosophy School of Computer Science The University of Birmingham February
More informationSITUATED CREATIVITY INSPIRED IN PARAMETRIC DESIGN ENVIRONMENTS
The 2nd International Conference on Design Creativity (ICDC2012) Glasgow, UK, 18th-20th September 2012 SITUATED CREATIVITY INSPIRED IN PARAMETRIC DESIGN ENVIRONMENTS R. Yu, N. Gu and M. Ostwald School
More informationMECHANICAL DESIGN LEARNING ENVIRONMENTS BASED ON VIRTUAL REALITY TECHNOLOGIES
INTERNATIONAL CONFERENCE ON ENGINEERING AND PRODUCT DESIGN EDUCATION 4 & 5 SEPTEMBER 2008, UNIVERSITAT POLITECNICA DE CATALUNYA, BARCELONA, SPAIN MECHANICAL DESIGN LEARNING ENVIRONMENTS BASED ON VIRTUAL
More informationTEMPORAL DIFFERENCE LEARNING IN CHINESE CHESS
TEMPORAL DIFFERENCE LEARNING IN CHINESE CHESS Thong B. Trinh, Anwer S. Bashi, Nikhil Deshpande Department of Electrical Engineering University of New Orleans New Orleans, LA 70148 Tel: (504) 280-7383 Fax:
More informationRecall of random and distorted chess positions: Implications for the theory of expertise
Memory & Cognition 1996, 24 (4). 493-503 Recall of random and distorted chess positions: Implications for the theory of expertise FERNAND GOBET and HERBERT A. SIMON Carnegie Mellon University, Pittsburgh,
More informationPerception in chess: Evidence from eye movements
14 Perception in chess: Evidence from eye movements Eyal M. Reingold and Neil Charness Abstract We review and report findings from a research program by Reingold, Charness and their colleagues (Charness
More informationABSTRACT. Chess Performance under Time Pressure: Evidence for the Slow Processes in Speed Chess. Yu-Hsuan Chang
ABSTRACT Chess Performance under Time Pressure: Evidence for the Slow Processes in Speed Chess by Yu-Hsuan Chang An influential theory of chess skill holds that expertise in chess is not due to greater
More informationExpert memory: a comparison of four theories
COGNITION Cognition 66 (1998) 115 152 Expert memory: a comparison of four theories Fernand Gobet a,b, * a Carnegie Mellon University, Pittsburgh, PA, USA b ESRC Centre for Research in Development, Instruction
More informationAppendices master s degree programme Human Machine Communication
Appendices master s degree programme Human Machine Communication 2015-2016 Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability
More informationAnalogy Engine. November Jay Ulfelder. Mark Pipes. Quantitative Geo-Analyst
Analogy Engine November 2017 Jay Ulfelder Quantitative Geo-Analyst 202.656.6474 jay@koto.ai Mark Pipes Chief of Product Integration 202.750.4750 pipes@koto.ai PROPRIETARY INTRODUCTION Koto s Analogy Engine
More informationScholarly Article Review. The Potential of Using Virtual Reality Technology in Physical Activity Settings. Aaron Krieger.
Scholarly Article Review The Potential of Using Virtual Reality Technology in Physical Activity Settings Aaron Krieger October 22, 2015 The Potential of Using Virtual Reality Technology in Physical Activity
More informationChess and Intelligence: Lessons for Scholastic Chess
Chess and Intelligence: Lessons for Scholastic Chess Fernand Gobet Giovanni Sala Department of Psychological Sciences Overview Relation between chess and intelligence Are chess players smarter than non-players?
More informationThe Roles of Recognition Processes and Look-Ahead Search in Time-Constrained Expert Problem Solving: Evidence from Grandmaster Level Chess
Recognition and Search in Simultaneous Chess 1 The Roles of Recognition Processes and Look-Ahead Search in Time-Constrained Expert Problem Solving: Evidence from Grandmaster Level Chess Fernand Gobet and
More informationIntelligent Systems. Lecture 1 - Introduction
Intelligent Systems Lecture 1 - Introduction In which we try to explain why we consider artificial intelligence to be a subject most worthy of study, and in which we try to decide what exactly it is Dr.
More informationUC Merced Proceedings of the Annual Meeting of the Cognitive Science Society
UC Merced Proceedings of the Annual Meeting of the Cognitive Science Society Title Chess Masters Hypothesis Testing Permalink https://escholarship.org/uc/item/2149d69v Journal Proceedings of the Annual
More informationQueen vs 3 minor pieces
Queen vs 3 minor pieces the queen, which alone can not defend itself and particular board squares from multi-focused attacks - pretty much along the same lines, much better coordination in defence: the
More informationSTRATEGO EXPERT SYSTEM SHELL
STRATEGO EXPERT SYSTEM SHELL Casper Treijtel and Leon Rothkrantz Faculty of Information Technology and Systems Delft University of Technology Mekelweg 4 2628 CD Delft University of Technology E-mail: L.J.M.Rothkrantz@cs.tudelft.nl
More informationExpert Chess Memory: Revisiting the Chunking Hypothesis
MEMORY, 1998, 6 (3), 225-255 Expert Chess Memory: Revisiting the Chunking Hypothesis Fernand Gobet and Herbert A. Simon Carnegie Mellon University, USA After reviewing the relevant theory on chess expertise,
More informationMy AI in Peace Machine
My AI in Peace Machine Timo Honkela University of Helsinki Finland MyData Conference Helsinki, FI, Aug 31, 2018 Personal timeline Born 1962 Mother died 1971 Quest for understanding MSc studies on human
More informationIntroduction to Artificial Intelligence. Department of Electronic Engineering 2k10 Session - Artificial Intelligence
Introduction to Artificial Intelligence What is Intelligence??? Intelligence is the ability to learn about, to learn from, to understand about, and interact with one s environment. Intelligence is the
More informationArgumentative Interactions in Online Asynchronous Communication
Argumentative Interactions in Online Asynchronous Communication Evelina De Nardis, University of Roma Tre, Doctoral School in Pedagogy and Social Service, Department of Educational Science evedenardis@yahoo.it
More informationArtificial Intelligence
Artificial Intelligence Chapter 1 Chapter 1 1 Outline What is AI? A brief history The state of the art Chapter 1 2 What is AI? Systems that think like humans Systems that think rationally Systems that
More informationarray of square cells as a sum of elements not of the "domino" form as in the Tough Hut problem, but of the form
Session 22 General Problem Solving feature of all of the problems discussed in this paper is that, in their initial formulation, they have a large number of elements with different names, and for this
More informationAlgorithms for Selective Search. Bouke van der Spoel
Algorithms for Selective Search Bouke van der Spoel March 8, 2007 2 Contents 1 Introduction 5 1.1 History................................ 5 1.2 Outline................................ 7 1.3 Relevance to
More informationRunning head: THINKING AND PROBLEM SOLVING IN CHESS. Thinking and Problem Solving in Chess: The Development of a Prototypical Model to Account
Thinking and Problem Solving Running head: THINKING AND PROBLEM SOLVING IN CHESS Thinking and Problem Solving in Chess: The Development of a Prototypical Model to Account for Performance on Chess Problem
More informationReview of the Research Trends and Development Trends of Library Science in China in the Past Ten Years
2017 3rd International Conference on Management Science and Innovative Education (MSIE 2017) ISBN: 978-1-60595-488-2 Review of the Research Trends and Development Trends of Library Science in China in
More information37 Game Theory. Bebe b1 b2 b3. a Abe a a A Two-Person Zero-Sum Game
37 Game Theory Game theory is one of the most interesting topics of discrete mathematics. The principal theorem of game theory is sublime and wonderful. We will merely assume this theorem and use it to
More informationWhat is the expected number of rolls to get a Yahtzee?
Honors Precalculus The Yahtzee Problem Name Bolognese Period A Yahtzee is rolling 5 of the same kind with 5 dice. The five dice are put into a cup and poured out all at once. Matching dice are kept out
More informationEnhanced MLP Input-Output Mapping for Degraded Pattern Recognition
Enhanced MLP Input-Output Mapping for Degraded Pattern Recognition Shigueo Nomura and José Ricardo Gonçalves Manzan Faculty of Electrical Engineering, Federal University of Uberlândia, Uberlândia, MG,
More informationThe Game-Theoretic Approach to Machine Learning and Adaptation
The Game-Theoretic Approach to Machine Learning and Adaptation Nicolò Cesa-Bianchi Università degli Studi di Milano Nicolò Cesa-Bianchi (Univ. di Milano) Game-Theoretic Approach 1 / 25 Machine Learning
More informationSpecialization Effect and Its Influence on Memory and Problem Solving in Expert Chess Players
Cognitive Science 33 (2009) 1117 1143 Copyright Ó 2009 Cognitive Science Society, Inc. All rights reserved. ISSN: 0364-0213 print / 1551-6709 online DOI: 10.1111/j.1551-6709.2009.01030.x Specialization
More informationArtificial Intelligence
Artificial Intelligence (Sistemas Inteligentes) Pedro Cabalar Depto. Computación Universidade da Coruña, SPAIN Chapter 1. Introduction Pedro Cabalar (UDC) ( Depto. AIComputación Universidade da Chapter
More informationData mining, Bongard problems, and the concept of pattern conception
Data mining, Bongard problems, and the concept of pattern conception A. Linhares Getulio Vargas Foundation, Brazil Abstract One of the major problems of data mining systems is the identification of classes,
More informationMAGNT Research Report (ISSN ) Vol.6(1). PP , Controlling Cost and Time of Construction Projects Using Neural Network
Controlling Cost and Time of Construction Projects Using Neural Network Li Ping Lo Faculty of Computer Science and Engineering Beijing University China Abstract In order to achieve optimized management,
More informationTransactions on Information and Communications Technologies vol 1, 1993 WIT Press, ISSN
Combining multi-layer perceptrons with heuristics for reliable control chart pattern classification D.T. Pham & E. Oztemel Intelligent Systems Research Laboratory, School of Electrical, Electronic and
More informationFuzzy-Heuristic Robot Navigation in a Simulated Environment
Fuzzy-Heuristic Robot Navigation in a Simulated Environment S. K. Deshpande, M. Blumenstein and B. Verma School of Information Technology, Griffith University-Gold Coast, PMB 50, GCMC, Bundall, QLD 9726,
More informationCambrian Intelligence: The Early History Of The New AI PDF
Cambrian Intelligence: The Early History Of The New AI PDF Until the mid-1980s, AI researchers assumed that an intelligent system doing high-level reasoning was necessary for the coupling of perception
More informationChess Skill in Man and Machine
Chess Skill in Man and Machine Chess Skill in Man and Machine Edited by Peter W. Frey With 104 Illustrations Springer-Verlag New York Berlin Heidelberg Tokyo Peter W. Frey Northwestern University CRESAP
More informationRecall or evaluation of chess positions as determinants of chess skill
Memory & Cognition 1982, Vol. 10 (3),237-242 Recall or evaluation of chess positions as determinants of chess skill DENNIS H. HOLDING University oflouisville, Louisville, Kentucky 40292 and ROBERT I. REYNOLDS
More informationA Kinect-based 3D hand-gesture interface for 3D databases
A Kinect-based 3D hand-gesture interface for 3D databases Abstract. The use of natural interfaces improves significantly aspects related to human-computer interaction and consequently the productivity
More informationA Three Cycle View of Design Science Research
Scandinavian Journal of Information Systems Volume 19 Issue 2 Article 4 2007 A Three Cycle View of Design Science Research Alan R. Hevner University of South Florida, ahevner@usf.edu Follow this and additional
More informationAIEDAM Special Issue: Sketching, and Pen-based Design Interaction Edited by: Maria C. Yang and Levent Burak Kara
AIEDAM Special Issue: Sketching, and Pen-based Design Interaction Edited by: Maria C. Yang and Levent Burak Kara Sketching has long been an essential medium of design cognition, recognized for its ability
More informationArtificial Intelligence. An Introductory Course
Artificial Intelligence An Introductory Course 1 Outline 1. Introduction 2. Problems and Search 3. Knowledge Representation 4. Advanced Topics - Game Playing - Uncertainty and Imprecision - Planning -
More informationHuman Vision and Human-Computer Interaction. Much content from Jeff Johnson, UI Wizards, Inc.
Human Vision and Human-Computer Interaction Much content from Jeff Johnson, UI Wizards, Inc. are these guidelines grounded in perceptual psychology and how can we apply them intelligently? Mach bands:
More informationNonuniform multi level crossing for signal reconstruction
6 Nonuniform multi level crossing for signal reconstruction 6.1 Introduction In recent years, there has been considerable interest in level crossing algorithms for sampling continuous time signals. Driven
More informationTHROUGH THE LOOKING GLASS CHESS
THROUGH THE LOOKING GLASS CHESS Camille Arnett Granger, Indiana Through the Looking Glass Project Explanation For this project I wanted to do a variation on the traditional game of chess that reflects
More informationNew developments in the philosophy of AI. Vincent C. Müller. Anatolia College/ACT February 2015
Müller, Vincent C. (2016), New developments in the philosophy of AI, in Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence (Synthese Library; Berlin: Springer). http://www.sophia.de
More informationCOMPLEXITY MEASURES OF DESIGN DRAWINGS AND THEIR APPLICATIONS
The Ninth International Conference on Computing in Civil and Building Engineering April 3-5, 2002, Taipei, Taiwan COMPLEXITY MEASURES OF DESIGN DRAWINGS AND THEIR APPLICATIONS J. S. Gero and V. Kazakov
More informationCover Page. The handle holds various files of this Leiden University dissertation.
Cover Page The handle http://hdl.handle.net/1887/20184 holds various files of this Leiden University dissertation. Author: Mulinski, Ksawery Title: ing structural supply chain flexibility Date: 2012-11-29
More informationDeepStack: Expert-Level AI in Heads-Up No-Limit Poker. Surya Prakash Chembrolu
DeepStack: Expert-Level AI in Heads-Up No-Limit Poker Surya Prakash Chembrolu AI and Games AlphaGo Go Watson Jeopardy! DeepBlue -Chess Chinook -Checkers TD-Gammon -Backgammon Perfect Information Games
More informationARGUING THE SAFETY OF MACHINE LEARNING FOR HIGHLY AUTOMATED DRIVING USING ASSURANCE CASES LYDIA GAUERHOF BOSCH CORPORATE RESEARCH
ARGUING THE SAFETY OF MACHINE LEARNING FOR HIGHLY AUTOMATED DRIVING USING ASSURANCE CASES 14.12.2017 LYDIA GAUERHOF BOSCH CORPORATE RESEARCH Arguing Safety of Machine Learning for Highly Automated Driving
More informationDesign Science Research Methods. Prof. Dr. Roel Wieringa University of Twente, The Netherlands
Design Science Research Methods Prof. Dr. Roel Wieringa University of Twente, The Netherlands www.cs.utwente.nl/~roelw UFPE 26 sept 2016 R.J. Wieringa 1 Research methodology accross the disciplines Do
More informationThe essential role of. mental models in HCI: Card, Moran and Newell
1 The essential role of mental models in HCI: Card, Moran and Newell Kate Ehrlich IBM Research, Cambridge MA, USA Introduction In the formative years of HCI in the early1980s, researchers explored the
More informationA Heuristic Based Approach for a Betting Strategy. in Texas Hold em Poker
DEPARTMENT OF COMPUTER SCIENCE SERIES OF PUBLICATIONS C REPORT C-2008-41 A Heuristic Based Approach for a Betting Strategy in Texas Hold em Poker Teemu Saukonoja and Tomi A. Pasanen UNIVERSITY OF HELSINKI
More informationa b c d e f g h i j k l m n
Shoebox, page 1 In his book Chess Variants & Games, A. V. Murali suggests playing chess on the exterior surface of a cube. This playing surface has intriguing properties: We can think of it as three interlocked
More informationCMSC 421, Artificial Intelligence
Last update: January 28, 2010 CMSC 421, Artificial Intelligence Chapter 1 Chapter 1 1 What is AI? Try to get computers to be intelligent. But what does that mean? Chapter 1 2 What is AI? Try to get computers
More informationImpediments to designing and developing for accessibility, accommodation and high quality interaction
Impediments to designing and developing for accessibility, accommodation and high quality interaction D. Akoumianakis and C. Stephanidis Institute of Computer Science Foundation for Research and Technology-Hellas
More informationPatentability of Computer-Implemented Inventions in the field of Computer Security
Patentability of Computer-Implemented Inventions in the field of Computer Security Erik Veillas Patent Examiner, Cluster Computers European Patent Office TU München Munich, 21 June 2011 Acknowledgments
More informationAutomatic Locating the Centromere on Human Chromosome Pictures
Automatic Locating the Centromere on Human Chromosome Pictures M. Moradi Electrical and Computer Engineering Department, Faculty of Engineering, University of Tehran, Tehran, Iran moradi@iranbme.net S.
More informationFigure 1. Artificial Neural Network structure. B. Spiking Neural Networks Spiking Neural networks (SNNs) fall into the third generation of neural netw
Review Analysis of Pattern Recognition by Neural Network Soni Chaturvedi A.A.Khurshid Meftah Boudjelal Electronics & Comm Engg Electronics & Comm Engg Dept. of Computer Science P.I.E.T, Nagpur RCOEM, Nagpur
More informationINTERNATIONAL CONFERENCE ON ENGINEERING DESIGN ICED 03 STOCKHOLM, AUGUST 19-21, 2003
INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN ICED 03 STOCKHOLM, AUGUST 19-21, 2003 A KNOWLEDGE MANAGEMENT SYSTEM FOR INDUSTRIAL DESIGN RESEARCH PROCESSES Christian FRANK, Mickaël GARDONI Abstract Knowledge
More informationMathematics has a bad reputation. implies that. teaching and learning should be somehow related with the psychological situation of the learner
Mathematics has a bad reputation implies that teaching and learning should be somehow related with the psychological situation of the learner Lenni Haapasalo, University of Joensuu What can be learned
More informationImplementation of Text to Speech Conversion
Implementation of Text to Speech Conversion Chaw Su Thu Thu 1, Theingi Zin 2 1 Department of Electronic Engineering, Mandalay Technological University, Mandalay 2 Department of Electronic Engineering,
More informationCOMP219: COMP219: Artificial Intelligence Artificial Intelligence Dr. Annabel Latham Lecture 12: Game Playing Overview Games and Search
COMP19: Artificial Intelligence COMP19: Artificial Intelligence Dr. Annabel Latham Room.05 Ashton Building Department of Computer Science University of Liverpool Lecture 1: Game Playing 1 Overview Last
More informationCombined Approach for Face Detection, Eye Region Detection and Eye State Analysis- Extended Paper
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 10, Issue 9 (September 2014), PP.57-68 Combined Approach for Face Detection, Eye
More informationIntroduction to Artificial Intelligence: cs580
Office: Nguyen Engineering Building 4443 email: zduric@cs.gmu.edu Office Hours: Mon. & Tue. 3:00-4:00pm, or by app. URL: http://www.cs.gmu.edu/ zduric/ Course: http://www.cs.gmu.edu/ zduric/cs580.html
More informationDigital Image Processing 3/e
Laboratory Projects for Digital Image Processing 3/e by Gonzalez and Woods 2008 Prentice Hall Upper Saddle River, NJ 07458 USA www.imageprocessingplace.com The following sample laboratory projects are
More informationRecently, a winning opening for the game of Dakon was found by hand. This
Human versus Machine Problem-Solving: Winning Openings in Dakon / Jeroen Donkers (1), Alex de Voogt (2), Jos Uiterwijk (1) Recently, a winning opening for the game of Dakon was found by hand. This sequence
More informationRunning an HCI Experiment in Multiple Parallel Universes
Author manuscript, published in "ACM CHI Conference on Human Factors in Computing Systems (alt.chi) (2014)" Running an HCI Experiment in Multiple Parallel Universes Univ. Paris Sud, CNRS, Univ. Paris Sud,
More informationSECOND YEAR PROJECT SUMMARY
SECOND YEAR PROJECT SUMMARY Grant Agreement number: 215805 Project acronym: Project title: CHRIS Cooperative Human Robot Interaction Systems Period covered: from 01 March 2009 to 28 Feb 2010 Contact Details
More informationChase, W. G., & Simon, H. A. (1973). Perception in chess. Cognitive Psychology, 4,
Episode 07 : That Blows Chunks: Increasing Working Memory Show Notes One constraint that everyone has is working memory capacity. Or in other words, how many things you can remember at any one point in
More informationCONCURRENT AND RETROSPECTIVE PROTOCOLS AND COMPUTER-AIDED ARCHITECTURAL DESIGN
CONCURRENT AND RETROSPECTIVE PROTOCOLS AND COMPUTER-AIDED ARCHITECTURAL DESIGN JOHN S. GERO AND HSIEN-HUI TANG Key Centre of Design Computing and Cognition Department of Architectural and Design Science
More informationMINE 432 Industrial Automation and Robotics
MINE 432 Industrial Automation and Robotics Part 3, Lecture 5 Overview of Artificial Neural Networks A. Farzanegan (Visiting Associate Professor) Fall 2014 Norman B. Keevil Institute of Mining Engineering
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 informationVisual Search using Principal Component Analysis
Visual Search using Principal Component Analysis Project Report Umesh Rajashekar EE381K - Multidimensional Digital Signal Processing FALL 2000 The University of Texas at Austin Abstract The development
More informationGrade 2 Math Unit 6 Measurement and Data
Grade 2 Math Unit 6 Measurement and Data 2.MD.1 UNIT OVERVIEW Grade 2 math instructions centers arond 4 Critical Focus Areas. This unit addresses work in Critical Focus Area #3, Using standard units of
More informationSegmentation using Saturation Thresholding and its Application in Content-Based Retrieval of Images
Segmentation using Saturation Thresholding and its Application in Content-Based Retrieval of Images A. Vadivel 1, M. Mohan 1, Shamik Sural 2 and A.K.Majumdar 1 1 Department of Computer Science and Engineering,
More informationCS 229 Final Project: Using Reinforcement Learning to Play Othello
CS 229 Final Project: Using Reinforcement Learning to Play Othello Kevin Fry Frank Zheng Xianming Li ID: kfry ID: fzheng ID: xmli 16 December 2016 Abstract We built an AI that learned to play Othello.
More informationEVALUATING THE CREATIVITY OF A PRODUCT USING CREATIVITY MEASUREMENT TOOL (CMET)
EVALUATING THE CREATIVITY OF A PRODUCT USING CREATIVITY MEASUREMENT TOOL (CMET) Siti Norzaimalina Abd Majid, Hafizoah Kassim, Munira Abdul Razak Center for Modern Languages and Human Sciences Universiti
More informationArtificial Intelligence
Artificial Intelligence Chapter 1 Chapter 1 1 Outline What is AI? A brief history The state of the art Chapter 1 2 What is AI? Systems that think like humans Systems that think rationally Systems that
More informationThe Statistics of Visual Representation Daniel J. Jobson *, Zia-ur Rahman, Glenn A. Woodell * * NASA Langley Research Center, Hampton, Virginia 23681
The Statistics of Visual Representation Daniel J. Jobson *, Zia-ur Rahman, Glenn A. Woodell * * NASA Langley Research Center, Hampton, Virginia 23681 College of William & Mary, Williamsburg, Virginia 23187
More informationTowards the Unification of Intuitive and Formal Game Concepts with Applications to Computer Chess
Towards the Unification of Intuitive and Formal Game Concepts with Applications to Computer Chess Ariel Arbiser Dept. of Computer Science, FCEyN, University of Buenos Aires Ciudad Universitaria, Pabellón
More information