AI and Computer Games (informational session) Lecture by: Dustin Dannenhauer Professor Héctor Muñoz-Avila Computer Science and Eng.

Slides:



Advertisements
Similar presentations
7.1. O SCARS & A RTIFICIAL I NTELLIGENCE Interim awards and introduction to game AI.
Advertisements

AI Pathfinding Representing the Search Space
Adversarial Search We have experience in search where we assume that we are the only intelligent being and we have explicit control over the “world”. Lets.
Navigation Set Hierarchy Tom Gianos Chapter 2.2. Mike Dickheiser Works (worked?) for Red Storm Entertainment Works (worked?) for Red Storm Entertainment.
Improving Gameplay: Characterising Differences between NPCs & Human Players Jennifer Sandercock.
Artificial Intelligence in Real Time Strategy Games Dan Li.
Artificial Intelligence for Games Patrick Olivier & John Shearer
Machine Learning in Computer Games Learning in Computer Games By: Marc Ponsen.
Half life 2/ Counter Strike: Source bot Charlie Cross CIS
Adversarial Search Chapter 5.
Application of Artificial intelligence to Chess Playing Capstone Design Project 2004 Jason Cook Bitboards  Bitboards are 64 bit unsigned integers, with.
An Introduction to Artificial Intelligence Lecture VI: Adversarial Search (Games) Ramin Halavati In which we examine problems.
Automated Planning & Computer Games: Perspectives and Applications Hector Munoz-Avila.
Introduction to Robotics In the name of Allah. Introduction to Robotics o Leila Sharif o o Lecture #2: The Big.
Artificial Intelligence in Video Games By: Renaldo Doe Kevin Lam.
Machine Learning CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 5.
Games with Chance Other Search Algorithms CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 3 Adapted from slides of Yoonsuck Choe.
November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.
Reinforcement Learning in Real-Time Strategy Games Nick Imrei Supervisors: Matthew Mitchell & Martin Dick.
AI – Week 8 AI + 2 Player Games Lee McCluskey, room 3/10
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
Games & Adversarial Search Chapter 6 Section 1 – 4.
國立雲林科技大學 National Yunlin University of Science and Technology Building Reactive Characters for Dynamic Gaming Environments Peter Blackburn and Barry O’Sullivan,
Artificial Intelligence in Game Design Problems and Goals.
Lecture 1 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Badminton National Curriculum Attainment Level Key Black – Developing Skills (DS) Pink – Making and Applying Decisions (MAD) Blue – Evaluate and Improve.
Reinforcement Learning and Markov Decision Processes: A Quick Introduction Hector Munoz-Avila Stephen Lee-Urban
Survey of AI for games. AI vs. AI for games Traditional AI: – Made to handle unseen inputs, large state space – Too many options possible to compute an.
Games as Game Theory Systems (Ch. 19). Game Theory It is not a theoretical approach to games Game theory is the mathematical study of decision making.
Agents that can play multi-player games. Recall: Single-player, fully-observable, deterministic game agents An agent that plays Peg Solitaire involves.
RECAP CSE 348 AI Game Programming Héctor Muñoz-Avila.
Game AI versus AI: An Introduction to AI Game Programming Héctor Muñoz-Avila.
Artificial Intelligence Techniques Artificial Stupidity?
1 CO Games Development 1 Week 11 Search Methods Gareth Bellaby.
Adversarial Search Chapter 6 Section 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
AI in Computer Gaming: The first person shooter Tyler Hulburd.
Machine Learning in Computer Games Marc Ponsen 11/29/04.
Memory and Analogy in Game-Playing Agents Jonathan Rubin & Ian Watson University of Auckland Game AI Group
Software Instrumentation of Computer and Video Games T. Bullen and M. Katchabaw Department of Computer Science The University of Western Ontario N. Dyer-Witheford.
Artificial Intelligence in Game Design N-Grams and Decision Tree Learning.
Robotics Sharif In the name of Allah. Robotics Sharif Introduction to Robotics o Leila Sharif o o Lecture #2: The.
1 Introduction to Artificial Intelligence (Lecture 1)
Jumping, Climbing, and Tactical Reasoning Section 2.5 Tom Schaible CSE 497 – AI & Game Programming.
WORLD NAVIGATION Don’t Fall Asleep Through These Topics  Tile Graphs  Points of Visibility  NavMesh  Path Smoothing  Hierarchical Pathfinding.
Application of AI techniques for Computer Games BSc Computer Games Programming, 2006 Julien Delezenne GAMES ARTIFICIAL INTELLIGENCE.
Artificial intelligence
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
AI Evaluation David Nowell CIS 588 2/14/05 Baldur’s Gate.
Game Playing Revision Mini-Max search Alpha-Beta pruning General concerns on games.
F.E.A.R. Game AI Evaluation by Robert Rak. What is F.E.A.R. ? FEAR is a First Person Shooter game Player takes on the role of an elite strike force team.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
Wingers creating space on the flank in formation
Game tree search Chapter 6 (6.1 to 6.3 and 6.6) cover games. 6.6 covers state of the art game players in particular. 6.5 covers games that involve uncertainty.
Reinforcement Learning AI – Week 22 Sub-symbolic AI Two: An Introduction to Reinforcement Learning Lee McCluskey, room 3/10
Introduction to Machine Learning © Roni Rosenfeld,
Administrative: “Create New Game” Project Apply the principles of Iterative Design –First run of games in class: March 28 th in class Short document describing:
Designing Intelligence Logical and Artificial Intelligence in Games Lecture 2.
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.
ADVERSARIAL SEARCH Chapter 6 Section 1 – 4. OUTLINE Optimal decisions α-β pruning Imperfect, real-time decisions.
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.
Network Management Lecture 13. MACHINE LEARNING TECHNIQUES 2 Dr. Atiq Ahmed Université de Balouchistan.
The Game Development Process: Artificial Intelligence.
Brief Intro to Machine Learning CS539
Done Done Course Overview What is AI? What are the Major Challenges?
Announcements Homework 3 due today (grace period through Friday)
CIS 488/588 Bruce R. Maxim UM-Dearborn
Introduction to Artificial Intelligence Lecture 9: Two-Player Games I
Presentation transcript:

AI and Computer Games (informational session) Lecture by: Dustin Dannenhauer Professor Héctor Muñoz-Avila Computer Science and Eng.

AI and Game Design We want to understand what kinds of in-game tasks AI can perform This will help us understand what kinds of possibilities and limitations we can expect of AI when designing games Some games have failed because of unrealistic expectations - amount of effort required to create good AI or even its feasibility –E.g., the poor AI of the automated companion in the Daikatana game we discussed before In this lecture we will focus on “what” instead of “how” –Recommended courses to learn about “how”: CSE 348 AI Game Programming CSE 327 AI Theory and Practice

What is AI? Systems that think like humans Systems that think rationally Systems that act like humans Systems that act rationally Categories for definitions of AI

Pathfinding (1) Red team versus blue team Player controlling red team sets blue flag as destination Pathfinding can be used to plan the movement (1) of red units automatically Pathfinding is a well understood problem

Pathfinding Frequently games use a collection of nodes (“waypoints”) and edges connecting those nodes Algorithms are devised that find a path through the waypoints for two given nodes Challenges arise when there are too many waypoints

Memory Available The amount of memory available has increased Speed to process this memory has also increased

Taken Advantage of Memory Available Pre-compute all possible paths (figure from AI Game Programming Wisdom) So finding any (start,destination) path can be done quickly This is why pathfinding works so well in many commercial games If map changes (e.g., “terraforming”), an AI technique called “heuristic search” can be used. But this is used localized in a region to run efficiently

Pathfinding in Games Many examples: Most RTS use standard “point and click” command telling units where to go NPCs in RPGs can follow the player –Although not “perfect”: See video (9:40-10:10). Amazon (avatar) is followed by the lance mercenary (NPC). Sometimes the mercenary falls behindvideo NPCs in FPS games can navigate by themselves in complex environments (e.g., human vs AI death match in Unreal Tournament) –See video FFA, frag count, 16 players (only one is human)video

Planning Planning: automated generation of a sequence of actions to achieve a goal Example of an action: Example of a plan controlling an NPC Attack positioned Weapon ready Enemy attacked preconditions effects Take-cover Load-weaponattack

Planning in Games NPCs in FEAR are controlled using planning (video on image) 40:00-1:40 NPCs takes cover, flank One could have created an FSM for this same behavior But for play variety purposes we will need to create many FSMs Planning can generate these behaviours automatically –This is what FEAR does

What-If Analysis (1) What-if analysis to counter the opponent Red team is controlled by AI The AI can analyze and predict what blue will do and counter- plan accordingly In this example: red sends force (2) to delay blue This works only on small spaces (maps) (2)

Minimax Idea: Build a tree describing all possible gaming moves between two opponents Analyze tree looking ahead N moves into the “horizon” and select best move Well understood: Nash equilibrium Challenges:  game tree can be too large Ways around:  Parallelism & heuristics: Deep Blue  Abstraction

What-if Analysis in Games Used in some Poker playing games –Because tree is so large, state abstraction is needed (e.g., grouping hands that have similar expected strength) Demonstrated in RTS games for micromanagement  Mini-battle between small groups of opposing units  Many such encounters take place in a match  Proficiency in these mini- battles is crucial

Machine Learning (1) Suppose red is a automated player Machine learning enables an automated player to learn Suppose blue had strong defenses along path (1) As a result, the approach (1) fails The automated player learns form this and tries path (3) (3)

Machine Learning Multiples ways to learn in games: –Learn by observing other players –Learn by processing gameplay logs –Learn while playing Why machine learning in games? Among others: –Self-correction Automatically fixing exploits –Creativity Responding intelligently to new situations –Scalability Better entertainment for strong players Better entertainment for weak players

Recall: Domination Games A number of fixed domination locations. When a team member steps into one of these locations, the status of the location changes to be under the control of his/her team. The team gets a point for every five seconds that each domination location remains under the control of that team. The game is won by the first team that gets a pre-specified amount of points. We used Unreal Tournament© a team-based FPSUnreal Tournament

Before/After Learning Before (video) After After (video) Bad: NPCs concentrate on one flag Better: NPCs focus on two flags

Machine Learning in Games Player trains a creature The creature learns from player’s feedback: –If player wants to reward creature’s actions  scratches creature's belly –If player wants to punish creature’s actions  slap create Over time creature behaves consistently with feedback received (video linked from figure)

Final remarks AI has been successfully applied in a number of games –We have mentioned some: Fear, Black and White Aside from heuristic pathfinding techniques, use of AI has been limited in commercial games Some reasons for this: –Game designers are worried about the AI doing unexpected (e.g., “silly”) things –Lack of understanding about its capabilities –Historic limitations in computing power (this is becoming less of an issue) But there are a lot of exciting possibilities: videovideo