Pac-Man® Shant K. Karakashian CSE 476/876 Optional Course Project 1.

Slides:



Advertisements
Similar presentations
Carlos Barboza Kenny Barron Kevin Cherry Tung Le Daniel Lorio.
Advertisements

Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.
Presented by : Ashin Ara Bithi Roll : 09 Iffat Ara Roll : 22 12th Batch Department of Computer Science & Engineering University of Dhaka.
An Introduction to Artificial Intelligence Lecture VI: Adversarial Search (Games) Ramin Halavati In which we examine problems.
Class Project Due at end of finals week Essentially anything you want, so long as its AI related and I approve Any programming language you want In pairs.
CS 351 Introduction Spring 2010 Modeling and Simulation Technologies Dr. Jim Holten.
CSE 471/598 Intro to AI (Lecture 1). Course Overview What is AI –Intelligent Agents Search (Problem Solving Agents) –Single agent search [Project 1]
Intelligent agents Intelligent agents are supposed to act in such a way that the environment goes through a sequence of states that maximizes the performance.
1Computer Graphics Practical Assessment – 3D pacman Due: Wednesday January 12 th 12-noon John Shearer Culture Lab – space 2
1 Heuristic Search 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games.
Applying Genetic Programming to Stratego Ryan Albarelli.
Intelligent agents Intelligent agents are supposed to act in such a way that the environment goes through a sequence of states that maximizes the performance.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Object Oriented Design. Goals  Pacman Project Reflections  The Sims Project: additional pointers.
Intelligent Pac-Man Ghost AI
The Incredible Snake Rony Bershadsky Naama Mayer Michal Gefen Nimrod Talmon.
AI – Week 10 AI and Games (2) Lee McCluskey, room 3/10
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.
Marcus Gallagher and Mark Ledwich School of Information Technology and Electrical Engineering University of Queensland, Australia Sumaira Saeed Evolving.
CSE 473: Artificial Intelligence Spring 2014 Hanna Hajishirzi Problem Spaces and Search slides from Dan Klein, Stuart Russell, Andrew Moore, Dan Weld,
LOUKAS GEORGIOU and WILLIAM J. TEAHAN Artificial Intelligence and Intelligent Agents Research Group School of Computer Science, Bangor University, U.K.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
Game Playing.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
TECH19599 Exploring Information Technology Mobile Application Development (Control Statements)
5. Alternative Approaches. Strategic Bahavior in Business and Econ 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game Theory 4. The.
AI PRACTICUM PROPOSAL Anand Bheemarajaiah, M.Eng. Chet Mancini, M.Eng. Felipe Osterling, Junior TA: Jason Yosinski.
1 CSE 4705 Artificial Intelligence Jinbo Bi Department of Computer Science & Engineering
Agents CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Artificial Intelligence: Introduction Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Quiz 4 : Minimax Minimax is a paranoid algorithm. True
1 2010/2011 Semester 2 Introduction: Chapter 1 ARTIFICIAL INTELLIGENCE.
Jack Chen TJHSST Computer Systems Lab Abstract The purpose of this project is to explore Artificial Intelligence techniques in the board game.
DEEP RED An Intelligent Approach to Chinese Checkers.
Stephen Flockton.  What is my Project?  What is Planning?  Advantages and Disadvantages of Planning.  Description of the Product.  Product Demonstration.
March 9, 2009 Maze Solving GUI. March 9, 2009 MVC Model View Controller –Model is the application with no interfaces –View consists of graphical interfaces.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
F UZZY L OGIC : G AME E XAMPLE Steve Foster. BDI M ODEL The BDI model studies intention and its relation to other mental attitudes As its name implies,
1 CSE 4705 Artificial Intelligence Jinbo Bi Department of Computer Science & Engineering
Simulation - Game Evaluation Agenda  Evaluate the skills that can be learned  How enjoyable is the game  Evaluate my effort as a student  Identify.
George F Luger ARTIFICIAL INTELLIGENCE 5th edition Structures and Strategies for Complex Problem Solving HEURISTIC SEARCH Luger: Artificial Intelligence,
HEURISTIC SEARCH 4 4.0Introduction 4.1An Algorithm for Heuristic Search 4.2Admissibility, Monotonicity, and Informedness 4.3Using Heuristics in Games 4.4Complexity.
Adversarial Search. Game playing u Multi-agent competitive environment u The most common games are deterministic, turn- taking, two-player, zero-sum game.
CSE332: Data Abstractions Lecture 28: Course Wrap-up Tyler Robison Summer
Game 4: Pac Man Tutorial. New events/actions to learn: Animated sprites Change instances – allows you to change objects into other objects. Change sprites.
Human Decision- Making Processes. What Is a Decision  A reasoned choice among alternatives  Part of the broader subject…problem solving  How do we.
Announcements Homework 1 Full assignment posted..
Uninformed search Lirong Xia Spring, Uninformed search Lirong Xia Spring, 2017.
MARKETING PROCESS.
CS 460 Spring 2011 Lecture 4.
CSE 476/876 Optional Course Project
First-Person PacMan By Brett Jones.
Expectimax Lirong Xia. Expectimax Lirong Xia Project 2 MAX player: Pacman Question 1-3: Multiple MIN players: ghosts Extend classical minimax search.
CSE 4705 Artificial Intelligence
Jeff Plewak Robin Sachdev
Random Walks, AI and Heat Transfer in Pac-Man
CSE 4705 Artificial Intelligence
Transp Course 2014 Overview.
Maze Design Presentation Questions
Expectimax Lirong Xia.
Minimax strategies, alpha beta pruning
Artificial Intelligence (A.I.)
Uninformed search Lirong Xia. Uninformed search Lirong Xia.
Uninformed search Lirong Xia. Uninformed search Lirong Xia.
Arduino Joy Stick and Game
Example 5A: Solving Simple Rational Equations
Minimax strategies, alpha beta pruning
Heuristic Search in Empire-Based Games
Presentation transcript:

Pac-Man® Shant K. Karakashian CSE 476/876 Optional Course Project 1

Introduction Pac-Man is a classic video game Icon of the 1980s popular culture Environment is a maze with dots & fruits Pac-Man is an agent that eats the dots & fruits Ghosts are agents that attack the Pac-Man 2

Design & implement algorithms to –control the Pac-Man & –control the Ghosts Algorithm –Input the maze, location of dots & fruits location of the agents (Pac-Man & Ghosts) –Output Next move of the agents (left, right, up or down) Objectives –PacMan: avoid the ghosts & eat the dots + fruits –Ghosts: attack the PacMan 3 Project Overview

Algorithms & Heuristics Implementing a rational agent requires An algorithm to enumerate future states Heuristics to evaluate future states -To prune the search space -To choose among alternatives 4

Resources Programming environment provided by Derrick Stolee. It includes Java classes for the GUI and the basic classes for the agents Animated front-end simulating the original game-display provided by Derrick Stolee and the animation enhanced by Shant Karakashian Algorithms for the Pac-Man and the Ghosts from last year's competition Discuss with Shant and/or Derrick Resources available from: 5

Why do the Project Get a better understanding of AI Grasp the effectiveness of the search algorithms and the different heuristics Have a notion of the complexity that arises even from simple problems Compete against your colleagues through your intelligent agents in a public event Check the photo’s of last year’s partythe photo’s of last year’s party 6