1 CS 4701 – Project Proposal Jane Park (jp624) Ran Zhao (rz54)

Slides:



Advertisements
Similar presentations
1 Machine Learning: Lecture 1 Overview of Machine Learning (Based on Chapter 1 of Mitchell T.., Machine Learning, 1997)
Advertisements

7.1. O SCARS & A RTIFICIAL I NTELLIGENCE Interim awards and introduction to game AI.
CS 4701 – Practicum in Artificial Intelligence Pre-proposal Presentation TEAM SKYNET: Brian Nader Stephen Stinson Rei Suzuki.
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.
Playing Tic Tac Toe with Neural Networks Justin Herbrand CS/ECE/ME 539.
Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Programme By James Mannion Computer Systems.
Top-Down Design CSC 161: The Art of Programming Prof. Henry Kautz 9/16/2009.
Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.
Artificial Intelligence in Game Design
CS AI Practicum Fall Robot Downey Jr Will Kiffer Joey Staehle Andrew Bunyea.
Probability CSE 473 – Autumn 2003 Henry Kautz. ExpectiMax.
1er. Escuela Red ProTIC - Tandil, de Abril, Introduction How to program computers to learn? Learning: Improving automatically with experience.
Learning C++ the Fun Way Taesoo Kim Dr. Ramon Lawrence Computer Science.
Learning Shape in Computer Go David Silver. A brief introduction to Go Black and white take turns to place down stones Once played, a stone cannot move.
Reinforcement Learning in Real-Time Strategy Games Nick Imrei Supervisors: Matthew Mitchell & Martin Dick.
Reinforcement Learning
And Just Games etc.. EVOLUTION OF COMPUTER GAMES PongOdyssey Beginning of the use of microprocessors ATARI VCS system bit.
Applying Genetic Programming to Stratego Ryan Albarelli.
Online Chess Project 3 Due date: April 17 th. Introduction Third in series of three projects This project focuses on adding online support –2 players.
Adversarial Search: Game Playing Reading: Chess paper.
Monte Carlo Go Has a Way to Go Haruhiro Yoshimoto (*1) Kazuki Yoshizoe (*1) Tomoyuki Kaneko (*1) Akihiro Kishimoto (*2) Kenjiro Taura (*1) (*1)University.
Institute for Theoretical Computer ScienceCGAIDE, Reading UK, 10 th November 2004 Reinforcement Learning of Strategies for Settlers of Catan Michael Pfeiffer.
Reinforcement Learning in the Presence of Hidden States Andrew Howard Andrew Arnold {ah679
GoogolHex CS4701 Final Presentation Anand Bheemarajaiah Chet Mancini Felipe Osterling.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
Machine Learning Chapter 13. Reinforcement Learning
Upper Confidence Trees for Game AI Chahine Koleejan.
Othello Artificial Intelligence With Machine Learning
Artificial Intelligence in Games CA107 Topics in Computing Dr. David Sinclair School of Computer Applications
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Development of a Machine-Learning-Based AI For Go By Justin Park.
 Summary  How to Play Go  Project Details  Demo  Results  Conclusions.
AI PRACTICUM PROPOSAL Anand Bheemarajaiah, M.Eng. Chet Mancini, M.Eng. Felipe Osterling, Junior TA: Jason Yosinski.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 6 –Adversarial Search Thursday –AIMA, Ch. 6 –More Adversarial Search The “Luke.
1 Phase II - Checkers Operator: Eric Bengfort Temporal Status: End of Week Five Location: Phase Two Presentation Systems Check: Checkers Checksum Passed.
Computer Go : A Go player Rohit Gurjar CS365 Project Presentation, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Machine Learning for an Artificial Intelligence Playing Tic-Tac-Toe Computer Systems Lab 2005 By Rachel Miller.
CSC Intro. to Computing Lecture 22: Artificial Intelligence.
CHECKERS: TD(Λ) LEARNING APPLIED FOR DETERMINISTIC GAME Presented By: Presented To: Amna Khan Mis Saleha Raza.
CIS Humanoid Hand Team Members: Tom Billings, Mike Stock, Scott Shugh, Ananya Majumder, Kit Buckley.
Carla P. Gomes CS4700 CS 4701: Practicum in Artificial Intelligence Carla P. Gomes
DEEP RED An Intelligent Approach to Chinese Checkers.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Quoridor and Artificial Intelligence
Reinforcement Learning
1 Introduction to Machine Learning Chapter 1. cont.
Dynamic Task Allocation in a turn based strategy game Gilles Schtickzelle September 2012 ULB.
CISC Machine Learning for Solving Systems Problems Presented by: Eunjung Park Dept of Computer & Information Sciences University of Delaware Solutions.
Artificial WINtelligence By: Jamaal Alleyne, C. Barrett Ames, Daniel Sullivan.
Backgammon Group 1: - Remco Bras - Tim Beyer - Maurice Hermans - Esther Verhoef - Thomas Acker.
Othello Artificial Intelligence With Machine Learning Computer Systems TJHSST Nick Sidawy.
Checkers A Matlab Project by Spenser Davison, Edward Dyakiw, Justin Pezzi, and Scott Wu.
A Scalable Machine Learning Approach to Go Pierre Baldi and Lin Wu UC Irvine.
Artificial Intelligence in Game Design Board Games and the MinMax Algorithm.
Teaching Computers to Think:
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.
The Game Development Process: Artificial Intelligence.
CS 5751 Machine Learning Chapter 13 Reinforcement Learning1 Reinforcement Learning Control learning Control polices that choose optimal actions Q learning.
Supervise Learning Introduction. What is Learning Problem Learning = Improving with experience at some task – Improve over task T, – With respect to performance.
Understanding AlphaGo. Go Overview Originated in ancient China 2,500 years ago Two players game Goal - surround more territory than the opponent 19X19.
Othello Artificial Intelligence With Machine Learning
CSC 110 – Fluency in Information Technology Chess
Othello Artificial Intelligence With Machine Learning
Overview of Machine Learning
Othello Artificial Intelligence With Machine Learning
Algorithms Lecture # 26 Dr. Sohail Aslam.
Presentation transcript:

1 CS 4701 – Project Proposal Jane Park (jp624) Ran Zhao (rz54)

2 Problem Statement and Motivation Create an efficient and powerful Chinese Checkers AI Challenges: –Irregular hexagonal board –High branching factor –Greedy solutions are suboptimal –Opponent plays an important role (can be leveraged) Motivation: –TD Gammon – teaching itself by playing against itself –A heart-felt desire for academic enlightenment in the area of artificial intelligence

3 I/O Specification Input: –Board configuration –Training data Output: –Optimal move as determined by the AI System.

4 Background Reading “Temporal Difference Learning and TD-Gammon” by Gerald Tesauro “Algorithm Design” by Jon Kleinberg “Machine Learning” by Tom Mitchell “Effective Java” by Joshua Bloch “Art of War” by Sun Tzu

5 General Approaches Uncle Scrooge Green Mushroom Lime Soda Thorsten Joachims 中华人民共和国 Hard Code

6 System Architecture and Work Plan Components –Data collection and aggregation –Machine Learning system –Strategic Game Play system Tasks –Basic AIs –Data Collection –Machine Learning –Parallel Computing –Distributed Caching –Marketing

7 Data sources Non-deterministic AI Players Human players Hand generated

8 Evaluation Plans Number of turns to win against the following opponents and the margin of victory: –No opponent –JP624 –Greedy AI –RZ54 –Self Win/loss ratio against random human players