Integrating CWU Chess in the ARENA Chess GUI Kyle Littlefield - CS Department Advisor: Razvan Andonie 1 Symposium On University Research and Creative Expression.

Slides:



Advertisements
Similar presentations
Brainy: Effective Selection of Data Structures. Why data structure selection is important How to choose the best data structure for a specific application.
Advertisements

EE 690 Design of Embodied Intelligence
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
NVIS: An Interactive Visualization Tool for Neural Networks Matt Streeter Prof. Matthew O. Ward by Prof. Sergio A. Alvarez advised by and.
EA, neural networks & fuzzy systems Michael J. Watts
UNIVERSITY OF JYVÄSKYLÄ Building NeuroSearch – Intelligent Evolutionary Search Algorithm For Peer-to-Peer Environment Master’s Thesis by Joni Töyrylä
Particle Swarm Optimization (PSO)  Kennedy, J., Eberhart, R. C. (1995). Particle swarm optimization. Proc. IEEE International Conference.
Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.
Handwritten Character Recognition Using Artificial Neural Networks Shimie Atkins & Daniel Marco Supervisor: Johanan Erez Technion - Israel Institute of.
Evolutionary Algorithms Simon M. Lucas. The basic idea Initialise a random population of individuals repeat { evaluate select vary (e.g. mutate or crossover)
Neural Optimization of Evolutionary Algorithm Strategy Parameters Hiral Patel.
16 November, 2005 Statistics in HEP, Manchester 1.
國立陽明大學生資學程 陳虹瑋. Genetic Algorithm Background Fitness function ……. population selection Cross over mutation Fitness values Random cross over.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
Genetic Algorithms and Ant Colony Optimisation
Chapter 11: Artificial Intelligence
Chapter 10 Artificial Intelligence. © 2005 Pearson Addison-Wesley. All rights reserved 10-2 Chapter 10: Artificial Intelligence 10.1 Intelligence and.
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
C. Benatti, 3/15/2012, Slide 1 GA/ICA Workshop Carla Benatti 3/15/2012.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
An Introduction to Artificial Intelligence and Knowledge Engineering N. Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering,
AD FOR GAMES Lecture 4. M INIMAX AND A LPHA -B ETA R EDUCTION Borrows from Spring 2006 CS 440 Lecture Slides.
GUI For A Virtual Pipeline Simulation Testbed By, Revathi Manni Ranganathan Major Professor: Dr.Virgil Wallentine.
LINEAR CLASSIFICATION. Biological inspirations  Some numbers…  The human brain contains about 10 billion nerve cells ( neurons )  Each neuron is connected.
Artificial Intelligence Lecture No. 29 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Supervisor: Dr. Eddie Jones Co-supervisor: Dr Martin Glavin Electronic Engineering Department Final Year Project 2008/09 Development of a Speaker Recognition/Verification.
Othello Playing AI Matt Smith. Othello 8x8 Board game 8x8 Board game Try to outflank opponents pieces Try to outflank opponents pieces Winner ends up.
Application of Artificial Intelligence to Chess Playing Jason Cook Capstone Project.
1 Computing in High Energy and Nuclear Physics, February 2006, Mumbai, India.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Genetic Programming Lab For Chess Hadar Rottenberg & Nizan Freedman.
Evolutionary Art with Multiple Expression Programming By Quentin Freeman.
1 Machine Learning 1.Where does machine learning fit in computer science? 2.What is machine learning? 3.Where can machine learning be applied? 4.Should.
I Robot.
Genetic Algorithms. Evolutionary Methods Methods inspired by the process of biological evolution. Main ideas: Population of solutions Assign a score or.
István Lőrentz 1 Mihaela Malita 2 Răzvan Andonie 3 Mihaela MalitaRăzvan Andonie 3 (presenter) 1 Electronics and Computers Department, Transylvania University.
1 Genetic Algorithms and Ant Colony Optimisation.
Chapter 4 Decision Support System & Artificial Intelligence.
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Project 2: Classification Using Genetic Programming Kim, MinHyeok Biointelligence laboratory Artificial.
Department of Mechanical Engineering, LSUSession VII MATLAB Tutorials Session VII Introduction to SIMULINK Rajeev Madazhy
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Implementing Local Relative Sensitivity Pruning Paul Victorey.

A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
Department of Communication Engineering, NCTU 1 Title of Your Project Name.
Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
George Yauneridge.  Machine learning basics  Types of learning algorithms  Genetic algorithm basics  Applications and the future of genetic algorithms.
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Ghent University Backpropagation for Population-Temporal Coded Spiking Neural Networks July WCCI/IJCNN 2006 Benjamin Schrauwen and Jan Van Campenhout.
Evolutionary Computation Evolving Neural Network Topologies.
Chapter 11: Artificial Intelligence
Chapter 11: Artificial Intelligence
The life cycle.
2006 IEEE World Congress on Computational Intelligence, International Joint Conference on Neural Networks (IJCNN) Evolutionary Search for Interesting Behavior.
The Evolution of Learning Algorithms for Artificial Neural Networks
R. Hayden Anderson & Kyle Prouty
Evolutionary Algorithms for Hyperparameter Optimization
Review NNs Processing Principles in Neuron / Unit
CS621: Artificial Intelligence Lecture 18: Feedforward network contd
Presentation transcript:

Integrating CWU Chess in the ARENA Chess GUI Kyle Littlefield - CS Department Advisor: Razvan Andonie 1 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

Program Collaborators  Ashur Odah (graduated 2004)  Pushpinder Heer (graduated 2004)  Joseph Lemnley (graduated 2006)  Jonathan Widger (graduated 2006)  Berk Erkul (graduated 2007)  Lukas Magill (graduated 2008)  Kyle Littlefield (currently enrolled) 2 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

The CWU Chess Program  Genetic Algorithm trains 10 separate weights used in the neural network.  Increases in skill level per set of 10 games. 3 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

What is a Neural Network?  It Starts with the basic unit called a Neuron  Takes continuous input from an external source  Projects output based on the sum of the inputs and threshold of the neuron.  A neural network is excellent at classifying an input to an output.  Outputs the “learned” result from the acquired input. 4 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

Criteria used by Neural Network Carrascal, A, Manrique, D, & Rios, J Neural networks evolutionary learning in chess game. 5 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

What is a Genetic Algorithm?  Uses a population of chromosomes  Each chromosome represents an individual.  Has a fitness value representing how well it survives in this world 6 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

The Goal…  To optimize the population Find the individuals with the highest fitness. Avoid getting caught in a local optima 7 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

The CWU Chess Program  Genetic Algorithm trains 10 separate weights used in the neural network.  Increases in skill level per set of 10 games.  Neural Network controls the behavior of an Alpha-Beta Search algorithm. 8 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

What is an Alpha-Beta Search?  A search algorithm Seeks to reduce the number of nodes evaluated in a search tree Cut Off Region Node being Examined  No need to evaluate the left branch of the examined node.  The value will be 1 or less.  The root will be 8. 9 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

CWU Chess Program Running 10 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

The Problem  The CWU-Chess program used a Windows Form for a User Interface. This didn’t allow for communications with other chess interfaces or engines.  The Universal Chess Interface (UCI) Protocol allowed this to happen. 11 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

The UCI Protocol  Uses the console to communicate between the User Interface and the Chess Engine.  Communication is performed by sending and receiving textual information. 12 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

Implementation  Remove the Windows Form Interface and all dependencies to it.  Parse UCI Commands and parameters.  Use them to control the engine.  Redesign Genetic Algorithm fitness function and network parameters. 13 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009

UCI Chess Running On ARENA 14 Symposium On University Research and Creative Expression (SOURCE2009), Central Washington University, Ellensburg, USA, May 21st 2009