AI in Computer Games. AI in Computer Games. Goals. Game A(I?) History Game categories

Size: px
Start display at page:

Download "AI in Computer Games. AI in Computer Games. Goals. Game A(I?) History Game categories"

Transcription

1 AI in Computer Games why, where and how AI in Computer Games Goals Game categories History Common issues and methods Issues in various game categories Goals Games are entertainment! Important that things behave naturally not necessarily perfect "things" are not always creatures Follow (the game's) natural laws and avoid cheating Characters should be aware Game A(I?) Academic AI is usually concerned with making rational decisions Searching for the optimal solution Game AI is more often about Artificial Life Believable behaviour including realistic physics Game balancing challenging, but not unbeatable opponents Game categories Role Playing Games (RPG, MMORPG) First Person (Third Person) Shooters (FPS/TPS) Real Time Strategy (RTS) games Sports games Simulation games Adventure games Classic strategy games Fighting games... History 's First computer games 1970's SpaceWar (for two human players) (1962) Board games (e.g. chess) against the machine Pong (first public computer game?) (1972) First computer controlled opponent in arcade games Space Invaders Space Invaders (1978) Predefined patterns "AI" takes 1-2% of CPU Pong Chess 1

2 1980's Pac-Man (1980) opponents with personality A computer beats a master chess player (1983) Tekken 3 First fighting games Adventure games Dungeon, Zork,... First MORPG (MUD) Pac Man 1990's FPS and RTS games Games about/with evolution and learning (Creatures, Black&White) Deep Blue beats Kasparov (1997) Graphic cards take the load off the CPU AI takes 10-35% of CPU Doom Dune 2 Black & White Computer games is a big industry Games sell for about 25 billion USD per year Market grows with 16% per year A game project: 2 years, 8-15 million USD Less cheating in AI Characters are more aware Characters collaborate better Focus shift from graphics towards AI Typical Game AI topics Strategical/tactical decisions Against or with you Search for best counter action adaptivity Simulation of natural behaviour for animation (e.g. bird flocks) Shortest path problems Some methods Minimax logic games, search for best counter action Finite State Machines (FSM) Behaviour A* For shortest path problems Particle methods Simulation of flocks, smoke, water, grass,... Smart terrain Minimax (counter actions) MAX MIN 7 MAX Variants: α-β-pruning and expectimax 2

3 Distance from S + estimated distance to G A* Finite State Machines Pacman ghost (red) 3+8=11 2+7=9 3+6=9 4+5=9 2+7=9 1+6=7 2+5=7 3+4=7 S 1+4=5 1+6=7 2+3=5 G 2+5=7 3+6=9 Reinforcement Learning 4+5=9 5+4=9 6+3=9 7+2=9 8+1=9 Best shortest Civilization III Smart terrain Stor knowledge in objects instead of in the characters Easier to know what is relevant Easier to add new objects later drink me! not thirsty, warm Thoughts on learning Game characters are short lived Learning requires many attempts Keep it simple! Probabilistic methods (Menace) Evoutionary methods Neural networks Invented by Will Wright (Sims) genetic algorithms in game development, but not in the game 3

4 Thoughts on learning AI in various game types Board games Role playing games Strategy games Platform and sports games Racing games Board games Discrete time / turn based Often deterministic AI is in the opponent AI goal is non-typical (for games) usually strives for optimality Tree search Library Reinforcement learning Chess Role Playing and Adventure AI in enemies, bosses, party members and other NPCs,... Scripting, FSMs, Messaging Role Playing Combat combat oriented games are simpler to make Conversations (grammar machines) Quest generators Towns The Elder Scrolls IV: Oblivion Town behaviour Town behaviour Need-based system Needs (e.g. hunger, business,...) Actions (e.g. eating, trading,...) "Need pathfinding" Problems Finding people Unwanted interaction between NPCs The Elder Scrolls III: Morrowind 4

5 Strategy games Strategy games AI heavy (on both sides) Shortest path problems Strategical decisions Tactical decisions Town building and resource management planning Indigenous life Reconnaissance (fog-of-war) Diplomacy Know thy enemy (observe and adapt) Civilization III Civilization III Action games (FPS, TPS) Action games (FPS, TPS) Enemies Weapons Cooperative agents Attention requires perception requires a good physics engine Pathfinding Spatial reasoning Anticipation Half Life 2 Thief 3: Deadly Shadows Platforms and sports Platforms and sports Platform games Since 1996 (Mario 64) in 3D Camera problems Sports games Camera problems (harder) Cooperation Game balance can be difficult Learning Prince of Persia Prince of Persia: The Two Thrones 5

6 Racing games Racing games Track AI Traffic (including pedestrians) Physics Tuning NPCs and vehicle parameters Genetic algorithms Particle swarm optimization Forza Motorsport Conclusion Making realistic games requires more than good graphics Computer controlled characters must behave Naturally Reasonably intelligent, without cheating! Graphics has dedicated hardware More processing power avilable to AI In the future Dedicated AI cards? Multi core processors Knowledge transfer from games to robotics Robocup (Aibo league) 6

Who am I? AI in Computer Games. Goals. AI in Computer Games. History Game A(I?)

Who am I? AI in Computer Games. Goals. AI in Computer Games. History Game A(I?) Who am I? AI in Computer Games why, where and how Lecturer at Uppsala University, Dept. of information technology AI, machine learning and natural computation Gamer since 1980 Olle Gällmo AI in Computer

More information

TGD3351 Game Algorithms TGP2281 Games Programming III. in my own words, better known as Game AI

TGD3351 Game Algorithms TGP2281 Games Programming III. in my own words, better known as Game AI TGD3351 Game Algorithms TGP2281 Games Programming III in my own words, better known as Game AI An Introduction to Video Game AI In a nutshell B.CS (GD Specialization) Game Design Fundamentals Game Physics

More information

TGD3351 Game Algorithms TGP2281 Games Programming III. in my own words, better known as Game AI

TGD3351 Game Algorithms TGP2281 Games Programming III. in my own words, better known as Game AI TGD3351 Game Algorithms TGP2281 Games Programming III in my own words, better known as Game AI An Introduction to Video Game AI A round of introduction In a nutshell B.CS (GD Specialization) Game Design

More information

Artificial Intelligence for Games

Artificial Intelligence for Games Artificial Intelligence for Games CSC404: Video Game Design Elias Adum Let s talk about AI Artificial Intelligence AI is the field of creating intelligent behaviour in machines. Intelligence understood

More information

CS 480: GAME AI INTRODUCTION TO GAME AI. 4/3/2012 Santiago Ontañón https://www.cs.drexel.edu/~santi/teaching/2012/cs480/intro.

CS 480: GAME AI INTRODUCTION TO GAME AI. 4/3/2012 Santiago Ontañón https://www.cs.drexel.edu/~santi/teaching/2012/cs480/intro. CS 480: GAME AI INTRODUCTION TO GAME AI 4/3/2012 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2012/cs480/intro.html CS 480 Focus: artificial intelligence techniques for

More information

CS 680: GAME AI INTRODUCTION TO GAME AI. 1/9/2012 Santiago Ontañón

CS 680: GAME AI INTRODUCTION TO GAME AI. 1/9/2012 Santiago Ontañón CS 680: GAME AI INTRODUCTION TO GAME AI 1/9/2012 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2012/cs680/intro.html CS 680 Focus: advanced artificial intelligence techniques

More information

Game Artificial Intelligence ( CS 4731/7632 )

Game Artificial Intelligence ( CS 4731/7632 ) Game Artificial Intelligence ( CS 4731/7632 ) Instructor: Stephen Lee-Urban http://www.cc.gatech.edu/~surban6/2018-gameai/ (soon) Piazza T-square What s this all about? Industry standard approaches to

More information

Artificial Intelligence (AI) Artificial Intelligence Part I. Intelligence (wikipedia) AI (wikipedia) ! What is intelligence?

Artificial Intelligence (AI) Artificial Intelligence Part I. Intelligence (wikipedia) AI (wikipedia) ! What is intelligence? (AI) Part I! What is intelligence?! What is artificial intelligence? Nathan Sturtevant UofA CMPUT 299 Winter 2007 February 15, 2006 Intelligence (wikipedia)! Intelligence is usually said to involve mental

More information

IMGD 1001: Fun and Games

IMGD 1001: Fun and Games IMGD 1001: Fun and Games by Mark Claypool (claypool@cs.wpi.edu) Robert W. Lindeman (gogo@wpi.edu) Outline What is a Game? Genres What Makes a Good Game? Claypool and Lindeman, WPI, CS and IMGD 2 1 What

More information

INTRODUCTION TO GAME AI

INTRODUCTION TO GAME AI CS 387: GAME AI INTRODUCTION TO GAME AI 3/31/2015 Instructor: Santiago Ontañón santi@cs.drexel.edu Class website: https://www.cs.drexel.edu/~santi/teaching/2015/cs387/intro.html CS 387 Focus: artificial

More information

Artificial Intelligence Paper Presentation

Artificial Intelligence Paper Presentation Artificial Intelligence Paper Presentation Human-Level AI s Killer Application Interactive Computer Games By John E.Lairdand Michael van Lent ( 2001 ) Fion Ching Fung Li ( 2010-81329) Content Introduction

More information

IMGD 1001: Fun and Games

IMGD 1001: Fun and Games IMGD 1001: Fun and Games Robert W. Lindeman Associate Professor Department of Computer Science Worcester Polytechnic Institute gogo@wpi.edu Outline What is a Game? Genres What Makes a Good Game? 2 What

More information

CS325 Artificial Intelligence Ch. 5, Games!

CS325 Artificial Intelligence Ch. 5, Games! CS325 Artificial Intelligence Ch. 5, Games! Cengiz Günay, Emory Univ. vs. Spring 2013 Günay Ch. 5, Games! Spring 2013 1 / 19 AI in Games A lot of work is done on it. Why? Günay Ch. 5, Games! Spring 2013

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Lecture 01 - Introduction Edirlei Soares de Lima What is Artificial Intelligence? Artificial intelligence is about making computers able to perform the

More information

Adversarial Search Lecture 7

Adversarial Search Lecture 7 Lecture 7 How can we use search to plan ahead when other agents are planning against us? 1 Agenda Games: context, history Searching via Minimax Scaling α β pruning Depth-limiting Evaluation functions Handling

More information

CS 188: Artificial Intelligence

CS 188: Artificial Intelligence CS 188: Artificial Intelligence Adversarial Search Prof. Scott Niekum The University of Texas at Austin [These slides are based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.

More information

INTRODUCTION TO GAME AI

INTRODUCTION TO GAME AI CS 387: GAME AI INTRODUCTION TO GAME AI 3/29/2016 Instructor: Santiago Ontañón santi@cs.drexel.edu Class website: https://www.cs.drexel.edu/~santi/teaching/2016/cs387/intro.html CS 387 Focus: artificial

More information

Announcements. Homework 1. Project 1. Due tonight at 11:59pm. Due Friday 2/8 at 4:00pm. Electronic HW1 Written HW1

Announcements. Homework 1. Project 1. Due tonight at 11:59pm. Due Friday 2/8 at 4:00pm. Electronic HW1 Written HW1 Announcements Homework 1 Due tonight at 11:59pm Project 1 Electronic HW1 Written HW1 Due Friday 2/8 at 4:00pm CS 188: Artificial Intelligence Adversarial Search and Game Trees Instructors: Sergey Levine

More information

6. Games. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Mechanical Turk. Origins. origins. motivation. minimax search

6. Games. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Mechanical Turk. Origins. origins. motivation. minimax search COMP9414/9814/3411 16s1 Games 1 COMP9414/ 9814/ 3411: Artificial Intelligence 6. Games Outline origins motivation Russell & Norvig, Chapter 5. minimax search resource limits and heuristic evaluation α-β

More information

CS 5522: Artificial Intelligence II

CS 5522: Artificial Intelligence II CS 5522: Artificial Intelligence II Adversarial Search Instructor: Alan Ritter Ohio State University [These slides were adapted from CS188 Intro to AI at UC Berkeley. All materials available at http://ai.berkeley.edu.]

More information

Today s Topics. Video Game AI: Lecture 2 History of Game AI. Pong (1972) A selective history of video game AI

Today s Topics. Video Game AI: Lecture 2 History of Game AI. Pong (1972) A selective history of video game AI Today s Topics Video Game AI: Lecture 2 History of Game AI Nathan Sturtevant COMP 3705 Brief history of video game AI PacMan Discussion / Quiz Design What role do ghosts play? How could ghosts be changed?

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Adversarial Search Instructors: David Suter and Qince Li Course Delivered @ Harbin Institute of Technology [Many slides adapted from those created by Dan Klein and Pieter Abbeel

More information

Game-playing: DeepBlue and AlphaGo

Game-playing: DeepBlue and AlphaGo Game-playing: DeepBlue and AlphaGo Brief history of gameplaying frontiers 1990s: Othello world champions refuse to play computers 1994: Chinook defeats Checkers world champion 1997: DeepBlue defeats world

More information

Principles of Computer Game Design and Implementation. Lecture 29

Principles of Computer Game Design and Implementation. Lecture 29 Principles of Computer Game Design and Implementation Lecture 29 Putting It All Together Games are unimaginable without AI (Except for puzzles, casual games, ) No AI no computer adversary/companion Good

More information

Principles of Computer Game Design and Implementation. Lecture 20

Principles of Computer Game Design and Implementation. Lecture 20 Principles of Computer Game Design and Implementation Lecture 20 utline for today Sense-Think-Act Cycle: Thinking Acting 2 Agents and Virtual Player Agents, no virtual player Shooters, racing, Virtual

More information

Programming Project 1: Pacman (Due )

Programming Project 1: Pacman (Due ) Programming Project 1: Pacman (Due 8.2.18) Registration to the exams 521495A: Artificial Intelligence Adversarial Search (Min-Max) Lectured by Abdenour Hadid Adjunct Professor, CMVS, University of Oulu

More information

Game Playing State-of-the-Art

Game Playing State-of-the-Art Adversarial Search [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] Game Playing State-of-the-Art

More information

Outline. Introduction to AI. Artificial Intelligence. What is an AI? What is an AI? Agents Environments

Outline. Introduction to AI. Artificial Intelligence. What is an AI? What is an AI? Agents Environments Outline Introduction to AI ECE457 Applied Artificial Intelligence Fall 2007 Lecture #1 What is an AI? Russell & Norvig, chapter 1 Agents s Russell & Norvig, chapter 2 ECE457 Applied Artificial Intelligence

More information

INTRODUCTION TO GAME AI

INTRODUCTION TO GAME AI CS 387: GAME AI INTRODUCTION TO GAME AI 3/31/2016 Instructor: Santiago Ontañón santi@cs.drexel.edu Class website: https://www.cs.drexel.edu/~santi/teaching/2016/cs387/intro.html Outline Game Engines Perception

More information

Game Playing State-of-the-Art. CS 188: Artificial Intelligence. Behavior from Computation. Video of Demo Mystery Pacman. Adversarial Search

Game Playing State-of-the-Art. CS 188: Artificial Intelligence. Behavior from Computation. Video of Demo Mystery Pacman. Adversarial Search CS 188: Artificial Intelligence Adversarial Search Instructor: Marco Alvarez University of Rhode Island (These slides were created/modified by Dan Klein, Pieter Abbeel, Anca Dragan for CS188 at UC Berkeley)

More information

Outline. Game Playing. Game Problems. Game Problems. Types of games Playing a perfect game. Playing an imperfect game

Outline. Game Playing. Game Problems. Game Problems. Types of games Playing a perfect game. Playing an imperfect game Outline Game Playing ECE457 Applied Artificial Intelligence Fall 2007 Lecture #5 Types of games Playing a perfect game Minimax search Alpha-beta pruning Playing an imperfect game Real-time Imperfect information

More information

Adversarial Search. Human-aware Robotics. 2018/01/25 Chapter 5 in R&N 3rd Ø Announcement: Slides for this lecture are here:

Adversarial Search. Human-aware Robotics. 2018/01/25 Chapter 5 in R&N 3rd Ø Announcement: Slides for this lecture are here: Adversarial Search 2018/01/25 Chapter 5 in R&N 3rd Ø Announcement: q Slides for this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse471/lectures/adversarial.pdf Slides are largely based

More information

CSE 473: Artificial Intelligence. Outline

CSE 473: Artificial Intelligence. Outline CSE 473: Artificial Intelligence Adversarial Search Dan Weld Based on slides from Dan Klein, Stuart Russell, Pieter Abbeel, Andrew Moore and Luke Zettlemoyer (best illustrations from ai.berkeley.edu) 1

More information

CS 387: GAME AI BOARD GAMES. 5/24/2016 Instructor: Santiago Ontañón

CS 387: GAME AI BOARD GAMES. 5/24/2016 Instructor: Santiago Ontañón CS 387: GAME AI BOARD GAMES 5/24/2016 Instructor: Santiago Ontañón santi@cs.drexel.edu Class website: https://www.cs.drexel.edu/~santi/teaching/2016/cs387/intro.html Reminders Check BBVista site for the

More information

History and Philosophical Underpinnings

History and Philosophical Underpinnings History and Philosophical Underpinnings Last Class Recap game-theory why normal search won t work minimax algorithm brute-force traversal of game tree for best move alpha-beta pruning how to improve on

More information

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence CS 4700: Foundations of Artificial Intelligence selman@cs.cornell.edu Module: Adversarial Search R&N: Chapter 5 Part II 1 Outline Game Playing Optimal decisions Minimax α-β pruning Case study: Deep Blue

More information

Game Designers. Understanding Design Computing and Cognition (DECO1006)

Game Designers. Understanding Design Computing and Cognition (DECO1006) Game Designers Understanding Design Computing and Cognition (DECO1006) Rob Saunders web: http://www.arch.usyd.edu.au/~rob e-mail: rob@arch.usyd.edu.au office: Room 274, Wilkinson Building Who are these

More information

Adversarial Search. Read AIMA Chapter CIS 421/521 - Intro to AI 1

Adversarial Search. Read AIMA Chapter CIS 421/521 - Intro to AI 1 Adversarial Search Read AIMA Chapter 5.2-5.5 CIS 421/521 - Intro to AI 1 Adversarial Search Instructors: Dan Klein and Pieter Abbeel University of California, Berkeley [These slides were created by Dan

More information

CS 188: Artificial Intelligence

CS 188: Artificial Intelligence CS 188: Artificial Intelligence Adversarial Search Instructor: Stuart Russell University of California, Berkeley Game Playing State-of-the-Art Checkers: 1950: First computer player. 1959: Samuel s self-taught

More information

Chapter 1 Non-Player Characters in Multiuser Games

Chapter 1 Non-Player Characters in Multiuser Games Chapter 1 Non-Player Characters in Multiuser Games Massively multiuser, persistent, online virtual worlds are emerging as important platforms for multiuser computer games, social interaction, education,

More information

Adversarial Search. Hal Daumé III. Computer Science University of Maryland CS 421: Introduction to Artificial Intelligence 9 Feb 2012

Adversarial Search. Hal Daumé III. Computer Science University of Maryland CS 421: Introduction to Artificial Intelligence 9 Feb 2012 1 Hal Daumé III (me@hal3.name) Adversarial Search Hal Daumé III Computer Science University of Maryland me@hal3.name CS 421: Introduction to Artificial Intelligence 9 Feb 2012 Many slides courtesy of Dan

More information

USING VALUE ITERATION TO SOLVE SEQUENTIAL DECISION PROBLEMS IN GAMES

USING VALUE ITERATION TO SOLVE SEQUENTIAL DECISION PROBLEMS IN GAMES USING VALUE ITERATION TO SOLVE SEQUENTIAL DECISION PROBLEMS IN GAMES Thomas Hartley, Quasim Mehdi, Norman Gough The Research Institute in Advanced Technologies (RIATec) School of Computing and Information

More information

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence CS 4700: Foundations of Artificial Intelligence selman@cs.cornell.edu Module: Adversarial Search R&N: Chapter 5 1 Outline Adversarial Search Optimal decisions Minimax α-β pruning Case study: Deep Blue

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Adversarial Search Vibhav Gogate The University of Texas at Dallas Some material courtesy of Rina Dechter, Alex Ihler and Stuart Russell, Luke Zettlemoyer, Dan Weld Adversarial

More information

Measuring the Games Influence on Improving English Proficiency

Measuring the Games Influence on Improving English Proficiency Measuring the Games Influence on Improving English Proficiency Reni Dwi Pertiwi, Erdhi Widyarto N. Department of Information System Soegijapranata Catholic University, Semarang, Indonesia reni2pertiwi@gmail.com

More information

VR AR. (Immersion) (Interaction) (International) ---

VR AR. (Immersion) (Interaction) (International) --- 1 ( VR AR (Immersion) (Interaction) (International) --- ( 2 : 2Dà3D ( : : 3 ( 4 vs. HMD 5 CAVE VRD Nitendo Wii 6 7 ( : à : à ( ) 8 vs. : --- + I I/O I/O, S O :» I/O» :»» 9 ( 1, à, ) ( ) 2 ( à ( à 3, 10

More information

CSE 40171: Artificial Intelligence. Adversarial Search: Games and Optimality

CSE 40171: Artificial Intelligence. Adversarial Search: Games and Optimality CSE 40171: Artificial Intelligence Adversarial Search: Games and Optimality 1 What is a game? Game Playing State-of-the-Art Checkers: 1950: First computer player. 1994: First computer champion: Chinook

More information

Artificial Intelligence: Implications for Autonomous Weapons. Stuart Russell University of California, Berkeley

Artificial Intelligence: Implications for Autonomous Weapons. Stuart Russell University of California, Berkeley Artificial Intelligence: Implications for Autonomous Weapons Stuart Russell University of California, Berkeley Outline AI and autonomy State of the art Likely future developments Conclusions What is AI?

More information

CS 387/680: GAME AI AI FOR FIRST-PERSON SHOOTERS

CS 387/680: GAME AI AI FOR FIRST-PERSON SHOOTERS CS 387/680: GAME AI AI FOR FIRST-PERSON SHOOTERS 4/28/2014 Instructor: Santiago Ontañón santi@cs.drexel.edu TA: Alberto Uriarte office hours: Tuesday 4-6pm, Cyber Learning Center Class website: https://www.cs.drexel.edu/~santi/teaching/2014/cs387-680/intro.html

More information

CS 188: Artificial Intelligence Spring Announcements

CS 188: Artificial Intelligence Spring Announcements CS 188: Artificial Intelligence Spring 2011 Lecture 7: Minimax and Alpha-Beta Search 2/9/2011 Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein 1 Announcements W1 out and due Monday 4:59pm P2

More information

Basic AI Techniques for o N P N C P C Be B h e a h v a i v ou o r u s: s FS F T S N

Basic AI Techniques for o N P N C P C Be B h e a h v a i v ou o r u s: s FS F T S N Basic AI Techniques for NPC Behaviours: FSTN Finite-State Transition Networks A 1 a 3 2 B d 3 b D Action State 1 C Percept Transition Team Buddies (SCEE) Introduction Behaviours characterise the possible

More information

Artificial Intelligence. Minimax and alpha-beta pruning

Artificial Intelligence. Minimax and alpha-beta pruning Artificial Intelligence Minimax and alpha-beta pruning In which we examine the problems that arise when we try to plan ahead to get the best result in a world that includes a hostile agent (other agent

More information

Making Simple Decisions CS3523 AI for Computer Games The University of Aberdeen

Making Simple Decisions CS3523 AI for Computer Games The University of Aberdeen Making Simple Decisions CS3523 AI for Computer Games The University of Aberdeen Contents Decision making Search and Optimization Decision Trees State Machines Motivating Question How can we program rules

More information

CSE 573: Artificial Intelligence

CSE 573: Artificial Intelligence CSE 573: Artificial Intelligence Adversarial Search Dan Weld Based on slides from Dan Klein, Stuart Russell, Pieter Abbeel, Andrew Moore and Luke Zettlemoyer (best illustrations from ai.berkeley.edu) 1

More information

The Arcade Era

The Arcade Era The Arcade Era 1978-1985 The Serendipitous Discovery Space Invaders: 1978 The Serendipitous Discovery The invaders become faster and harder to shoot as the levels go on. The player doesn t gain this advantage

More information

CS 188: Artificial Intelligence. Overview

CS 188: Artificial Intelligence. Overview CS 188: Artificial Intelligence Lecture 6 and 7: Search for Games Pieter Abbeel UC Berkeley Many slides adapted from Dan Klein 1 Overview Deterministic zero-sum games Minimax Limited depth and evaluation

More information

Adjustable Group Behavior of Agents in Action-based Games

Adjustable Group Behavior of Agents in Action-based Games Adjustable Group Behavior of Agents in Action-d Games Westphal, Keith and Mclaughlan, Brian Kwestp2@uafortsmith.edu, brian.mclaughlan@uafs.edu Department of Computer and Information Sciences University

More information

RoboCup. Presented by Shane Murphy April 24, 2003

RoboCup. Presented by Shane Murphy April 24, 2003 RoboCup Presented by Shane Murphy April 24, 2003 RoboCup: : Today and Tomorrow What we have learned Authors Minoru Asada (Osaka University, Japan), Hiroaki Kitano (Sony CS Labs, Japan), Itsuki Noda (Electrotechnical(

More information

CS 387/680: GAME AI BOARD GAMES

CS 387/680: GAME AI BOARD GAMES CS 387/680: GAME AI BOARD GAMES 6/2/2014 Instructor: Santiago Ontañón santi@cs.drexel.edu TA: Alberto Uriarte office hours: Tuesday 4-6pm, Cyber Learning Center Class website: https://www.cs.drexel.edu/~santi/teaching/2014/cs387-680/intro.html

More information

Adversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017

Adversarial Search and Game Theory. CS 510 Lecture 5 October 26, 2017 Adversarial Search and Game Theory CS 510 Lecture 5 October 26, 2017 Reminders Proposals due today Midterm next week past midterms online Midterm online BBLearn Available Thurs-Sun, ~2 hours Overview Game

More information

CS440/ECE448 Lecture 9: Minimax Search. Slides by Svetlana Lazebnik 9/2016 Modified by Mark Hasegawa-Johnson 9/2017

CS440/ECE448 Lecture 9: Minimax Search. Slides by Svetlana Lazebnik 9/2016 Modified by Mark Hasegawa-Johnson 9/2017 CS440/ECE448 Lecture 9: Minimax Search Slides by Svetlana Lazebnik 9/2016 Modified by Mark Hasegawa-Johnson 9/2017 Why study games? Games are a traditional hallmark of intelligence Games are easy to formalize

More information

The first topic I would like to explore is probabilistic reasoning with Bayesian

The first topic I would like to explore is probabilistic reasoning with Bayesian Michael Terry 16.412J/6.834J 2/16/05 Problem Set 1 A. Topics of Fascination The first topic I would like to explore is probabilistic reasoning with Bayesian nets. I see that reasoning under situations

More information

CSE 473: Artificial Intelligence Fall Outline. Types of Games. Deterministic Games. Previously: Single-Agent Trees. Previously: Value of a State

CSE 473: Artificial Intelligence Fall Outline. Types of Games. Deterministic Games. Previously: Single-Agent Trees. Previously: Value of a State CSE 473: Artificial Intelligence Fall 2014 Adversarial Search Dan Weld Outline Adversarial Search Minimax search α-β search Evaluation functions Expectimax Reminder: Project 1 due Today Based on slides

More information

Chapter 14 Optimization of AI Tactic in Action-RPG Game

Chapter 14 Optimization of AI Tactic in Action-RPG Game Chapter 14 Optimization of AI Tactic in Action-RPG Game Kristo Radion Purba Abstract In an Action RPG game, usually there is one or more player character. Also, there are many enemies and bosses. Player

More information

Last Week. G54GAM - Games. A Language for Defining Games. Last Week. Defining Play, Games and Genres

Last Week. G54GAM - Games. A Language for Defining Games. Last Week. Defining Play, Games and Genres Last Week G54GAM - Games http://www.cs.nott.ac.uk/~mdf/ teaching_g54gam.html mdf@cs.nott.ac.uk Defining Play, Games and Genres Last Week A Brief History of Computer Games Origins of Computer Games The

More information

COMP219: COMP219: Artificial Intelligence Artificial Intelligence Dr. Annabel Latham Lecture 12: Game Playing Overview Games and Search

COMP219: COMP219: Artificial Intelligence Artificial Intelligence Dr. Annabel Latham Lecture 12: Game Playing Overview Games and Search COMP19: Artificial Intelligence COMP19: Artificial Intelligence Dr. Annabel Latham Room.05 Ashton Building Department of Computer Science University of Liverpool Lecture 1: Game Playing 1 Overview Last

More information

SWARM INTELLIGENCE. Mario Pavone Department of Mathematics & Computer Science University of Catania

SWARM INTELLIGENCE. Mario Pavone Department of Mathematics & Computer Science University of Catania Worker Ant #1: I'm lost! Where's the line? What do I do? Worker Ant #2: Help! Worker Ant #3: We'll be stuck here forever! Mr. Soil: Do not panic, do not panic. We are trained professionals. Now, stay calm.

More information

CS 480: GAME AI DECISION MAKING AND SCRIPTING

CS 480: GAME AI DECISION MAKING AND SCRIPTING CS 480: GAME AI DECISION MAKING AND SCRIPTING 4/24/2012 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2012/cs480/intro.html Reminders Check BBVista site for the course

More information

Discussion on Different Types of Game User Interface

Discussion on Different Types of Game User Interface 2017 2nd International Conference on Mechatronics and Information Technology (ICMIT 2017) Discussion on Different Types of Game User Interface Yunsong Hu1, a 1 college of Electronical and Information Engineering,

More information

CSE 573: Artificial Intelligence Autumn 2010

CSE 573: Artificial Intelligence Autumn 2010 CSE 573: Artificial Intelligence Autumn 2010 Lecture 4: Adversarial Search 10/12/2009 Luke Zettlemoyer Based on slides from Dan Klein Many slides over the course adapted from either Stuart Russell or Andrew

More information

Strategic and Tactical Reasoning with Waypoints Lars Lidén Valve Software

Strategic and Tactical Reasoning with Waypoints Lars Lidén Valve Software Strategic and Tactical Reasoning with Waypoints Lars Lidén Valve Software lars@valvesoftware.com For the behavior of computer controlled characters to become more sophisticated, efficient algorithms are

More information

Evolutionary Computation for Creativity and Intelligence. By Darwin Johnson, Alice Quintanilla, and Isabel Tweraser

Evolutionary Computation for Creativity and Intelligence. By Darwin Johnson, Alice Quintanilla, and Isabel Tweraser Evolutionary Computation for Creativity and Intelligence By Darwin Johnson, Alice Quintanilla, and Isabel Tweraser Introduction to NEAT Stands for NeuroEvolution of Augmenting Topologies (NEAT) Evolves

More information

the question of whether computers can think is like the question of whether submarines can swim -- Dijkstra

the question of whether computers can think is like the question of whether submarines can swim -- Dijkstra the question of whether computers can think is like the question of whether submarines can swim -- Dijkstra Game AI: The set of algorithms, representations, tools, and tricks that support the creation

More information

2IOE0 Interactive Intelligent Systems

2IOE0 Interactive Intelligent Systems 2IOE0 Interactive Intelligent Systems Huub van de Wetering TU/e edition 2018-Q1 Huub van de Wetering (TU/e) 2IOE0 Interactive Intelligent Systems edition 2018-Q1 1 / 22 Introduction Course resources 1

More information

Artificial Intelligence ( CS 365 ) IMPLEMENTATION OF AI SCRIPT GENERATOR USING DYNAMIC SCRIPTING FOR AOE2 GAME

Artificial Intelligence ( CS 365 ) IMPLEMENTATION OF AI SCRIPT GENERATOR USING DYNAMIC SCRIPTING FOR AOE2 GAME Artificial Intelligence ( CS 365 ) IMPLEMENTATION OF AI SCRIPT GENERATOR USING DYNAMIC SCRIPTING FOR AOE2 GAME Author: Saurabh Chatterjee Guided by: Dr. Amitabha Mukherjee Abstract: I have implemented

More information

CISC 1600 Introduction to Multi-media Computing

CISC 1600 Introduction to Multi-media Computing CISC 1600 Introduction to Multi-media Computing Summer Session II 2012 Instructor : J. Raphael Email Address: Course Page: Class Hours: raphael@sci.brooklyn.cuny.edu http://www.sci.brooklyn.cuny.edu/~raphael/cisc1600.html

More information

Lecture 1. CMPS 146, Fall Josh McCoy

Lecture 1. CMPS 146, Fall Josh McCoy Lecture 1 Josh McCoy Instructor and Teaching Assistant Joshua McCoy E2 261 Ofce Hours: MF 2-3p mccoyjo+cmps146@soe.ucsc.edu Bryan Blackford E2 393 Ofce Hours: TBD bblackfo@soe.ucsc.edu Course Book Artifcial

More information

CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH. Santiago Ontañón

CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH. Santiago Ontañón CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH Santiago Ontañón so367@drexel.edu Recall: Problem Solving Idea: represent the problem we want to solve as: State space Actions Goal check Cost function

More information

Objectives. Game AI: Collaborative Diffusion. Project: The Sims. Advance from simple game to very sophisticated games

Objectives. Game AI: Collaborative Diffusion. Project: The Sims. Advance from simple game to very sophisticated games welcome to Objectives Game AI: Collaborative Diffusion Advance from simple game to very sophisticated games Project: The Sims game AI single Agent ALife: agent acts intelligent: develops goals based on

More information

Level 3 Extended Diploma Unit 22 Developing Computer Games

Level 3 Extended Diploma Unit 22 Developing Computer Games Level 3 Extended Diploma Unit 22 Developing Computer Games Outcomes LO1 Understand the impact of the gaming revolution on society LO2 Know the different types of computer game LO3 Be able to design and

More information

SE320: Introduction to Computer Games

SE320: Introduction to Computer Games SE320: Introduction to Computer Games Week 2 Gazihan Alankus 10/4/2011 1 Outline Introduction Project Today s class: video game concepts 10/4/2011 2 1 Outline Introduction Project Today s class: video

More information

Intuition Mini-Max 2

Intuition Mini-Max 2 Games Today Saying Deep Blue doesn t really think about chess is like saying an airplane doesn t really fly because it doesn t flap its wings. Drew McDermott I could feel I could smell a new kind of intelligence

More information

Games CSE 473. Kasparov Vs. Deep Junior August 2, 2003 Match ends in a 3 / 3 tie!

Games CSE 473. Kasparov Vs. Deep Junior August 2, 2003 Match ends in a 3 / 3 tie! Games CSE 473 Kasparov Vs. Deep Junior August 2, 2003 Match ends in a 3 / 3 tie! Games in AI In AI, games usually refers to deteristic, turntaking, two-player, zero-sum games of perfect information Deteristic:

More information

Outline. Agents and environments Rationality PEAS (Performance measure, Environment, Actuators, Sensors) Environment types Agent types

Outline. Agents and environments Rationality PEAS (Performance measure, Environment, Actuators, Sensors) Environment types Agent types Intelligent Agents Outline Agents and environments Rationality PEAS (Performance measure, Environment, Actuators, Sensors) Environment types Agent types Agents An agent is anything that can be viewed as

More information

COMP219: Artificial Intelligence. Lecture 13: Game Playing

COMP219: Artificial Intelligence. Lecture 13: Game Playing CMP219: Artificial Intelligence Lecture 13: Game Playing 1 verview Last time Search with partial/no observations Belief states Incremental belief state search Determinism vs non-determinism Today We will

More information

Adversarial search (game playing)

Adversarial search (game playing) Adversarial search (game playing) References Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Nilsson, Artificial intelligence: A New synthesis. McGraw Hill,

More information

CS 188: Artificial Intelligence Fall AI Applications

CS 188: Artificial Intelligence Fall AI Applications CS 188: Artificial Intelligence Fall 2009 Lecture 27: Conclusion 12/3/2009 Dan Klein UC Berkeley AI Applications 2 1 Pacman Contest Challenges: Long term strategy Multiple agents Adversarial utilities

More information

Adversarial Search and Game- Playing C H A P T E R 6 C M P T : S P R I N G H A S S A N K H O S R A V I

Adversarial Search and Game- Playing C H A P T E R 6 C M P T : S P R I N G H A S S A N K H O S R A V I Adversarial Search and Game- Playing C H A P T E R 6 C M P T 3 1 0 : S P R I N G 2 0 1 1 H A S S A N K H O S R A V I Adversarial Search Examine the problems that arise when we try to plan ahead in a world

More information

IMGD 1001: Programming Practices; Artificial Intelligence

IMGD 1001: Programming Practices; Artificial Intelligence IMGD 1001: Programming Practices; Artificial Intelligence Robert W. Lindeman Associate Professor Department of Computer Science Worcester Polytechnic Institute gogo@wpi.edu Outline Common Practices Artificial

More information

Survey Platform

Survey Platform Survey Doron Nussbaum COMP 350 Survey Results 202 Platform Weighted Nintendo DS 7% Other Play Station 0% PC/Mac 50% PC/Mac Xbox Play Station Nintendo DS Other Xbox 30% Doron Nussbaum COMP 350 Survey Results

More information

the question of whether computers can think is like the question of whether submarines can swim -- Dijkstra

the question of whether computers can think is like the question of whether submarines can swim -- Dijkstra the question of whether computers can think is like the question of whether submarines can swim -- Dijkstra Game AI: The set of algorithms, representations, tools, and tricks that support the creation

More information

IMGD Technical Game Development I: Introduction. by Robert W. Lindeman

IMGD Technical Game Development I: Introduction. by Robert W. Lindeman IMGD 3000 - Technical Game Development I: Introduction by Robert W. Lindeman gogo@wpi.edu What to Expect This course is mainly about the nuts and bolts of creating game-engine code Game architecture, algorithms,

More information

Trade Offs in Game Design

Trade Offs in Game Design Trade Offs in Game Design Trade Offs in Game Design Quite often in game design, there are conflicts between different design goals. One design goal can be achieved only through sacrificing others. Sometimes,

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Adversarial Search Vibhav Gogate The University of Texas at Dallas Some material courtesy of Rina Dechter, Alex Ihler and Stuart Russell, Luke Zettlemoyer, Dan Weld Adversarial

More information

Applying Theta* in Modern Game

Applying Theta* in Modern Game Applying Theta* in Modern Game Phuc Tran Huu Le*, Nguyen Tam Nguyen Truong, MinSu Kim, Wonshoup So, Jae Hak Jung Yeungnam University, Gyeongsan-si, South Korea. *Corresponding author. Tel: +821030252106;

More information

IMGD 1001: Programming Practices; Artificial Intelligence

IMGD 1001: Programming Practices; Artificial Intelligence IMGD 1001: Programming Practices; Artificial Intelligence by Mark Claypool (claypool@cs.wpi.edu) Robert W. Lindeman (gogo@wpi.edu) Outline Common Practices Artificial Intelligence Claypool and Lindeman,

More information

Game playing. Chapter 6. Chapter 6 1

Game playing. Chapter 6. Chapter 6 1 Game playing Chapter 6 Chapter 6 1 Outline Games Perfect play minimax decisions α β pruning Resource limits and approximate evaluation Games of chance Games of imperfect information Chapter 6 2 Games vs.

More information

CS510 \ Lecture Ariel Stolerman

CS510 \ Lecture Ariel Stolerman CS510 \ Lecture04 2012-10-15 1 Ariel Stolerman Administration Assignment 2: just a programming assignment. Midterm: posted by next week (5), will cover: o Lectures o Readings A midterm review sheet will

More information

Game Playing State of the Art

Game Playing State of the Art Game Playing State of the Art Checkers: Chinook ended 40 year reign of human world champion Marion Tinsley in 1994. Used an endgame database defining perfect play for all positions involving 8 or fewer

More information

Game Playing State-of-the-Art CSE 473: Artificial Intelligence Fall Deterministic Games. Zero-Sum Games 10/13/17. Adversarial Search

Game Playing State-of-the-Art CSE 473: Artificial Intelligence Fall Deterministic Games. Zero-Sum Games 10/13/17. Adversarial Search CSE 473: Artificial Intelligence Fall 2017 Adversarial Search Mini, pruning, Expecti Dieter Fox Based on slides adapted Luke Zettlemoyer, Dan Klein, Pieter Abbeel, Dan Weld, Stuart Russell or Andrew Moore

More information