Intelligent Pac-Man Ghost AI

Slides:



Advertisements
Similar presentations
Anthony Wayne Lacrosse
Advertisements

Heuristic Search techniques
AI Pathfinding Representing the Search Space
BROWNSBURG BASKETBALL
U9/u11 Fun Drills Sharks and Minnows Hungry Hippo Musical ground balls Numbers game Ultimate Fireball Tag, you’re out Cradle relay Shoot the bunny.
Pathfinding Basic Methods.
By: Michael Chamberlain. G oal: To create an intelligent “Pacman” character and intelligent monsters who attempt to chase the character.. Character can.
CSE 380 – Computer Game Programming Pathfinding AI
CSC 423 ARTIFICIAL INTELLIGENCE
NPC Interaction in Video Games Robert Higginbotham.
Structures and Strategies- Basketball Key Concept 2- Identification of strengths and weaknesses in performance in terms of: roles and relationships; formations;
Artificial Intelligence in Game Design Intelligent Decision Making and Decision Trees.
CIS 700 Programming & Problem Solving Fall Instruction Staff Instructor: Chris Murphy –PhD Computer Science, Columbia Univ –Seven years professional.
Artificial Intelligence in Game Design Hierarchical Finite State Machines.
What is the Best Position? More Advanced Positioning February, R. Baker1.
AI Critique: Dustin Kelley. MGS3 AI Intro Tactical espionage missions while avoiding elite Russian soldiers Development team underwent field training.
Artificial Intelligence in Game Design Probabilistic Finite State Machines.
Chapter 5.4 Artificial Intelligence: Pathfinding.
 FIFA is a huge football tournament, where teams from all around the world come and play against each other, fighting for the title of FIFA. It only.
CORE MECHANICS. WHAT ARE CORE MECHANICS? Core mechanics are the heart of a game; they generate the gameplay and implement the rules. Formal definition:
Marcus Gallagher and Mark Ledwich School of Information Technology and Electrical Engineering University of Queensland, Australia Sumaira Saeed Evolving.
START Help Pac-Man find his dinner by answering math questions correctly. Try to go as fast as you can. You can do it! Click the Pac Man to begin playing.
START Help Pac-Man find his dinner by answering math questions correctly. Try to go as fast as you can. You can do it! Click the Pac Man to begin playing.
Legend – Goal A – Attack – Running Path M – Midfield – Throwing / Shooting Path L – Look for pass – Pick for Teammate – Ball location O – Offense X – Defense.
© Mark E. Damon - All Rights Reserved Another Presentation © All rights Reserved
Noadswood Science,  To know the basics of Python coding and decoding Monday, September 07, 2015.
Chapter 5.4 Artificial Intelligence: Pathfinding.
Lab 3 How’d it go?.
Raven Robin Burke GAM 376. Soccer standings Burke, 7 Ingebristen, 6 Buer, 6 Bukk, 6 Krishnaswamy, 4 Lobes, 3 Borys, 2 Rojas, 2 Bieneman, 2.
Artificial Intelligence in Game Design Problems and Goals.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
One person will stand behind the desk of another. I’ll ask you a question. The first of the two people standing together to say the correct answer coherently.
Artificial Intelligence in Game Design Behavior Trees.
Artificial Intelligence in Game Design
Structures, Strategies and Compositions Lesson 9 Speed – Width – Variation - Creativity.
TRAINING DRILLS There are many types of fitness, but which one is best for soccer? Speed? Stamina? Agility? Strength? Speed, is needed to out sprint a.
Chapter 9 Driving in City Traffic More Complex!! Why? 1.Traffic is more dense – more cars, trucks, buses and pedestrians per mile than on rural roads.
Bellahouston Academy.  Tactics are a GAME PLAN that a team or a player uses to help them gain an advantage over their opponents.  A tactic should work.
Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.
More on Logic Today we look at the for loop and then put all of this together to look at some more complex forms of logic that a program will need The.
Competitive Fall Season Week of September 3 U9/U10 – Dribbling.
DEEP RED An Intelligent Approach to Chinese Checkers.
Computational theory techniques in interactive video games.
Coaching Pack 9 – 11 Years. What Am I Coaching Today? What Might the Players Learn or Get Better at? TechnicalPsychological example PhysicalSocial example.
28 minutes before 6 players setup Basic move Each player gets per turn: 1.Max 3 people per move 2.Max 3 zombies per move.
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,
Quoridor and Artificial Intelligence
Traditional Children Games. Hopscotch (Cascayu) There can be any number of players, and a stone is the only object you need to play it. There can be any.
The Day Sam Saved the World By Andrew. It all started on a sunny day. Sam was playing outside in the backyard with his toy bone. Sam is a three year old.
Contested Dominion Game Treatment written by Nicholas Mezza.
Will Britt and Bryan Silinski
Graph Search II GAM 376 Robin Burke. Outline Homework #3 Graph search review DFS, BFS A* search Iterative beam search IA* search Search in turn-based.
CSCI 4310 Lecture 5: Steering Behaviors in Raven.
CSCE 552 Spring 2010 AI (III) By Jijun Tang. A* Pathfinding Directed search algorithm used for finding an optimal path through the game world Used knowledge.
Reverse Prediction. Earlier Work Johnson, J.A., P. Campeau. (2005) Reverse Prediction. The Tenth International Conference on Rough Sets, Fuzzy Sets, Data.
NETBALL – Chest Pass  Technique  Flat pass  Both hands behind the ball in ‘W’ shape  Elbows down and push ball directly and hard at team mate  When.
HORIZONTAL OFFENSE some principles apply to this offense so remember the golden rules! 1. Don’t throw over a players head, or in other words stay wide.
The Principal of Advantage and Disadvantage. The order of fouls: Safety Fouls Conduct and Behavior Fouls Obvious Fouls Advantage/Disadvantage Fouls.
Finite State Machines Logical and Artificial Intelligence in Games Lecture 3a.
CSCE 552 Fall 2012 AI By Jijun Tang. Homework 3 List of AI techniques in games you have played; Select one game and discuss how AI enhances its game play.
This is an enjoyable game played by children and teenagers in Anatolia. What you need is speed and intelligence.
Process Scheduling. Scheduling Strategies Scheduling strategies can broadly fall into two categories  Co-operative scheduling is where the currently.
A personality for every occasion. High Level Actions  Flee  Follow  Attack  Find Light/Roam  Sit and Wait  Hibernate.
Chapter 5.4 Artificial Intelligence: Pathfinding
CS 134 Video Game “AI”.
CSE 476/876 Optional Course Project
Higher: Factors Impacting on Performance- Physical - Tactics
Artificial Intelligence in Game Design
CSCE 552 Spring 2009 AI (III) By Jijun Tang.
National 5: Factors Impacting on Performance- Physical - Tactics
Presentation transcript:

Intelligent Pac-Man Ghost AI CPE 480 – Fall 2008 Bill Hess Brian Mark Richard McDaniel Wesley Hamilton Evin Thompson Bill

Objective To create a new AI for the ghosts in the game Pac-Man. This AI must be more difficult than the original. It should implement several concepts from Artificial Intelligence. The ghosts should act cooperatively. Bill

Original AI We modified the source for the Pac-Man game found at www.bennychow.com. Original ghosts moved only based on best-first search Ghosts would move to the cell with the closest absolute distance to Pac-Man. Ghosts not allowed to go back the way they came. Ghosts have a simple check to not follow each other down corridors. There is a 50% chance that ghosts will take the next-best direction at intersections. Brian

Evaluation Criteria Percent of rounds won (by the player). Should be as small as possible Points won by the player. Time taken to complete a round to a win. Should be as large as possible. The AI should prevent the player from winning as long as possible Time taken to complete a round to a loss. Should be as small as possible. The AI should defeat the player as fast as possible. Richard

Testing Environment We modified the game environment to include a Testing Mode This allows testers to play alternating rounds against the original AI and the new AI with a reset round each time. Evaluation results are recorded and displayed in a window after all testing rounds are finished Richard

Smart AI – Uniform Cost Search Our AI uses a uniform-cost search to find a path to Pac-Man. Cells are all given a weight of 1 at the beginning of the traversal. The closest ghost to Pac-Man (found by using a breadth-first search) is chosen and finds a path using the uniform-cost search. All cells the ghost walks over has its cost increased by 2. The next closest ghost is chosen and the uniform-cost search is run again. This search is performed each time a ghost crosses a cell Bill

Smart AI – Uniform Cost Search Advantages: Ghosts can now change directions quickly if Pac-Man makes a sudden change in direction. Ghosts can follow each other for short periods of time and split up later. Ghosts begin to take different paths earlier in the pursuit. Ghosts can search to the next intersection that Pac-Man is headed towards in order to predict his movements. Bill

Smart AI – Other Behaviors Objective Guarding Ghosts will stand over power pellets and food pellets when there are only a few left on the map. This forces the player to think ahead about leaving behind pellets or when to use a power pellet Evin

Smart AI – Other Behaviors Fleeing Behavior All but the closest ghost will flee early if Pac-Man is near a Power Pellet. This prevents the player from sitting next to a pellet and eating all the ghosts once they get close. Once Pac-Man has eaten a Power Pellet, all ghosts will flee up to a certain distance based on how much time is left until the Power Pellet runs out. This means that ghosts will resume pursuing Pac-Man before the Power Pellet times out. Evin

Smart AI – Commander Class Appoints tasks to all ghosts every time they cross a cell Tasks are represented by a destination location Tasks are appointed in order of priority Priority of tasks Leave room, enter room, flee Chase Pac-Man Defend food/Power Pellet Back off, block intersections Wes

Smart AI – Commander Class Gives all ghosts a direction to move based on their task The ghosts are only given the first step of the path to their final destination. Ghosts must ask the Commander for the next direction each time they move to a cell. The Commander uses uniform-cost search and breadth-first search to pick the next direction for each ghost when the ghosts request one. BFS is used for leaving and entering the room. UCS is used for all other tasks.

Smart AI – Results Bill

Smart AI – Results

Future Improvements Blind testing environment Improve fleeing Make it so the tester doesn’t know which AI is being played against. Randomly choose the AI to be played against. Improve fleeing In level 1, ghosts tend to bunch together. Make ghosts run away from each other as well as the player. Bill

Demo http://users.csc.calpoly.edu/~whess/480/build/PacMan.htm Brian