Intelligent Game Playing

Jul 14, 2012

770 likes | 909 Vues

Intelligent Game Playing. Instructor : B. John Oommen Chancellor’s Professor Fellow: IEEE; Fellow: IAPR School of Computer Science, Carleton University, Canada. The primary source of these notes are the slides of Professor Hwee Tou Ng

Share Presentation

Embed Code

Link

marc

Télécharger la présentation

Intelligent Game Playing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

Game Playing

Game Playing Mini-Max search Alpha-Beta pruning General concerns on games Why study board games ? Abstract and pure form of competition that seems to require intelligence Easy to represent the states and actions Very little world knowledge required !

764 views • 36 slides

Game Playing

Game Playing. Chapter 5 some slides from UC-Irvine, CS Dept. Game Playing and AI. Game playing (was?) thought to be a good problem for AI research: game playing is non-trivial players need “human-like” intelligence games can be very complex (e.g., chess, go)

1.33k views • 81 slides

Game Playing

Game Playing. Chapter 5. Game playing. Search applied to a problem against an adversary some actions are not under the control of the problem-solver there is an opponent (hostile agent) Since it is a search problem, we must specify states & operations/actions

800 views • 22 slides

Game Playing

Game Playing. Kevin Chernishenko Nick Quach Mervyn Yong Terry Yan. All information and figures provided by Artificial Intelligence: A Modern Approach (Stuart Russell and Peter Norvig, 1995) unless stated otherwise. Introduction.

721 views • 49 slides

Game Playing

Game Playing. Perfect decisions Heuristically based decisions Pruning search trees Games involving chance. What is a game?. Search problem with Initial state: board position and whose turn it is Successor function: What are possible moves from here? Terminal test: Is the game over?

670 views • 48 slides

Game-Playing

Game-Playing. Read Chapter 6 Adversarial Search. State-Space Model Modified. States the same Operators depend on whose turn Goal: As before: win or win amount Search: somewhat different. Game Types. Two-person games vs multi-person chess vs monopoly vs poker

285 views • 17 slides

Game Playing

Game Playing. Why do AI researchers study game playing? It’s a good reasoning problem, formal and nontrivial. Direct comparison with humans and other computer programs is easy. What Kinds of Games?. Mainly games of strategy with the following characteristics:

691 views • 42 slides

Game Playing

Game Playing . Search the action space of 2 players Russell & Norvig Chapter 6 Bratko Chapter 22. Game Playing. ‘Games contribute to AI like Formula 1 racing contributes to automobile design.’

475 views • 23 slides

GAME PLAYING

GAME PLAYING. Every game of skill is susceptible of being played by an automaton. - Charles Babbage (1791-1871), English mathematician, philosopher, inventor and mechanical engineer OVERVIEW

423 views • 23 slides

Game Playing

Game Playing. Introduction. One of the earliest areas in artificial intelligence is game playing. Two-person zero-sum game. Games for which the state space is small enough – generate the entire space. Games for which the entire space cannot be generated. The Game NIM. 7. 6-1. 5-2. 4-3.

447 views • 10 slides

Game playing

Game playing. Types of games Deterministic vs. chance Perfect vs. imperfect information Active area of research Why? Clear criteria for success Interesting, hard problems Fun Typical game 2-player, zero sum game Players alternate moves Perfect information, no chance Examples?.

296 views • 12 slides

Game Playing

Game Playing. CIS 479/579 Bruce R. Maxim UM-Dearborn. Generate and Test. Search can be viewed generate and test procedures Testing for a complete path is performed after varying amount of work has been done by the generator

561 views • 46 slides

Game Playing

Game Playing. Introduction to Artificial Intelligence CS440/ECE448 Lecture 7 FIRST HOMEWORK DUE TODAY. Last lecture. Constraint satisfaction problems Line-drawing interpretation This lecture Games Minimax  pruning Reading Chapter 6. Line Drawing Interpretation.

443 views • 27 slides

Game Playing

Game Playing. Evolve a strategy for two-person zero-sum games. Help the user to determine the next move. Constructing a game tree Each node represents a state in the game Each arc represents a legal move The minimax algorithm Alpha-beta pruning. Example: Minimax Algorithm. Game Tree:

359 views • 15 slides

Game Playing

Game Playing. Human Game Playing Intellectual Activity Skill Comparison. Computer Game Playing Testbed for AI Limitations. General Game Playing. General Game Players are systems able to play arbitrary games effectively based solely on formal descriptions supplied at “runtime”.

1.14k views • 78 slides

Game Playing

Game Playing. Pruning. Pruning is used to narrow the search down e.g. if we find a branch where we will win no matter what, we don’t need to search that part of the tree anymore And if we find a guaranteed losing line we don’t need to search that part of tree any more. MiniMax.

365 views • 23 slides

Game Playing

Game Playing. Mini-Max search Alpha-Beta pruning General concerns on games. Why study board games ?. Abstract and pure form of competition that seems to require intelligence Easy to represent the states and actions Very little world knowledge required !

496 views • 36 slides

Game Playing

Game Playing. Perfect decisions Heuristically based decisions Pruning search trees Games involving chance. Differences from problem solving. Opponent makes own choices! Each choice that game playing agent makes depends on what response opponent makes

506 views • 39 slides

Intelligent Game Playing

Intelligent Game Playing. Instructor : B. John Oommen Chancellor’s Professor Life Fellow : IEEE; Fellow: IAPR School of Computer Science, Carleton University, Canada. The primary source of these notes are the slides of Professor Hwee Tou Ng

790 views • 77 slides

Game Playing

CS 63. Game Playing. Chapter 6. Adapted from materials by Tim Finin, Marie desJardins, and Charles R. Dyer. Outline. Game playing State of the art and resources Framework Game trees Minimax Alpha-beta pruning Adding randomness. State of the art. How good are computer game players?

286 views • 23 slides

Game Playing

Game Playing. ECE457 Applied Artificial Intelligence Spring 2008 Lecture #5. Outline. Types of games Playing a perfect game Minimax search Alpha-beta pruning Playing an imperfect game Real-time Imperfect information Chance Russell & Norvig, chapter 6 Project #2. Game Problems.

525 views • 42 slides

Game Playing

Game Playing. Generate and Test. Search can be viewed as a generate and test procedures Testing for a complete path is performed after varying amount of work has been done by the generator At one extreme the generator generates a complete path which is evaluated

513 views • 46 slides

More Related