Blondie24 Presented by Adam Duffy and Josh Hill. Overview Introduction to new concepts Design of Blondie24 Testing and results Other approaches to checkers.

Slides:



Advertisements
Similar presentations
Game Playing CS 63 Chapter 6
Advertisements

Artificial Intelligence Presentation
Adversarial Search We have experience in search where we assume that we are the only intelligent being and we have explicit control over the “world”. Lets.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
For Friday Finish chapter 5 Program 1, Milestone 1 due.
For Monday Read chapter 7, sections 1-4 Homework: –Chapter 4, exercise 1 –Chapter 5, exercise 9.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2008.
COMP-4640: Intelligent & Interactive Systems Game Playing A game can be formally defined as a search problem with: -An initial state -a set of operators.
Adversarial Search CSE 473 University of Washington.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Computers Playing Games Arif Zaman CS 101. Acknowledgements Portions of this are taken from MIT’s open-courseware
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.
Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
The Implementation of Machine Learning in the Game of Checkers Billy Melicher Computer Systems lab
GENETIC PROGRAMMING FOR CHECKERS PLAY Dustin Shutes Abstract: This project uses genetic programming to develop a program that plays the game of checkers.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Using Neural Networks Presentation for IEEE Congress on Evolutionary Computing.
Applying Genetic Programming to Stratego Ryan Albarelli.
ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2006.
Adversarial Search: Game Playing Reading: Chess paper.
CSE (c) S. Tanimoto, 2008 Alpha-Beta Search 1 Alpha-Beta Search Outline: Two-person, zero-sum, perfect info games. Static evaluation functions.
Othello Sean Farrell June 29, Othello Two-player game played on 8x8 board All pieces have one white side and one black side Initial board setup.
Alpha-Beta Search. 2 Two-player games The object of a search is to find a path from the starting position to a goal position In a puzzle-type problem,
Ocober 10, 2012Introduction to Artificial Intelligence Lecture 9: Machine Evolution 1 The Alpha-Beta Procedure Example: max.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
1 Adversary Search Ref: Chapter 5. 2 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans.
Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.
Minimax Trees: Utility Evaluation, Tree Evaluation, Pruning CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 2 Adapted from slides of Yoonsuck.
CISC 235: Topic 6 Game Trees.
Co-evolution time, changing environments agents. Static search space  solutions are determined by the optimization process only, by doing variation and.
1 Learning Agents Laboratory Computer Science Department George Mason University Prof. Gheorghe Tecuci 3. Rote Learning.
An Introduction to Artificial Intelligence and Knowledge Engineering N. Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering,
Introduction Many decision making problems in real life
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Hybrid Systems. Hybridization Integrated architectures for machine learning have been shown to provide performance improvements over single representation.
Game-playing AIs Part 1 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part I (this set of slides)  Motivation  Game Trees  Evaluation.
(Particle Swarm Optimisation)
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.
For Friday Finish reading chapter 7 Homework: –Chapter 6, exercises 1 (all) and 3 (a-c only)
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
1 Adversarial Search CS 171/271 (Chapter 6) Some text and images in these slides were drawn from Russel & Norvig’s published material.
For Wednesday Read chapter 7, sections 1-4 Homework: –Chapter 6, exercise 1.
 2003, G.Tecuci, Learning Agents Laboratory 1 Learning Agents Laboratory Computer Science Department George Mason University Prof. Gheorghe Tecuci 2.
Cilk Pousse James Process CS534. Overview Introduction to Pousse Searching Evaluation Function Move Ordering Conclusion.
For Friday Finish chapter 6 Program 1, Milestone 1 due.
Evolutionary Programming
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
SAL: A Game Learning Machine Joel Paulson & Brian Lanners.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Learning to Play the Game of GO Lei Li Computer Science Department May 3, 2007.
The Standard Genetic Algorithm Start with a “population” of “individuals” Rank these individuals according to their “fitness” Select pairs of individuals.
Adversarial Search and Game Playing Russell and Norvig: Chapter 6 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2004/home.htm Prof: Dekang.
February 25, 2016Introduction to Artificial Intelligence Lecture 10: Two-Player Games II 1 The Alpha-Beta Procedure Can we estimate the efficiency benefit.
Evolutionary Programming A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Chapter 5.
Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
An Evolutionary Algorithm for Neural Network Learning using Direct Encoding Paul Batchis Department of Computer Science Rutgers University.
A Presentation on Adaptive Neuro-Fuzzy Inference System using Particle Swarm Optimization and it’s Application By Sumanta Kundu (En.R.No.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Optimizing Minmax Alpha-Beta Pruning Real Time Decisions
The Implementation of Machine Learning in the Game of Checkers
The Implementation of Machine Learning in the Game of Checkers
Training Neural networks to play checkers
Training Neural networks to play checkers
The Alpha-Beta Procedure
CSE (c) S. Tanimoto, 2007 Search 2: AlphaBeta Pruning
Unit II Game Playing.
Presentation transcript:

Blondie24 Presented by Adam Duffy and Josh Hill

Overview Introduction to new concepts Design of Blondie24 Testing and results Other approaches to checkers Other approaches to evolutionary computation Why is this important?

Neural Networks Nodes connected by links – Input nodes – Hidden nodes – Output nodes Links have weights

Evolutionary Computation Based on natural selection – Initialize population – Fitness function – Selection – Cross-over – Mutation

Design of Blondie24 Checkers neural network Values for input nodes – Red – positive – White – negative – Empty – zero Piece differential

Design of Blondie24 Connections between squares Subsections

Design of Blondie24 Search methods – Minimax – Alpha-beta pruning – Iterative deepening – Quiescent – Hash table of previously evaluated positions (maximum of 270,000)

Design of Blondie24 Initial population of 30 Each neural network plays 5 games as red – +1 for a win – 0 for a draw – -2 for a loss Top 15 kept, lowest 15 eliminated Copy top 15 and mutate the weights

Blondie24: Advantages Can learn new strategies Doesn’t have human biases

Blondie24: Disadvantages Long time Doesn’t make use of expert knowledge

Tests 400 MHz Pentium II 840 th generation Played games on zone.com 165 games total (84 as red, 81 as white)

Results zone.com rating: In top 500 of over 120,000 Better than 99.61% of registered players

Chinook Primary feature - piece count Looks for certain features Over 40,000 opening lines of play Every ending with <= 8 pieces Higher value to positions with more pieces Rated 2,814 at retirement in 1996

Different Evolutionary Approach Particle Swarm Optimizers (PSO) Each particle is moved closer to – Global best – Personal best so far

Other applications Industry, medicine, and defense Pattern recognition Cancer

More information Blondie 24: Playing at the Edge of AI by David B. Fogel Learning to play games using a PSO-based competitive learning approach by L. Messeischmidt and A.P. Engelbrecht The Advantages of Evolutionary Computation by David B. Fogel Solving the Game of Checkers by Jonathan Schaeffer and Robert Lake