Introduction to Game Theory Kamal Aboul-Hosn Cornell University Computers Playing Games.

Slides:

Advertisements

Similar presentations

Alpha-Beta Search. 2 Two-player games The object of a search is to find a path from the starting position to a goal position In a puzzle-type problem,

Advertisements

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.

A measurement of fairness game 1: A box contains 1red marble and 3 black marbles. Blindfolded, you select one marble. If you select the red marble, you.

Game Theory, Part 1 Game theory applies to more than just games. Corporations use it to influence business decisions, and militaries use it to guide their.

February 7, 2006AI: Chapter 6: Adversarial Search1 Artificial Intelligence Chapter 6: Adversarial Search Michael Scherger Department of Computer Science.

Tic Tac Toe Game Design Using OOP

Tic Tac Toe Game playing strategies

Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.

Integer Tic Tac Toe Let’s Begin Rules: 1.Erase all x’s and o’s from the previous game before you begin. 2.Decide which player will be x’s and which will.

Adversarial Search Chapter 6.

Artificial Intelligence in Game Design

Lesson 2-2 Example Solve. Tic Tac Toe Katrina and her friend played Tic Tac Toe. The outcomes of the games are shown in the line plot. Did Katrina.

1 search CS 331/531 Dr M M Awais A* Examples:. 2 search CS 331/531 Dr M M Awais 8-Puzzle f(N) = g(N) + h(N)

An eye for eye only ends up making the whole world blind. -Mohandas Karamchand Gandhi, born October 2 nd, Lecture of October 2 nd, 2001.

Game Tree Search based on Russ Greiner and Jean-Claude Latombe’s notes.

Adversarial Search and Game Playing Examples. Game Tree MAX’s play  MIN’s play  Terminal state (win for MAX)  Here, symmetries have been used to reduce.

UNR, MATH/STAT 352, Spring Head Tail Tossing a symmetric coin You are paying $1 How much should you get to make the game fair?

Alpha-Beta Search. 2 Two-player games The object of a search is to find a path from the starting position to a goal position In a puzzle-type problem,

Purpose: Can I make the other person win at Tic Tac Toe? Research: How do you usually play Tic Tac Toe?

Warm up: Solve each system (any method). W-up 11/4 1) Cars are being produced by two factories, factory 1 produces twice as many cars (better management)

PSU CS 370 – Introduction to Artificial Intelligence Game MinMax Alpha-Beta.

Game Playing. Introduction Why is game playing so interesting from an AI point of view? –Game Playing is harder then common searching The search space.

October 3, 2012Introduction to Artificial Intelligence Lecture 9: Two-Player Games 1 Iterative Deepening A* Algorithm A* has memory demands that increase.

Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.

Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.

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.

Game Theory, Part 2 Consider again the game that Sol and Tina were playing, but with a different payoff matrix: H T Tina H T Sol.

Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.

Fair and Unfair Games Laura Smiley. What makes a game… FairUnfair.

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.

ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.

Introduction to State Space Search

Adversarial Search. Regular Tic Tac Toe Play a few games. –What is the expected outcome –What kinds of moves “guarantee” that?

9.2 Mixed Strategy Games In this section, we look at non-strictly determined games. For these type of games the payoff matrix has no saddle points.

Artificial Intelligence in Game Design Board Games and the MinMax Algorithm.

Chapter 5 Adversarial Search. 5.1 Games Why Study Game Playing? Games allow us to experiment with easier versions of real-world situations Hostile agents.

1 Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game.

Tic – Tac – Toe ! Choose a square by clicking on “box #” Choose a square by clicking on “box #” If the person choosing the square gets the problem correct,

Adversarial Search and Game-Playing

Expected values of games

Iterative Deepening A*

Tic-Tac-Throw! How to Play: X or O

Next Level Tic-Tac-Toe

PENGANTAR INTELIJENSIA BUATAN (64A614)

O X X O O X X O X O X O O X O X O X Tic Tac Toe Graphical

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Adversarial Search.

How many different ways can 8 people be seated in a row of 8 seats

DIVIDING FRACTIONS TIC-TAC-TOE

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Alpha-Beta Search.

NIM - a two person game n objects are in one pile

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Alpha-Beta Search.

Introduction to Artificial Intelligence Lecture 9: Two-Player Games I

Alpha-Beta Search.

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Alpha-Beta Search.

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Adversarial Search and Game Playing Examples

Fun… Tree Diagrams… Probability.

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Alpha-Beta Search.

Tic – Tac – Toe ! Choose a square by clicking on “box #”

Tic-Tac-Toe Game Engine

Adversarial Search Game Theory.

Presentation transcript:

Introduction to Game Theory Kamal Aboul-Hosn Cornell University Computers Playing Games

A sequence of moves from a starting position made by player(s) until a win, loss, or draw Can represent every game as a tree Label each node with a player Arrows indicate possible moves Payoffs at the leaf nodes Game Trees

Choose “Heads” or “Tails” Flip a coin If you chose correctly, you win A Simple Game

Guarantee the “least-worst” payoff Start from the last nodes in the tree Your nodes: Choose the best Other players’ nodes: Chose the worst Continue back to the beginning of the tree Strategy from Game Trees

Finding a Strategy

How do people still win games that are fair? Game trees can be huge Impossible for a person to remember all possible moves People play on “intuition” Winning Fair Games?

Very simple game 31,896 possible games! Tic Tac Toe

Mega Tic Tac Toe: egaTTT.htm Select “Tic-Tac-Toe (3x3, Win=3)” from “Preset Game” Uncheck “Force Computer...Randomly” Experiment with Search Depth A Game Experiment