Bridge (and Card Games) in General

Slides:



Advertisements
Similar presentations
Minibridge Cowbridge Comprehensive July 2007 Patrick Jourdain.
Advertisements

AI for Connect-4 (or other 2-player games) Minds and Machines.
CS 484 – Artificial Intelligence
Adversarial Search Chapter 5.
Adversarial Search: Game Playing Reading: Chapter next time.
MINIMAX SEARCH AND ALPHA- BETA PRUNING: PLAYER 1 VS. PLAYER 2.
Artificial Intelligence
Lecture 13 Last time: Games, minimax, alpha-beta Today: Finish off games, summary.
How computers play games with you CS161, Spring ‘03 Nathan Sturtevant.
Monte Carlo Go Has a Way to Go Haruhiro Yoshimoto (*1) Kazuki Yoshizoe (*1) Tomoyuki Kaneko (*1) Akihiro Kishimoto (*2) Kenjiro Taura (*1) (*1)University.
double AlphaBeta(state, depth, alpha, beta) begin if depth
Game Playing in the Real World Next time: Wrap-up on Game playing and Knowledge Representation Reading: IBM’s Deep Blue Chess Grandmaster Chips, Feng-hsiung.
Artificial Intelligence in Game Design Problems and Goals.
Reinforcement Learning
Artificial Intelligence in Games CA107 Topics in Computing Dr. David Sinclair School of Computer Applications
Games 1 Alpha-Beta Example [-∞, +∞] Range of possible values Do DF-search until first leaf.
Introduction to Machine Learning Kamal Aboul-Hosn Cornell University Chess, Chinese Rooms, and Learning.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Artificial Intelligence and Searching CPSC 315 – Programming Studio Spring 2013 Project 2, Lecture 1 Adapted from slides of Yoonsuck Choe.
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.
Christoph F. Eick: Thoughts on the Rook Project Challenges of Playing Bridge Well 
AIDAP Automated Expertise.
1 Chapter 6 Game Playing. 2 Chapter 6 Contents l Game Trees l Assumptions l Static evaluation functions l Searching game trees l Minimax l Bounded lookahead.
Overview of Artificial Intelligence (1) Artificial intelligence (AI) Computers with the ability to mimic or duplicate the functions of the human brain.
What is internet? The Internet is a global system of interconnected computer networks that use the standard Internet Protocol Suite (TCP/IP) to serve.
The successful features in game developing
Game Playing Why do AI researchers study game playing?
Introduction to Machine Learning
Instructor: Vincent Conitzer
Stochastic tree search and stochastic games
Machine Learning of Bridge Bidding
SNS College of Engineering Department of Computer Science and Engineering AI Planning Presented By S.Yamuna AP/CSE 5/23/2018 AI.
Game Theory Just last week:
Introduction Characteristics Advantages Limitations
A&O : ML team University Paris XI
AI Powered ADS A STEP BY STEP GUIDE TO EXTREME PERSONALIZATION
Done Done Course Overview What is AI? What are the Major Challenges?
COMP3710 Artificial Intelligence Thompson Rivers University
CS Fall 2016 (Shavlik©), Lecture 11, Week 6
CSC 515 – Applied AI 1. Origins of AI conference.
AlphaGo with Deep RL Alpha GO.
Artificial Intelligence and Society
Videos NYT Video: DeepMind's alphaGo: Match 4 Summary: see 11 min.
CSC 110 – Fluency in Information Technology Chess
Adversarial Search Chapter 5.
Topics Covered in COSC 6368 More general topics:
Artificial Intelligence
Chapter 23 Planning in the Game of Bridge
Teaching with Instructional Software
Teaching Plan Problem Solving
J. J. Divin Astrid Glende Jon McClain Lorenzo Moore
Artificial Intelligence and Searching
Chapter 23 Planning in the Game of Bridge
Get to know the rating system in the model
Instructor: Vincent Conitzer
ICT Gaming Lesson 1.
Chapter 23 Planning in the Game of Bridge
Future of Artificial Intelligence
COMP3710 Artificial Intelligence Thompson Rivers University
Instructor: Vincent Conitzer
2004: Topics Covered in COSC 6368
On Guard From the card 1 vs. 1 – play down pitch to opponent who tries to score in your goal 2 vs. 2, 3 vs. 3 or 4 vs Game 4 vs. 4 (inc. GK) Try.
Artificial Intelligence
Artificial Intelligence and Searching
Are you ready to play? 15min and homework. Remember earlier on this lesson, I mentioned you’ll have a chance to see what your general knowledge is like.
Teaching Plan Problem Solving
Artificial Intelligence and Searching
Artificial Intelligence Machine Learning
Unit II Game Playing.
Federal Business Intensive
Presentation transcript:

Bridge (and Card Games) in General https://en.wikipedia.org/wiki/Computer_bridge (kind of outdated!)

Challenges of Playing Bridge Well https://en.wikipedia.org/wiki/Contract_bridge Bridge requires a lot of real-time decision making in uncertain environments. The distribution of the opponents’ and partner’s cards is initially unknown and follows the laws of probability. However, as bids are made and cards are played these initial probabilities change  quite difficult to automate (belief networks). Consequently, intelligent play has to consider a large number of states (hand distributions) which have different probabilities: https://en.wikipedia.org/wiki/Contract_bridge_probabilities Defenders have to collaborate and employ complex signals for this purpose—but declarer is also listening… There is a huge amount of domain specific knowledge on how to bid and how to play the hand  difficult to computerize Declarer play requires planning! Determining the best plan to play a hand is very difficult; determining the best line of play with all hands visible is easy  Deep Finesse—double dummy Bridge is a solved problem: http://www.deepfinesse.com/ does the job: Example: http://www2.cs.uh.edu/~ceick/ai/DeepFinesse.pdf Players false card or do others things to mislead the declarer (and frequently also partner). Concealment (not giving (much) information about your actual hand in bidding and play) is an important element of top-level Bridge.

Status of Bridge Software Bridge programs have reached some maturity and play at a “good” but not “excellent” amateur level, but are still quite for away to play the top level or to win a contest with the best Bridge teams In Zia Mahmood's book, Bridge, My Way (1992), Zia offered a £1 million bet that no four-person team of his choosing would be beaten by a computer. A few years later the bridge program GIB, brainchild of American computer scientist Matthew Ginsberg,[3] proved capable of expert declarer plays like winkle squeezes in play tests. In 1996, Zia withdrew his bet. … Zia beat various computer programs, including GIB, in an individual round robin match.[5] Bridge Software is used by professional players and not so good players to enhance their game and companies make money selling their Bridge software. Using Deep Finesse () results are used as feedback to find the optimal line of play for defense/declarer using the min-max algorithm: depth 13 is not a problem for state of the art computer hardware. to serve as robots, filling in as the 2nd, 3rd, and 4th player in a Bridge Game.. Using hand generators for bidding training Finding out the likelihood of a particular hand patterns to enhance bidding systems Educational software is available to enhance declarer play, defense, and bidding for almost all levels. Other companies provide services to watch and play Bridge online 2016 Word Championship: http://www.worldbridge.org/repository/tourn/wroclaw.16/Microsite/Participants.asp Watch life on Bridge Base: http://www.bridgebase.com/

Concealment Example 8 7 3 (visible) K Q 9 10 5 4 A J 6 2 Card Rankings: A>K>Q>J>10>9>8>7>6>5>4>3>2 Play: The West player plays the K, dummy plays the 3, the east player plays the 4 (standard carding: low asks not to continue the suit and high asks to continue the suit); should declarer play the 6 or 2?

Larry Shi’s slide

Larry Shi’s slide Unfair Game? 50KW? 20W

Man vs. Machine—AI & Other Games In 2005, 3 top chess players lost 8-4 against 3 Chess programs, augmented by state of the art high performance computing equipment—only one game was won by a human player, the machines  won 5 games and there were 6 ties; for more details see: https://en.wikipedia.org/wiki/Human%E2%80%93computer_chess_matches ; other information about Computer Bridge: https://en.wikipedia.org/wiki/Computer_chess As far as Backgammon is concerned, AI and evolutionary computing approaches software is capable to play top level Backgammon. This year at the Angry Bird Video Game Contest at IJCAI 2016, humans beat all computer programs at all game difficulty levels 1-4: still some hope for mankind! More about this on September 29 when 3 of your class mated give a presentation about this contest!