Artificial Intelligence (A.I.)

Slides:



Advertisements
Similar presentations
Applications for Gaming in AI Sample Projects from Computational Intelligence Course at Washburn University.
Advertisements

Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.
CS AI Practicum Fall Robot Downey Jr Will Kiffer Joey Staehle Andrew Bunyea.
Pac-Man® Shant K. Karakashian CSE 476/876 Optional Course Project 1.
Game Playing CSC361 AI CSC361: Game Playing.
1 DCP 1172 Introduction to Artificial Intelligence Lecture notes for Chap. 6 [AIMA] Chang-Sheng Chen.
Creating Games Brainstorming Session. The Plan We will use computer parts to create our characters in the computer games We will work to design two kinds.
DUE: WEDNESDAY, FEBRUARY 29 PRESENTED BY: JAMES AHLUM CSE 348 AI Game Programming Project 2: Pathfinding in Games.
8 th Grade Parent Night Navigating a path for success.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
Project 1: Classification Using Neural Networks Kim, Kwonill Biointelligence laboratory Artificial Intelligence.
IMC service provider bidding steps. Add your Username and Password as shown above.
 Define A.I and discuss its application areas in detail.  Explain Turing test. why it is not justifiable to use it to test whether the machine is intelligent.
Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.
Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.
Introduction to Artificial Intelligence Mitch Marcus CIS391 Fall, 2008.
Quiz 4 : Minimax Minimax is a paranoid algorithm. True
Jack Chen TJHSST Computer Systems Lab Abstract The purpose of this project is to explore Artificial Intelligence techniques in the board game.
CSCI 4310 Lecture 6: Adversarial Tree Search. Book Winston Chapter 6.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
RFP Webinar: Cost Proposal Tuesday, January 7, 2014 Session 1 – 10:00 a.m. Session 2 – 2:00 p.m. Pacific Time 1.
Project 1: Classification Using Neural Networks Kim, Kwonill Biointelligence laboratory Artificial Intelligence.
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Adversarial Search. Game playing u Multi-agent competitive environment u The most common games are deterministic, turn- taking, two-player, zero-sum game.
Will Britt and Bryan Silinski
Artificial WINtelligence By: Jamaal Alleyne, C. Barrett Ames, Daniel Sullivan.
CMSC 421: Intro to Artificial Intelligence October 6, 2003 Lecture 7: Games Professor: Bonnie J. Dorr TA: Nate Waisbrot.
CS382 Introduction to Artificial Intelligence Lecture 1: The Foundations of AI and Intelligent Agents 24 January 2012 Instructor: Kostas Bekris Computer.
Ending HTML5 Open note Open Internet PROGLAN LONGQUIZ #2.
Finite State Machines Logical and Artificial Intelligence in Games Lecture 3a.
CMPT 463 Artificial Intelligence Instructor: Tina Tian.
Assignment Preliminaries The following applies to all assignments © 2016 B. Wilkinson Assignprelim.ppt Modification date: January 3, 2016.
SchoolSuccess for Coordinators
Announcements Office Hours change: Mon 3:30-4:30pm, Wed 1-2pm (both in DL 580) AI Seminar Series: Fridays 3-4pm in DL 480 Schedule here:
Announcements Homework 1 Full assignment posted..
STT592: Intro. to Statistical Learning
For parents and Students
By James Mannion Computer Systems Lab Period 3
CS 460 Spring 2011 Lecture 4.
Review of AI Professor: Liqing Zhang
Ariba Contracts: Complete a Review Task
The Implementation of Machine Learning in the Game of Checkers
CSE 476/876 Optional Course Project
Getting Started: Diet Analysis Plus
Expectimax Lirong Xia. Expectimax Lirong Xia Project 2 MAX player: Pacman Question 1-3: Multiple MIN players: ghosts Extend classical minimax search.
CSCI 5582 Artificial Intelligence
Announcements Homework 3 due today (grace period through Friday)
MANDATORY WELCOME BACK FLOOR MEETING!
PNP 2018.
Introduction to Artificial Intelligence
Final Project Description
Lecture 1C: Adversarial Search(Game)
Assignment Preliminaries
Winning Submission Built by: Location: Date:
Search and Game Playing
Expectimax Lirong Xia.
CSE 473: Artificial Intelligence Spring 2012
Minimax strategies, alpha beta pruning
Approaches to search Simple search Heuristic search Genetic search
Sparse and Redundant Representations and Their Applications in
Artificial Intelligence
Homework Reading Machine Projects Labs
Symbian OS Programming
CMPT 420 / CMPG 720 Artificial Intelligence
Adversarial Search CS 171/271 (Chapter 6)
Winning Submission Built by: Location: Date:
Minimax strategies, alpha beta pruning
Adversarial Search Game Theory.
Ex2. Due May 24 via to subject: Ex2 and last names
Presentation transcript:

Artificial Intelligence (A.I.) Project #2 Mohammad Tavakolian Center for Machine Vision and Signal Analysis (CMVS) University of Oulu January 31, 2019

A Hunted Game! January 31, 2019

Automated PacMan Game We have an agent (PacMan), food, and ghosts. Help PacMan to eat food (achieve a high score), while avoiding the ghosts. January 31, 2019

Adversarial Search To eat all the food dots and avoid the Ghosts you need: Appropriate search algorithm (Questions 2,3 and 4). Minimax Alpha-Beta Pruning. Expectimax Good evaluation function (Question 1 and 5). How good or bad is your state ? January 31, 2019

Project 2: Multi-Agent Game Q1: Reflex Agent (4 points) Q2: Minimax (5 points) Q3: Alpha-Bete Pruning (5 points) Q4: Expectimax (5 points) Mandatory 19 Points Q5: Evaluation Function (6 points) Optional 6 Points January 31, 2019

45+ Points → Get “+1” Bonus Point Grading Q1: 3 pts Q2: 3 pts Q3: 3 pts Q4: 3 pts Q1: 4 pts Q2: 5 pts Q3: 5 pts Q4: 5 pts 31 Points 12 Points 19 Points Q5: 3 pts Q6: 3 pts Q7: 4 pts Q8: 3 pts 19 Points 13 Points 6 Points Q5: 6 pts 50 Points in Total 45+ Points → Get “+1” Bonus Point January 31, 2019

Administrative Points The submission deadline: February 28, 2019 (23:59 PM, Finland Time) The completed project file must be submitted with a scientific report. The tasks 1-4 are mandatory; the tasks 5 is optional (bonus). You should send the project files (code in Python 2.7) along with the report (one PDF file) as a single zip file to mohammad.tavakolian@oulu.fi by the due date. The subject of email: AI2_Lastname Firstname_Student Number For example: AI2_Tavakolian Mohammad_123456789 Note: Submissions that do not follow the above template will be considered as SPAM. January 31, 2019

January 31, 2019