SAL: A Game Learning Machine Joel Paulson & Brian Lanners.

Slides:



Advertisements
Similar presentations
Pattern Association.
Advertisements

Ch 4. Heuristic Search 4.0 Introduction(Heuristic)
Decision Tree Approach in Data Mining
Randomized Strategies and Temporal Difference Learning in Poker Michael Oder April 4, 2002 Advisor: Dr. David Mutchler.
10/29/01Reinforcement Learning in Games 1 Colin Cherry Oct 29/01.
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Programme By James Mannion Computer Systems.
Knowledge Representation and Reasoning Learning Sets of Rules and Analytical Learning Harris Georgiou – 4.
Combining Inductive and Analytical Learning Ch 12. in Machine Learning Tom M. Mitchell 고려대학교 자연어처리 연구실 한 경 수
An Introduction to Machine Learning In the area of AI (earlier) machine learning took a back seat to Expert Systems Expert system development usually consists.
1 Heuristic Search 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games.
Artificial Neural Networks Artificial Neural Networks are (among other things) another technique for supervised learning k-Nearest Neighbor Decision Tree.
Game Tree Search based on Russ Greiner and Jean-Claude Latombe’s notes.
October 7, 2010Neural Networks Lecture 10: Setting Backpropagation Parameters 1 Creating Data Representations On the other hand, sets of orthogonal vectors.
Computer Game and Simulation Programming Michael Chi.
Intelligent Tutoring Systems Traditional CAI Fully specified presentation text Canned questions and associated answers Lack the ability to adapt to students.
Machine Learning CS 165B Spring 2012
Artificial Intelligence By Ryan Shoultes & Jeremy Creighton.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Game Playing. Introduction Why is game playing so interesting from an AI point of view? –Game Playing is harder then common searching The search space.
Temporal Difference Learning By John Lenz. Reinforcement Learning Agent interacting with environment Agent receives reward signal based on previous action.
Co-evolution time, changing environments agents. Static search space  solutions are determined by the optimization process only, by doing variation and.
Artificial Neural Networks
© N. Kasabov Foundations of Neural Networks, Fuzzy Systems, and Knowledge Engineering, MIT Press, 1996 INFO331 Machine learning. Neural networks. Supervised.
Computing & Information Sciences Kansas State University Wednesday, 13 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 9 of 42 Wednesday, 13 September.
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Temperature Discovery Search Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature.
Evaluation Function in Game Playing Programs M1 Yasubumi Nozawa Chikayama & Taura Lab.
MICHAEL FINE Artificial Intelligence and The Singularity 1.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 9 of 14 Friday, 10 September.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
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.
1 Phase II - Checkers Operator: Eric Bengfort Temporal Status: End of Week Five Location: Phase Two Presentation Systems Check: Checkers Checksum Passed.
Introduction to Artificial Intelligence and Soft Computing
Computer Go : A Go player Rohit Gurjar CS365 Project Presentation, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Dr. Z. R. Ghassabi Spring 2015 Deep learning for Human action Recognition 1.
Well Posed Learning Problems Must identify the following 3 features –Learning Task: the thing you want to learn. –Performance measure: must know when you.
Machine Learning for an Artificial Intelligence Playing Tic-Tac-Toe Computer Systems Lab 2005 By Rachel Miller.
Computing & Information Sciences Kansas State University Wednesday, 12 Sep 2007CIS 530 / 730: Artificial Intelligence Lecture 9 of 42 Wednesday, 12 September.
Game Playing. Introduction One of the earliest areas in artificial intelligence is game playing. Two-person zero-sum game. Games for which the state space.
Jack Chen TJHSST Computer Systems Lab Abstract The purpose of this project is to explore Artificial Intelligence techniques in the board game.
Blondie24 Presented by Adam Duffy and Josh Hill. Overview Introduction to new concepts Design of Blondie24 Testing and results Other approaches to checkers.
Outline Intro to Representation and Heuristic Search Machine Learning (Clustering) and My Research.
Carla P. Gomes CS4700 CS 4701: Practicum in Artificial Intelligence Carla P. Gomes
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 9 of 42 Wednesday, 14.
DEEP RED An Intelligent Approach to Chinese Checkers.
WEEK INTRODUCTION IT440 ARTIFICIAL INTELLIGENCE.
Pac-Man AI using GA. Why Machine Learning in Video Games? Better player experience Agents can adapt to player Increased variety of agent behaviors Ever-changing.
Data Mining and Decision Support
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Program By James Mannion Computer Systems.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
Reinforcement Learning AI – Week 22 Sub-symbolic AI Two: An Introduction to Reinforcement Learning Lee McCluskey, room 3/10
HEURISTIC SEARCH 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games 4.4Complexity.
Playing Tic-Tac-Toe with Neural Networks
Adversarial Search. Game playing u Multi-agent competitive environment u The most common games are deterministic, turn- taking, two-player, zero-sum game.
Backgammon Group 1: - Remco Bras - Tim Beyer - Maurice Hermans - Esther Verhoef - Thomas Acker.
A Scalable Machine Learning Approach to Go Pierre Baldi and Lin Wu UC Irvine.
Mehdi Ghayoumi MSB rm 132 Ofc hr: Thur, a Machine Learning.
1 Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Intelligent Systems Laboratory.
Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.
Multiplication Timed Tests.
By James Mannion Computer Systems Lab Period 3
Review of AI Professor: Liqing Zhang
The Implementation of Machine Learning in the Game of Checkers
Introduction to Artificial Intelligence and Soft Computing
Prepared by: Mahmoud Rafeek Al-Farra
Future of Artificial Intelligence
Introduction to Neural Networks
Artificial Intelligence Machine Learning
Presentation transcript:

SAL: A Game Learning Machine Joel Paulson & Brian Lanners

Introduction Why AI game playing? Why AI game playing? Why AI game learning? Why AI game learning? SAL (Michael Gherrity, 1993) SAL (Michael Gherrity, 1993) Search and Learning Search and Learning

Consistency Search Basic Concept Basic Concept Reasons for Use Reasons for Use  Allows for Errors in Evaluation Function  Pathological Games

Procedure Consistent Positions Consistent Positions  Evaluation of a position is equal to its minimax value Inconsistent Positions Inconsistent Positions  Identifying and Correcting Errors

General Example If B is inconsistent, then one of the evaluations of B, D, or E is incorrect If B is inconsistent, then one of the evaluations of B, D, or E is incorrect

Consistency Search in Play

Organization of SAL Game Independent Kernel Game Independent Kernel  Consistency Search Algorithm  Evaluation Functions Game Specific Move Generator Game Specific Move Generator  Incorporates rules of game  Three Subroutines: MoveGenerator, MakeMove, EndOfGame

Features Used as input for Neural Network Used as input for Neural Network Feature Discovery Problem Feature Discovery Problem Features in SAL Features in SAL

Neural Networks SAL uses features for Input SAL uses features for Input Weights altered following each game using Temporal Difference Learning Weights altered following each game using Temporal Difference Learning

Performance of SAL Tic-Tac-Toe Tic-Tac-Toe Connect Four Connect Four Chess Chess