CS 4701 – Practicum in Artificial Intelligence Pre-proposal Presentation TEAM SKYNET: Brian Nader Stephen Stinson Rei Suzuki.

Slides:



Advertisements
Similar presentations
Artificial Intelligence 1: game playing Lecturer: Tom Lenaerts SWITCH, Vlaams Interuniversitair Instituut voor Biotechnologie.
Advertisements

10-1 © Prentice Hall, 2004 Chapter 10: Selecting the Best Alternative Design Strategy Plus Project Management Concepts.
Chapter 12 Analyzing Semistructured Decision Support Systems Systems Analysis and Design Kendall and Kendall Fifth Edition.
Todd W. Neller Gettysburg College
Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
Artificial Intelligence for Games Patrick Olivier & John Shearer
Adversarial Search: Game Playing Reading: Chapter next time.
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Programme By James Mannion Computer Systems.
Artificial Intelligence for Games Game playing Patrick Olivier
Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.
CS AI Practicum Fall Robot Downey Jr Will Kiffer Joey Staehle Andrew Bunyea.
GENETIC PROGRAMMING FOR CHECKERS PLAY Dustin Shutes Abstract: This project uses genetic programming to develop a program that plays the game of checkers.
CPSC 322 Introduction to Artificial Intelligence October 25, 2004.
Game Playing CSC361 AI CSC361: Game Playing.
Conventional AI Machine Learning Techniques Environmental Mapping Case Statements Statistical Analysis Computational Intelligence Pattern Recognition.
Applying Genetic Programming to Stratego Ryan Albarelli.
Implementing the Intelligent Systems Knowledge Units of Computing Curricula 2001 Ingrid Russell Todd Neller.
Adversarial Search: Game Playing Reading: Chess paper.
CS : Artificial Intelligence: Representation and Problem Solving Fall 2002 Prof. Tuomas Sandholm Computer Science Department Carnegie Mellon University.
CSE 590ST Statistical Methods in Computer Science Instructor: Pedro Domingos.
CIS 410/510 Probabilistic Methods for Artificial Intelligence Instructor: Daniel Lowd.
Neural Networks Slides by Megan Vasta. Neural Networks Biological approach to AI Developed in 1943 Comprised of one or more layers of neurons Several.
Group 1 : Ashutosh Pushkar Ameya Sudhir From. Motivation  Game playing was one of the first tasks undertaken in AI  Study of games brings us closer.
CSE 515 Statistical Methods in Computer Science Instructor: Pedro Domingos.
CISC673 – Optimizing Compilers1/34 Presented by: Sameer Kulkarni Dept of Computer & Information Sciences University of Delaware Phase Ordering.
Lecture 5 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
History  1475: modern game evolved  : supposed automatons  : rise of chess computers  : on par with humans  2000-current.
Final Presentation – CS 425 Aaron O'Banion Todd Astroth Chris Cobb Matt Stowe Mark Williams.
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.
110/19/2015CS360 AI & Robotics AI Application Areas  Neural Networks and Genetic Algorithms  These model the structure of neurons in the brain  Humans.
Assoc. Prof. Abdulwahab AlSammak. Course Information Course Title: Artificial Intelligence Instructor : Assoc. Prof. Abdulwahab AlSammak
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.
1 CS 4701 – Project Proposal Jane Park (jp624) Ran Zhao (rz54)
CHECKERS: TD(Λ) LEARNING APPLIED FOR DETERMINISTIC GAME Presented By: Presented To: Amna Khan Mis Saleha Raza.
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.
1-1 Logistics Management LSM 730 Dr. Khurrum S. Mughal Lecture 15.
November 29, 2011 Final Presentation. Team Members Troy Huguet Computer Engineer Post-Route Testing Parker Jacobs Computer Engineer Post-Route Testing.
Troops and Flags ITCS /10/07. Graduate Team #1 Daniel – Model (Team Leader) Jonathan –Rule Checker Priyesh – View, Sprites, Foley artist Rob –
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Program By James Mannion Computer Systems.
General Information Course Id: COSC6368 Artificial Intelligence Professor: Ricardo Vilalta Classroom:AH 110 Telephone: (713)
Artificial WINtelligence By: Jamaal Alleyne, C. Barrett Ames, Daniel Sullivan.
Introduction to Machine Learning © Roni Rosenfeld,
CMSC 421: Intro to Artificial Intelligence October 6, 2003 Lecture 7: Games Professor: Bonnie J. Dorr TA: Nate Waisbrot.
Introduction: What is AI? CMSC Introduction to Artificial Intelligence January 3, 2002.
A Scalable Machine Learning Approach to Go Pierre Baldi and Lin Wu UC Irvine.
Modular Architecture for Computer Game Design Teddy McNeill TJHSST Computer Systems Lab
Designing Intelligence Logical and Artificial Intelligence in Games Lecture 2.
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.
CMPT 463 Artificial Intelligence Instructor: Tina Tian.
Understanding AlphaGo. Go Overview Originated in ancient China 2,500 years ago Two players game Goal - surround more territory than the opponent 19X19.
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Artificial Intelligence AIMA §5: Adversarial Search
Adversarial Search and Game-Playing
Introduction to Machine Learning
Artificial Intelligence
By James Mannion Computer Systems Lab Period 3
Artificial Intelligence (CS 461D)
Artificial Intelligence (CS 370D)
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Game Playing in AI by: Gaurav Phapale 05 IT 6010
Artificial Intelligence
Kevin Mason Michael Suggs
Chap 4: Searching Techniques
CMPT 420 / CMPG 720 Artificial Intelligence
1 What do you think AI is? AI, difficult to define
Presentation transcript:

CS 4701 – Practicum in Artificial Intelligence Pre-proposal Presentation TEAM SKYNET: Brian Nader Stephen Stinson Rei Suzuki

Problem Statement and Motivation Write a Chinese checkers AI Improve our understanding of… Heuristic Search Machine Learning Other AI features Motivation: TO TERMINATE ALL ENEMIES!

Input/Output Server  AI Input 1 st input: initial board state Opponent piece movements Illegal move errors Game end condition AI Output  Server Movement requests

Background Reading Main Reading: Artificial Intelligence: A Modern Approach, Russell and Norvig, Prentice-Hall, Inc. 3 rd Ed. Secondary Sources include, but are not limited to: The Internet

General Approach Create a modular AI that makes use of: Heuristic search functions Multiple heuristics and heuristic combinations Hard-coded strategies (opening moves) Unique strategies

System Architecture && Work Plan Heuristic function class Game state saved at each node Search algorithm class Neutral peg placement function Main([args]) class

Data Sources Chinese checkers statistics available online/reference material Nightly testing results

Evaluation Plans AI vs. AI games If simulator is provided Nightly test results Wins/Losses Any other information provided

Schedule Week 1 (9/11—9/17): Research, proposal completion Week 2: Design core structure of code base / begin coding Week 3: Finish coding core structure/ finalize decisions on heuristic and algorithm choices Week 4: Have prototype AI fully functional (able to move pieces)/ continue developing algorithms Code Review : Tuesday October 4 th Week 5: Begin testing/optimizing heuristics and searches / searches should be finished Week 6: Development of unique strategies and ensuring our AI is competitive Week 7: Testing and finalization of unique strategies Week 8: Finalize project Code Review: Tuesday November 1 st Weeks 9-12: Writing final reports and tweaking AI Final Project Due: November 29th (Judgment Day)

Questions for you! Neutral Pegs Does the peg stay there for the remainder of the game? How many? How will the AI know? Cross-positions? Simulator? Memory constraints Query the server? Nightly Testing results How much info will be provided from the tests? Board Shape Holes? Will the board change from testing to competition?