Pitch Playing Agent Project for Into to AI Jody Ammeter.

Slides:



Advertisements
Similar presentations
Seminar on Game Playing in AI. 1/21/2014University College of Engineering2 Definition…. Game Game playing is a search problem defined by: 1. Initial state.
Advertisements

Minibridge Cowbridge Comprehensive July 2007 Patrick Jourdain.
SOCiable A Game of Life Chances ©Jon Witt Version 1.0.
500 for 2 Enjoy your favourite card game with only 2 players 500 for 2
A Whist AI Jason Fong CS261A, Spring What is Whist? Old card game, driven into obscurity by Bridge Similar to other trick taking games Bridge, Spades,
It’s All in the Cards Adding and Subtracting Integers
Naveen Garg, CSE, IIT Delhi
Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
Short Stack Strategy – How to play after the flop Strategy: No Limit.
Lesson 20: Game Trial Bids Surendra Mehta July 2007.
Durak Tournament Outline
1 Bridge for Scholars 2009 Presentation 01 2 The deck The deck has 52 cards There are four suits: Clubs , Diamonds , Hearts, Spades  The lowest card.
CS 484 – Artificial Intelligence
Lecture 12 Last time: CSPs, backtracking, forward checking Today: Game Playing.
Adversarial Search CSE 473 University of Washington.
MINIMAX SEARCH AND ALPHA- BETA PRUNING: PLAYER 1 VS. PLAYER 2.
Dealer Comm Hand Player makes Ante bet and optional Bonus bet. Five cards are dealt to each player from the shuffler. Five cards are dealt from the shuffler.
Minimax and Alpha-Beta Reduction Borrows from Spring 2006 CS 440 Lecture Slides.
Games with Chance 2012/04/25 1. Nondeterministic Games: Backgammon White moves clockwise toward 25. Black moves counterclockwise toward 0. A piece can.
Calculate the number of outcomes We can calculate the number of possible outcomes instead of making a list, by using a formula. n = total r = total number.
12 Pontoon1May Pontoon program CE : Fundamental Programming Techniques.
State Space 4 Chapter 4 Adversarial Games. Two Flavors Games of Perfect Information ◦Each player knows everything that can be known ◦Chess, Othello Games.
This time: Outline Game playing The minimax algorithm
The Game of Ombre Canto 3; lines At the Hampton Palace.
A R R A Y ! for Multiplication!!
Ankur Patankar GT ID:
VOCABULARY  Deck or pack  Suit  Hearts  Clubs  Diamonds  Spades  Dealer  Shuffle  Pick up  Rank  Draw  Set  Joker  Jack 
Jim Berglund’s Bridge Lesson 3
Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.
CISC 235: Topic 6 Game Trees.
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.
Game Playing.
 Summary  How to Play Go  Project Details  Demo  Results  Conclusions.
PUERTO RICAN DOMINO GAME Cameron, Max, and Lauren.
Two Way Tables Venn Diagrams Probability. Learning Targets 1. I can use a Venn diagram to model a chance process involving two events. 2. I can use the.
15.3 Counting Methods: Combinations ©2002 by R. Villar All Rights Reserved.
Game-playing AIs Part 1 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part I (this set of slides)  Motivation  Game Trees  Evaluation.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 6 –Adversarial Search Thursday –AIMA, Ch. 6 –More Adversarial Search The “Luke.
What is the Purpose of This Class
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.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
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.
Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.
Adversarial Games. Two Flavors  Perfect Information –everything that can be known is known –Chess, Othello  Imperfect Information –Player’s have each.
 m C r =m!/r!(m-r)!  Property: m C r = m C (m-r)  Example: ◦ If you have 10 pens, all in different colors, and you want to bring two of them to class,
Today’s Topics Playing Deterministic (no Dice, etc) Games –Mini-max –  -  pruning –ML and games? 1997: Computer Chess Player (IBM’s Deep Blue) Beat Human.
Essential Techniques To Play Better Bridge. To play better Bridge a partnership must do the following: Play a sound bridge system that each player knows.
All In To put all the rest of your money into the pot.
Machine Learning of Bridge Bidding By Dan Emmons Computer Systems Laboratory
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Adversarial Search. Game playing u Multi-agent competitive environment u The most common games are deterministic, turn- taking, two-player, zero-sum game.
Rules for Mini Bridge Lesson 5 Place board correct orientation (NSEW) Count cards (face down) Sort hand Count points Dealer to announce point count Clockwise.
Adversarial Search. Regular Tic Tac Toe Play a few games. –What is the expected outcome –What kinds of moves “guarantee” that?
Card Game Z  Agree on a dealer and a score keeper  The dealer should remove all the Jacks, Queens, Kings & Jokers from the pack and then shuffle  The.
Combinations 0.4. Combinations: a selection of r objects from a group on n objects where the order is not important.
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.
Texas Holdem A Poker Variant vs. Flop TurnRiver. How to Play Everyone is dealt 2 cards face down (Hole Cards) 5 Community Cards Best 5-Card Hand Wins.
CIS 350 – I Game Programming Instructor: Rolf Lakaemper.
@NAMEOFEVENTORBRIDGECLUB
Pre-Algebra Q3W8: Square and Cube Roots
Adversarial Search.
Game Playing.
CSC 110 – Fluency in Information Technology Chess
Chapter 23 Planning in the Game of Bridge
J. J. Divin Astrid Glende Jon McClain Lorenzo Moore
Chapter 23 Planning in the Game of Bridge
3rd/4th grade Family Math Night Games
Chapter 23 Planning in the Game of Bridge
HOW TO PLAY POKER.
Presentation transcript:

Pitch Playing Agent Project for Into to AI Jody Ammeter

The Game of Pitch This project is based on Oklahoma, 13-pt, 4-player Pitch. This project is based on Oklahoma, 13-pt, 4-player Pitch. Players sitting across from each other are partners. Players sitting across from each other are partners. Each player is first dealt 9 cards. Each player is first dealt 9 cards. Then a round of bidding follows. Legal bids 5 – 13. Then a round of bidding follows. Legal bids 5 – 13. Highest bidder chooses suit to be played. Highest bidder chooses suit to be played. Everyone discards all cards of other suits. Everyone discards all cards of other suits. Each player is then dealt enough cards to give them 6 cards in their hand. Each player is then dealt enough cards to give them 6 cards in their hand. The hand is then played. The highest bidder leads on the first trick. Whoever takes the trick leads on the following trick. The hand is then played. The highest bidder leads on the first trick. Whoever takes the trick leads on the following trick. Only cards of the chosen suit are played Only cards of the chosen suit are played Points are totaled at the end of each hand. Points are totaled at the end of each hand. The game ends when a team scores 52 points. The game ends when a team scores 52 points.

Card Rank and Scoring Cards rank from high to low as follows: Cards rank from high to low as follows: Ace, King, Queen, Jack, Off-Jack, High Joker, Low Joker, 10, 9, 8, 7, 6, 5, 4, 3, Off-3, 2 Ace, King, Queen, Jack, Off-Jack, High Joker, Low Joker, 10, 9, 8, 7, 6, 5, 4, 3, Off-3, 2 Points are awarded as follows: Points are awarded as follows: 1 pt each is awarded to the team who takes the tricks containing the following: 1 pt each is awarded to the team who takes the tricks containing the following: Ace, Jack, Off-Jack, High Joker, Low Joker, 10 Ace, Jack, Off-Jack, High Joker, Low Joker, 10 3 pts each is awarded to the team who takes the tricks containing the following: 3 pts each is awarded to the team who takes the tricks containing the following: 3, Off-3 3, Off-3 1 pt is awarded to the team who plays the 2 1 pt is awarded to the team who plays the 2

Agents Bidding Method The agent forms a bid using a simple evaluation function. A bid is calculated for each suit. The agent forms a bid using a simple evaluation function. A bid is calculated for each suit. Face cards, Jokers, and the deuce all have assigned point values. Face cards, Jokers, and the deuce all have assigned point values. Points are also added for having multiple cards of the same suit. Points are also added for having multiple cards of the same suit. The total of these points is the agents bid for that suit. The total of these points is the agents bid for that suit. The highest of these bids is then made in the corresponding suit. The highest of these bids is then made in the corresponding suit.

Agents Method of Play The agent is given perfect information. The agent is given perfect information. Sees other players hands, and knows what cards have already been played on a given trick. Sees other players hands, and knows what cards have already been played on a given trick. The agent then builds a search tree for the trick and uses minimax to maximize points received on that particular trick. The agent then builds a search tree for the trick and uses minimax to maximize points received on that particular trick. Drawback: Does not plan ahead, and therefore does not always play optimally. Drawback: Does not plan ahead, and therefore does not always play optimally.

Building the Search Tree The agents hand becomes the first level of the search tree. The agents hand becomes the first level of the search tree. The next players hand, Opponent 1, becomes the children of the nodes representing the agents hand. The next players hand, Opponent 1, becomes the children of the nodes representing the agents hand. The next players hand, Agents Partner, becomes the children of each of the nodes representing Opponent 1’s hand. The next players hand, Agents Partner, becomes the children of each of the nodes representing Opponent 1’s hand. The next players hand, Opponent 2, becomes the children of each of the nodes representing the agent’s partner’s hand. The next players hand, Opponent 2, becomes the children of each of the nodes representing the agent’s partner’s hand. If a player has already played on the trick, his hand just consists of the card that was played on this trick. If a player has already played on the trick, his hand just consists of the card that was played on this trick.

Example Search Tree Agent’s Leading, Possible plays: Ace, High Joker Agent’s Leading, Possible plays: Ace, High Joker Opponent 1: Jack, deuce Opponent 1: Jack, deuce Partner: 8, 3 Partner: 8, 3 Opponent 2: Low Joker Opponent 2: Low Joker A J H J LLLLL 38 LLL Max Min Max

Questions?