CS 680: GAME AI INTRODUCTION TO GAME AI. 1/9/2012 Santiago Ontañón
|
|
- Frederick Johns
- 5 years ago
- Views:
Transcription
1 CS 680: GAME AI INTRODUCTION TO GAME AI 1/9/2012 Santiago Ontañón
2 CS 680 Focus: advanced artificial intelligence techniques for computer games. Goal: cover state-of-the-art AI techniques that are 1) Recently used in commercial games, 2) Open problems in the game AI research community.
3 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
4 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
5 Structure of the Course 3 blocks: Real-time Strategy Games, Drama Management, Procedural Content Generation Flexible content Students need to: Complete 3 group projects (one per block) One of them will be your focus, and you will write a paper about it. Read 1 paper and present it in class on-line students will prepare a powerpoint/keynote/pdf presentation with audio Every 3 hour class will be divided in: 2 student paper presentations (20 minutes each) Lecture Project support session
6 Grading Projects: 70% Focus project: 40% Secondary projects: 15% each Paper presentation: 20% Attendance and class participation: 10%
7 Prerequisites Basic knowledge of artificial intelligence: Heuristic Search (e.g. A*) Game tree Search (e.g. minimax) Readings: Artificial Intelligence: A Modern Approach (Russell & Norvig) (Chapters 3,5,18)
8 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
9 What is Game AI? Artificial Intelligence for Computer Games Different from traditional AI Traditional AI: Optimality, efficiency Game AI: Fun, artificial stupidity
10 What is Game AI? Intersection of games and AI: Games AI Two (three) main communities working on it: Academics: Artificial Intelligence community: how can games help us have better AI (AI centric) Computer Game scholars: how can AI help us have better/more interesting/new forms of games?(games centric) Game industry: Their goal is to make games that sell more units (games centric)
11 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
12 Examples of Game AI Pac-Man (1980) First ever game to feature AI AI: finite state machine
13 Examples of Game AI Pac-Man (1980) First ever game to feature AI AI: finite state machine
14 Examples of Game AI Double Dragon AI: Finite State Machines
15 Examples of Game AI Chess AI needs to provide a collection of difficulty levels. Only one: hardest (to be played only against grand-masters), falls into the realm of traditional AI.
16 Examples of Game AI The Secret of Monkey Island And Then There Were None Dialogues, storytelling
17 Examples of Game AI Left 4 Dead 2 AI Director adjusts game pace to ensure desired dramatic effects
18 Examples of Game AI Black & White Uses machine learning to simulate a learning creature
19 Examples of Game AI Starcraft II Strategy, planning, pathfinding, economics, etc.
20 Types of Game AI Inside the game: Character control Director (drama management) During game development: Help in behavior/content design After game deployment: Analysis of game data
21 Types of Game AI Inside the game: Character control Director (drama management) Covered in this course During game development: Help in behavior/content design After game deployment: Analysis of game data
22 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
23 Basic Game AI Techniques Scripting: Finite State Machines, Behavior Trees Path-finding: A* Game Tree Search: Minimax Driving games: Steering behaviors [Physics: inverse kinematics] Plus a lot of fine-tuning
24 Scripting Most used game AI technique by far (99% of the games) Predefine behaviors of characters in the game Examples: Classic games (Pac-man, space invaders.), platformers (mario, turrican, etc.), strategy games (Dune II, Starcraft, etc.) Etc. Standard techniques: Finite-state machines Behavior trees Rule-sets High-level languages (e.g. lua)
25 Path-finding For navigating in complex maps Examples: Strategy games First-person shooters (Doom, Half-Life, etc.) RPGs (Skyrim) Standard techniques: A* Waypoint maps
26 Game Tree Search Adversarial games Examples: Board games (chess, checkers, backgamon, etc.) Standard techniques: Alpha-beta search (minimax)
27 Basic Game AI Techniques Not the goal of this course These basic Game AI techniques are covered in the intro to Game AI course (next quarter)
28 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
29 Course Scope Advanced AI techniques: recent theoretical developments with new applications to commercial games. Real-Time Strategy Games Drama Management Procedural Content Generation
30 Course Scope Advanced AI techniques: recent theoretical developments with new applications to commercial games. Real-Time Strategy Games Flexible smart architectures for RTS game AI Real-time path finding for large maps, with large number of units Complex intelligent decision making Drama Management Procedural Content Generation
31 Course Scope Advanced AI techniques: recent theoretical developments with new applications to commercial games. Real-Time Strategy Games Drama Management Self-adapting games Player modeling Automatic interestingness evaluation Procedural Content Generation
32 Course Scope Advanced AI techniques: recent theoretical developments with new applications to commercial games. Real-Time Strategy Games Drama Management Procedural Content Generation Automatic map and level generation Automatic story and plot generation
33 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
34 Paper Presentations Each student will have to read a paper and give a minutes presentation in class about it Presented papers will concern related topics to what was covered in class the previous week For copyright reasons, I ll give you the private URL for downloading the papers in class
35 Outline Structure of the course Intro to Game AI Examples of Game AI Basic Game AI techniques Course Scope Paper presentations Projects
36 Projects Group projects (2 people per group) 3 projects Each group will pick one as their focus project Focus project: The group will write a 6-page (AAAI proceedings style format) about their project Students are encouraged to consider submitting their paper to a Game AI conference if they consider the obtained results interesting. Non-focus projects: Each group will have up to 20 minutes of time at the end of the course to present them in class
37 Projects Goal The goal of the projects is not to implement some techniques and see that they work The goal is to understand their strengths and limitations Before starting the implementation of a project think what is that you want to understand, and don t lose time with aspects of the implementation that are irrelevant to your experiments. You will be required to experiment with your implementation and present experimental results showing strengths and limitations of the implemented techniques
38 Projects Experimentation The goal of your experiments is not to show that the algorithm you implemented is the best The goal is to understand the algorithm: When does it work, and when does it not? Why? What could be done to improve it? Does it achieve the desired effect? Results showing an algorithm doesn t work do not mean your project is bad.
39 Project 1: Real-Time Strategy Games You will have to implement an AI bot for a real RTS game. I suggest using one of these: Starcraft S3
40 Project 1: Real-Time Strategy Games Your AI bot needs to: Play the complete game: Doesn t have to be very good. Use, for example, a simple finite-state machine technique to design the overall strategy of your bot. Implement one of the advanced techniques we will study in class concerning: real-time path-finding, or decision making. Experiment with your bot: Make it play against the built-in AI, or against other existing Ais Compare the performance of your bot before and after implementing the advanced technique: Does it play better or worse? Is it more or less fun to play against?
41 Project 2: Drama Management Implement a Drama Manager on top of a game engine. I will provide you with one, but feel free to use another. The game engine comes with a specific game defined. Feel free to modify it or extend it if you need additional elements in your game to test your DM
42 Project 2: Drama Management Identify what do you want your Drama Manager to accomplish (control difficulty, lead the player to more enjoyable plots, etc.) That will determine what actions do you want the DM to be able to perform in the game Decide what technique you will use (search-based, CBR, etc.), and if it is search-based you will need to define the function to optimize Experiment with your DM: Ask some friends to play the game with or without it, and see their reactions. Does the DM achieve its goal? Is the game more fun?
43 Project 3: Procedural Content Generation Add procedural content generation techniques to a game engine. Use the same game engine you used for Project 2 You can choose whether you want the system to generate maps/rooms or story
44 Project 3: Procedural Content Generation Determine exactly the extent of what you want to be procedurally generated: Given a story, generate maps? Given a story and a high-level map, generate rooms? Given a map and rooms, generate a story? Etc. Pick a PCG technique (search-based, CBR, etc.) Experiment with the result: Is the generated content better than the original one? Was it cheaper to generate? Are the games with content generated procedurally as fun as the original one?
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 informationINTRODUCTION 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 informationINTRODUCTION 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 informationCS 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 informationCS 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 informationCS 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 informationGame 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 informationCS 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 informationAI in Computer Games. AI in Computer Games. Goals. Game A(I?) History Game categories
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
More informationCS 2710 Foundations of AI. Lecture 9. Adversarial search. CS 2710 Foundations of AI. Game search
CS 2710 Foundations of AI Lecture 9 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square CS 2710 Foundations of AI Game search Game-playing programs developed by AI researchers since
More informationCS 480: GAME AI TACTIC AND STRATEGY. 5/15/2012 Santiago Ontañón
CS 480: GAME AI TACTIC AND STRATEGY 5/15/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 regularly
More informationCS 680: GAME AI WEEK 4: DECISION MAKING IN RTS GAMES
CS 680: GAME AI WEEK 4: DECISION MAKING IN RTS GAMES 2/6/2012 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2012/cs680/intro.html Reminders Projects: Project 1 is simpler
More informationTGD3351 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 informationCS 1571 Introduction to AI Lecture 12. Adversarial search. CS 1571 Intro to AI. Announcements
CS 171 Introduction to AI Lecture 1 Adversarial search Milos Hauskrecht milos@cs.pitt.edu 39 Sennott Square Announcements Homework assignment is out Programming and experiments Simulated annealing + Genetic
More informationTGD3351 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 informationCS 380: ARTIFICIAL INTELLIGENCE
CS 380: ARTIFICIAL INTELLIGENCE INTRODUCTION 9/23/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html CS 380 Focus: Introduction to AI: basic concepts
More informationCS325 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 informationGames (adversarial search problems)
Mustafa Jarrar: Lecture Notes on Games, Birzeit University, Palestine Fall Semester, 204 Artificial Intelligence Chapter 6 Games (adversarial search problems) Dr. Mustafa Jarrar Sina Institute, University
More informationWho 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 informationCS 380: ARTIFICIAL INTELLIGENCE
CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH 10/23/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Recall: Problem Solving Idea: represent
More informationGame-playing AIs: Games and Adversarial Search FINAL SET (w/ pruning study examples) AIMA
Game-playing AIs: Games and Adversarial Search FINAL SET (w/ pruning study examples) AIMA 5.1-5.2 Games: Outline of Unit Part I: Games as Search Motivation Game-playing AI successes Game Trees Evaluation
More informationAdversarial Search. CS 486/686: Introduction to Artificial Intelligence
Adversarial Search CS 486/686: Introduction to Artificial Intelligence 1 Introduction So far we have only been concerned with a single agent Today, we introduce an adversary! 2 Outline Games Minimax search
More informationCS885 Reinforcement Learning Lecture 13c: June 13, Adversarial Search [RusNor] Sec
CS885 Reinforcement Learning Lecture 13c: June 13, 2018 Adversarial Search [RusNor] Sec. 5.1-5.4 CS885 Spring 2018 Pascal Poupart 1 Outline Minimax search Evaluation functions Alpha-beta pruning CS885
More informationINTRODUCTION 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 information2/5/17 ADVERSARIAL SEARCH. Today. Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning Real-time decision making
ADVERSARIAL SEARCH Today Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning Real-time decision making 1 Adversarial Games People like games! Games are fun, engaging, and hard-to-solve
More informationCS 387: GAME AI BOARD GAMES
CS 387: GAME AI BOARD GAMES 5/28/2015 Instructor: Santiago Ontañón santi@cs.drexel.edu Class website: https://www.cs.drexel.edu/~santi/teaching/2015/cs387/intro.html Reminders Check BBVista site for the
More informationCS 380: ARTIFICIAL INTELLIGENCE
CS 380: ARTIFICIAL INTELLIGENCE RATIONAL AGENTS 9/25/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Do you think a machine can be made that replicates
More informationCS 380: ARTIFICIAL INTELLIGENCE INTRODUCTION. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE INTRODUCTION Santiago Ontañón so367@drexel.edu CS 380 Focus: Introduction to AI: basic concepts and algorithms. Topics: What is AI? Problem Solving and Heuristic Search
More informationAdversarial Search. CS 486/686: Introduction to Artificial Intelligence
Adversarial Search CS 486/686: Introduction to Artificial Intelligence 1 AccessAbility Services Volunteer Notetaker Required Interested? Complete an online application using your WATIAM: https://york.accessiblelearning.com/uwaterloo/
More informationarxiv: v1 [cs.ai] 9 Aug 2012
Experiments with Game Tree Search in Real-Time Strategy Games Santiago Ontañón Computer Science Department Drexel University Philadelphia, PA, USA 19104 santi@cs.drexel.edu arxiv:1208.1940v1 [cs.ai] 9
More informationAIIDE /9/14. Mission Statement. By the Numbers
Artificial Intelligence and Interactive Digital Entertainment Conference 2014 AIIDE 2014 Artificial Intelligence for Interactive Media and Games Professor Charles Rich Computer Science Department rich@wpi.edu
More informationARTIFICIAL INTELLIGENCE (CS 370D)
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-5) ADVERSARIAL SEARCH ADVERSARIAL SEARCH Optimal decisions Min algorithm α-β pruning Imperfect,
More informationCS 387/680: GAME AI DECISION MAKING. 4/19/2016 Instructor: Santiago Ontañón
CS 387/680: GAME AI DECISION MAKING 4/19/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
More informationFive-In-Row with Local Evaluation and Beam Search
Five-In-Row with Local Evaluation and Beam Search Jiun-Hung Chen and Adrienne X. Wang jhchen@cs axwang@cs Abstract This report provides a brief overview of the game of five-in-row, also known as Go-Moku,
More informationArtificial Intelligence
Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Games and game trees Multi-agent systems
More informationAdversary Search. Ref: Chapter 5
Adversary Search Ref: Chapter 5 1 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans is possible. Many games can be modeled very easily, although
More informationCS 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 informationArtificial Intelligence
Artificial Intelligence CS482, CS682, MW 1 2:15, SEM 201, MS 227 Prerequisites: 302, 365 Instructor: Sushil Louis, sushil@cse.unr.edu, http://www.cse.unr.edu/~sushil Non-classical search - Path does not
More informationthe 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 informationCOMP3211 Project. Artificial Intelligence for Tron game. Group 7. Chiu Ka Wa ( ) Chun Wai Wong ( ) Ku Chun Kit ( )
COMP3211 Project Artificial Intelligence for Tron game Group 7 Chiu Ka Wa (20369737) Chun Wai Wong (20265022) Ku Chun Kit (20123470) Abstract Tron is an old and popular game based on a movie of the same
More informationCMSC 671 Project Report- Google AI Challenge: Planet Wars
1. Introduction Purpose The purpose of the project is to apply relevant AI techniques learned during the course with a view to develop an intelligent game playing bot for the game of Planet Wars. Planet
More informationOutline. 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 informationGame-playing AIs: Games and Adversarial Search I AIMA
Game-playing AIs: Games and Adversarial Search I AIMA 5.1-5.2 Games: Outline of Unit Part I: Games as Search Motivation Game-playing AI successes Game Trees Evaluation Functions Part II: Adversarial Search
More informationAdversarial Search and Game Playing. Russell and Norvig: Chapter 5
Adversarial Search and Game Playing Russell and Norvig: Chapter 5 Typical case 2-person game Players alternate moves Zero-sum: one player s loss is the other s gain Perfect information: both players have
More informationPrinciples 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 informationArtificial 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 informationCS 380: ARTIFICIAL INTELLIGENCE RATIONAL AGENTS. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE RATIONAL AGENTS Santiago Ontañón so367@drexel.edu Outline What is an Agent? Rationality Agents and Environments Agent Types (these slides are adapted from Russel & Norvig
More informationCS 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 informationCS 380: ARTIFICIAL INTELLIGENCE MONTE CARLO SEARCH. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE MONTE CARLO SEARCH Santiago Ontañón so367@drexel.edu Recall: Adversarial Search Idea: When there is only one agent in the world, we can solve problems using DFS, BFS, ID,
More informationArtificial Intelligence 1: game playing
Artificial Intelligence 1: game playing Lecturer: Tom Lenaerts Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle (IRIDIA) Université Libre de Bruxelles Outline
More informationgame tree complete all possible moves
Game Trees Game Tree A game tree is a tree the nodes of which are positions in a game and edges are moves. The complete game tree for a game is the game tree starting at the initial position and containing
More informationLecture 1: Introduction and Preliminaries
CITS4242: Game Design and Multimedia Lecture 1: Introduction and Preliminaries Teaching Staff and Help Dr Rowan Davies (Rm 2.16, opposite the labs) rowan@csse.uwa.edu.au Help: via help4242, project groups,
More informationArtificial Intelligence. Topic 5. Game playing
Artificial Intelligence Topic 5 Game playing broadening our world view dealing with incompleteness why play games? perfect decisions the Minimax algorithm dealing with resource limits evaluation functions
More informationCS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5
CS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5 Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri Topics Game playing Game trees
More informationProgramming 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 informationAdversarial Search. CMPSCI 383 September 29, 2011
Adversarial Search CMPSCI 383 September 29, 2011 1 Why are games interesting to AI? Simple to represent and reason about Must consider the moves of an adversary Time constraints Russell & Norvig say: Games,
More informationAdversarial 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 informationGames and Adversarial Search II
Games and Adversarial Search II Alpha-Beta Pruning (AIMA 5.3) Some slides adapted from Richard Lathrop, USC/ISI, CS 271 Review: The Minimax Rule Idea: Make the best move for MAX assuming that MIN always
More informationCS 387/680: GAME AI DECISION MAKING
CS 387/680: GAME AI DECISION MAKING 4/21/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 informationArtificial 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 informationPrinciples 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 informationPlaying Games. Henry Z. Lo. June 23, We consider writing AI to play games with the following properties:
Playing Games Henry Z. Lo June 23, 2014 1 Games We consider writing AI to play games with the following properties: Two players. Determinism: no chance is involved; game state based purely on decisions
More informationCS 387/680: GAME AI TACTIC AND STRATEGY
CS 387/680: GAME AI TACTIC AND STRATEGY 5/12/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 informationArtificial 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 informationCPS331 Lecture: Search in Games last revised 2/16/10
CPS331 Lecture: Search in Games last revised 2/16/10 Objectives: 1. To introduce mini-max search 2. To introduce the use of static evaluation functions 3. To introduce alpha-beta pruning Materials: 1.
More informationThese are the slides accompanying the book Artificial Intelligence and Games through the gameaibook.org website
These are the slides accompanying the book Artificial Intelligence and Games through the gameaibook.org website 1 Some reasons why a course on game AI is time-relevant and important 2 Some potential learning
More informationProcedural Content Generation
Lecture 14 Generation In Beginning, There Was Rogue 2 In Beginning, There Was Rogue Roguelike Genre Classic RPG style Procedural dungeons Permadeath 3 A Brief History of Roguelikes Precursors (1978) Beneath
More informationProcedural Content Generation
Lecture 13 Generation In Beginning, There Was Rogue 2 In Beginning, There Was Rogue Roguelike Genre Classic RPG style Procedural dungeons Permadeath 3 A Brief History of Roguelikes Precursors (1978) Beneath
More informationCSE 40171: Artificial Intelligence. Adversarial Search: Game Trees, Alpha-Beta Pruning; Imperfect Decisions
CSE 40171: Artificial Intelligence Adversarial Search: Game Trees, Alpha-Beta Pruning; Imperfect Decisions 30 4-2 4 max min -1-2 4 9??? Image credit: Dan Klein and Pieter Abbeel, UC Berkeley CS 188 31
More informationLecture 14. Questions? Friday, February 10 CS 430 Artificial Intelligence - Lecture 14 1
Lecture 14 Questions? Friday, February 10 CS 430 Artificial Intelligence - Lecture 14 1 Outline Chapter 5 - Adversarial Search Alpha-Beta Pruning Imperfect Real-Time Decisions Stochastic Games Friday,
More informationIMGD 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 informationChapter 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 informationCS 331: Artificial Intelligence Adversarial Search II. Outline
CS 331: Artificial Intelligence Adversarial Search II 1 Outline 1. Evaluation Functions 2. State-of-the-art game playing programs 3. 2 player zero-sum finite stochastic games of perfect information 2 1
More informationCSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes.
CSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes. Artificial Intelligence A branch of Computer Science. Examines how we can achieve intelligent
More informationAdversarial 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 informationIMGD 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 informationGame 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 informationGame 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 informationEvolutionary 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 informationCS188 Spring 2010 Section 3: Game Trees
CS188 Spring 2010 Section 3: Game Trees 1 Warm-Up: Column-Row You have a 3x3 matrix of values like the one below. In a somewhat boring game, player A first selects a row, and then player B selects a column.
More informationCS 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 informationMaking 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 informationCSE 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 informationGame Playing AI. Dr. Baldassano Yu s Elite Education
Game Playing AI Dr. Baldassano chrisb@princeton.edu Yu s Elite Education Last 2 weeks recap: Graphs Graphs represent pairwise relationships Directed/undirected, weighted/unweights Common algorithms: Shortest
More informationToday. Types of Game. Games and Search 1/18/2010. COMP210: Artificial Intelligence. Lecture 10. Game playing
COMP10: Artificial Intelligence Lecture 10. Game playing Trevor Bench-Capon Room 15, Ashton Building Today We will look at how search can be applied to playing games Types of Games Perfect play minimax
More informationDesigning, developing and playing KEEP ME SAFE IN EUROPE 2
Designing, developing and playing KEEP ME SAFE IN EUROPE 2 Concept What is this game about? In this game player is dropped inside her / his current situation, in a town where she can move about, go to
More informationHigh-Level Representations for Game-Tree Search in RTS Games
Artificial Intelligence in Adversarial Real-Time Games: Papers from the AIIDE Workshop High-Level Representations for Game-Tree Search in RTS Games Alberto Uriarte and Santiago Ontañón Computer Science
More informationCSE 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 informationthe 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 informationArtificial 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 informationCS 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 informationADVERSARIAL SEARCH. Chapter 5
ADVERSARIAL SEARCH Chapter 5... every game of skill is susceptible of being played by an automaton. from Charles Babbage, The Life of a Philosopher, 1832. Outline Games Perfect play minimax decisions α
More informationmywbut.com Two agent games : alpha beta pruning
Two agent games : alpha beta pruning 1 3.5 Alpha-Beta Pruning ALPHA-BETA pruning is a method that reduces the number of nodes explored in Minimax strategy. It reduces the time required for the search and
More informationThe Combinatorial Multi-Armed Bandit Problem and Its Application to Real-Time Strategy Games
Proceedings of the Ninth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment The Combinatorial Multi-Armed Bandit Problem and Its Application to Real-Time Strategy Games Santiago
More informationCPS 570: Artificial Intelligence Two-player, zero-sum, perfect-information Games
CPS 57: Artificial Intelligence Two-player, zero-sum, perfect-information Games Instructor: Vincent Conitzer Game playing Rich tradition of creating game-playing programs in AI Many similarities to search
More informationAdversarial Search (Game Playing)
Artificial Intelligence Adversarial Search (Game Playing) Chapter 5 Adapted from materials by Tim Finin, Marie desjardins, and Charles R. Dyer Outline Game playing State of the art and resources Framework
More informationCS 771 Artificial Intelligence. Adversarial Search
CS 771 Artificial Intelligence Adversarial Search Typical assumptions Two agents whose actions alternate Utility values for each agent are the opposite of the other This creates the adversarial situation
More informationCapturing and Adapting Traces for Character Control in Computer Role Playing Games
Capturing and Adapting Traces for Character Control in Computer Role Playing Games Jonathan Rubin and Ashwin Ram Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto, CA 94304 USA Jonathan.Rubin@parc.com,
More informationADVERSARIAL SEARCH. Today. Reading. Goals. AIMA Chapter Read , Skim 5.7
ADVERSARIAL SEARCH Today Reading AIMA Chapter Read 5.1-5.5, Skim 5.7 Goals Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning 1 Adversarial Games People like games! Games are
More informationAnnouncements. 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