Games Computers Play. Bart Massey Computer Science Dept. Portland State University
|
|
|
- Josephine Evans
- 7 years ago
- Views:
Transcription
1 Games Computers Play Bart Massey Computer Science Dept. Portland State University
2 35 Years Ago... Computer world chess champion: "soon" Widespread agreement on this! Other games sure to follow... Big lessons about human reasoning!
3 What Happened? Human players were underestimated Benefits of better computers overestimated Clever approach to computer game play!
4 Overview How computers play games Survey of computer game play Lessons from computer game play
5 How To Play Tic Tac Toe Game characteristics: ``zero sum'' two player alternating terminating no ``luck'' no ``hidden info.''
6 How Humans Play Tic Tac Toe Identify and block immediate wins Set up two way traps Try something new Soon learn how to force a draw
7 How Computers Play Tic Tac Toe Game tree search Minimize opponent maximum Must play every possible game out!
8 How Computers Play Chess Cannot try every possible game Play for "a while", then evaluate In practice, deeper is better Opening book, endgame code
9 How Well Does Search Work? Easy to program Better for simple games Better for faster computers Not good enough? Tough...
10 Computers Play These Perfectly "Solved" games Tic Tac Toe 3D 4x4 Tic Tac Toe (Qubic), Gomoku, Connect Four Mastermind awari Features Small search regular structure
11 Checkers Chinook (Jonathan Schaeffer) 1989 world human-machine champion, then Nemesis (2002) Powerful parallel computer (very deep search) Retrograde endgame "Must read" book: One J ump Ahead (Springer Verlag) Checkers solved!! Schaeffer April ; it's a draw
12 Chess Deep Blue (IBM team) beats Kasparov, February 1997 ( , experts dispute significance) Deep Fritz draws Kramnik, Oct (4-4); Deep Junior draws Kasparov, Feb. 2003) Kramnik accused of using Fritz 9 in match against Topalov, September 2006
13 Scrabble Maven (Brian Sheppard) was roughly par with top human players (e.g. GM Adam Logan), though now stronger What does this mean? Top human players know most words More strategy "Luck": randomization (draw) tough for computers
14 Backgammon TD Gammon (Gerald Tesauro, 1990s) roughly par with top human players (e.g. Malcolm Davis) Performance near optimal Program learns by playing (neural nets) Handles "luck" (probability) surprisingly well
15 Go Current top programs are worse than 5 kyu? 1997: J anice Kim beats Handtalk in demo with 25 stone handicap! Go is hard because large branching hard posn eval
16 A Giant Leap in Go 7 August 2008 MoGo running on an 800-node Belgian supercomputer cluster defeats US Champion Myungwan Kim...at PSU! 9-stone handicap :-) Maybe 8-stone? Stochastic search breakthrough How will it scale?
17 Bridge Zia Mahmood : 1M bet GIB (Ginsberg) was world computer champion = good club player Bidding so so Play usually strong 2006 programs not way better
18 How GIB Plays Bridge Bidding: rules from Meadowlark + Borel Simulation (guess rest of auction) Play: Monte Carlo analysis was double dummy, but not now Deal, make sure deal consistent with bidding, known cards Run minimax repeat many times
19 Poker Schaeffer et al Polaris vs Phil Laak / Ali Eslami July 2007 Humans win heads-up duplicate match Probability, hidden information, multiplayer, expectimax: truly challenging Big payoffs from online play (fading?) Currently quite interesting
20 The Near Future Games of chance (poker, CCGs) Hidden information (poker, Stratego) Learning
21 Longer Term Multiplayer Better strategic play planning pattern recognition Not just games any more! military, economic tool general problem solving techniques
22 AI Lessons From Computer Games AI does not scale well with computer size/speed Intelligence and game playing ability not necessarily related "Pride goes before destruction, and a haughty spirit before a fall. " Proverbs 16:18
23 General Lessons From Computer Games Old view: John Henry, Frankenstein, R.U.R., HAL, Terminator New view: Adding machine Complementary skills Solve specific problems
24 Things To Learn Search basics Adversary search basics Hidden information and probability Games-specific tricks and SE Theory and formal analysis
25 CS 442/542 Combinatorial Games 10-week version of brief segment on how to build an adversary search engine Optional funsies tournament Bring algorithm, data structure clues out-of-class time solid programming skills Spring 2009
Game playing. Chapter 6. Chapter 6 1
Game playing Chapter 6 Chapter 6 1 Outline Games Perfect play minimax decisions α β pruning Resource limits and approximate evaluation Games of chance Games of imperfect information Chapter 6 2 Games vs.
10. Machine Learning in Games
Machine Learning and Data Mining 10. Machine Learning in Games Luc De Raedt Thanks to Johannes Fuernkranz for his slides Contents Game playing What can machine learning do? What is (still) hard? Various
Chess Algorithms Theory and Practice. Rune Djurhuus Chess Grandmaster runed@ifi.uio.no / runedj@microsoft.com October 3, 2012
Chess Algorithms Theory and Practice Rune Djurhuus Chess Grandmaster runed@ifi.uio.no / runedj@microsoft.com October 3, 2012 1 Content Complexity of a chess game History of computer chess Search trees
Game Playing in the Real World. Next time: Knowledge Representation Reading: Chapter 7.1-7.3
Game Playing in the Real World Next time: Knowledge Representation Reading: Chapter 7.1-7.3 1 What matters? Speed? Knowledge? Intelligence? (And what counts as intelligence?) Human vs. machine characteristics
Chess Algorithms Theory and Practice. Rune Djurhuus Chess Grandmaster runed@ifi.uio.no / runedj@microsoft.com September 23, 2014
Chess Algorithms Theory and Practice Rune Djurhuus Chess Grandmaster runed@ifi.uio.no / runedj@microsoft.com September 23, 2014 1 Content Complexity of a chess game Solving chess, is it a myth? History
CSE 517A MACHINE LEARNING INTRODUCTION
CSE 517A MACHINE LEARNING INTRODUCTION Spring 2016 Marion Neumann Contents in these slides may be subject to copyright. Some materials are adopted from Killian Weinberger. Thanks, Killian! Machine Learning
TD-Gammon, A Self-Teaching Backgammon Program, Achieves Master-Level Play
TD-Gammon, A Self-Teaching Backgammon Program, Achieves Master-Level Play Gerald Tesauro IBM Thomas J. Watson Research Center P. O. Box 704 Yorktown Heights, NY 10598 (tesauro@watson.ibm.com) Abstract.
Monte-Carlo Methods. Timo Nolle
Monte-Carlo Methods Timo Nolle Outline Minimax Expected Outcome Monte-Carlo Monte-Carlo Simulation Monte-Carlo Tree Search UCT AMAF RAVE MC-RAVE UCT-RAVE Playing Games Go, Bridge, Scrabble Problems with
University of Alberta. Library Release Form
University of Alberta Library Release Form Name of Author: Michael Bradley Johanson Title of Thesis: Robust Strategies and Counter-Strategies: Building a Champion Level Computer Poker Player Degree: Master
Laboratory work in AI: First steps in Poker Playing Agents and Opponent Modeling
Laboratory work in AI: First steps in Poker Playing Agents and Opponent Modeling Avram Golbert 01574669 agolbert@gmail.com Abstract: While Artificial Intelligence research has shown great success in deterministic
Using Probabilistic Knowledge and Simulation to Play Poker
Using Probabilistic Knowledge and Simulation to Play Poker Darse Billings, Lourdes Peña, Jonathan Schaeffer, Duane Szafron Department of Computing Science, University of Alberta Edmonton, Alberta Canada
Monte Carlo Tree Search and Opponent Modeling through Player Clustering in no-limit Texas Hold em Poker
Monte Carlo Tree Search and Opponent Modeling through Player Clustering in no-limit Texas Hold em Poker A.A.J. van der Kleij August 2010 Master thesis Artificial Intelligence University of Groningen, The
Playing around with Risks
Playing around with Risks Jurgen Cleuren April 19th 2012 2011 CTG, Inc. Introduction Projects are done in a probabilistic environment Incomplete information Parameters change over time What is true in
The UCT Algorithm Applied to Games with Imperfect Information
Otto-von-Guericke-Universität Magdeburg Fakultät für Informatik Institut für Simulation und Graphik Diploma Thesis The UCT Algorithm Applied to Games with Imperfect Information Author: Jan Schäfer July
COMP 590: Artificial Intelligence
COMP 590: Artificial Intelligence Today Course overview What is AI? Examples of AI today Who is this course for? An introductory survey of AI techniques for students who have not previously had an exposure
Understanding Proactive vs. Reactive Methods for Fighting Spam. June 2003
Understanding Proactive vs. Reactive Methods for Fighting Spam June 2003 Introduction Intent-Based Filtering represents a true technological breakthrough in the proper identification of unwanted junk email,
Artificial Intelligence Beating Human Opponents in Poker
Artificial Intelligence Beating Human Opponents in Poker Stephen Bozak University of Rochester Independent Research Project May 8, 26 Abstract In the popular Poker game, Texas Hold Em, there are never
Rafael Witten Yuze Huang Haithem Turki. Playing Strong Poker. 1. Why Poker?
Rafael Witten Yuze Huang Haithem Turki Playing Strong Poker 1. Why Poker? Chess, checkers and Othello have been conquered by machine learning - chess computers are vastly superior to humans and checkers
The 7 th Computer Olympiad
The 7 th Computer Olympiad Mark Winands IKAT, Universiteit Maastricht From July 5 to 11 2002 the Institute for Knowledge and Agent Technology (IKAT) organised the 7 th Computer Olympiad at the Universiteit
Computer Bridge A Big Win for AI Planning. Stephen J. J. Smith, Dana Nau, and Tom Throop
Computer Bridge A Big Win for AI Planning Stephen J. J. Smith, Dana Nau, and Tom Throop A computer program that uses AI planning techniques is now the world champion computer program in the game of Contract
Watson. An analytical computing system that specializes in natural human language and provides specific answers to complex questions at rapid speeds
Watson An analytical computing system that specializes in natural human language and provides specific answers to complex questions at rapid speeds I.B.M. OHJ-2556 Artificial Intelligence Guest lecturing
Minimax Strategies. Minimax Strategies. Zero Sum Games. Why Zero Sum Games? An Example. An Example
Everyone who has studied a game like poker knows the importance of mixing strategies With a bad hand, you often fold But you must bluff sometimes Lectures in Microeconomics-Charles W Upton Zero Sum Games
Monte-Carlo Tree Search (MCTS) for Computer Go
Monte-Carlo Tree Search (MCTS) for Computer Go Bruno Bouzy bruno.bouzy@parisdescartes.fr Université Paris Descartes Séminaire BigMC 5 mai 2011 Outline The game of Go: a 9x9 game The «old» approach (*-2002)
CSC384 Intro to Artificial Intelligence
CSC384 Intro to Artificial Intelligence What is Artificial Intelligence? What is Intelligence? Are these Intelligent? CSC384, University of Toronto 3 What is Intelligence? Webster says: The capacity to
University of Alberta
University of Alberta ALGORITHMS AND ASSESSMENT IN COMPUTER POKER by Darse Billings A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the
CS440/ECE448: Artificial Intelligence. Course website: http://slazebni.cs.illinois.edu/fall15/
CS440/ECE448: Artificial Intelligence Course website: http://slazebni.cs.illinois.edu/fall15/ Last time: What is AI? Definitions from Chapter 1 of the textbook: 1. Thinking humanly 2. Acting humanly 3.
Book One. Beginning Bridge. Supplementary quizzes and play hands. 2011 edition
Book One Beginning Bridge Supplementary quizzes and play hands 2011 edition Chapter One : Getting started with bridge TR1 How many points in each hand? TR2 Hands 1-8 for the first lesson TR3 MiniBridge
Lab 11. Simulations. The Concept
Lab 11 Simulations In this lab you ll learn how to create simulations to provide approximate answers to probability questions. We ll make use of a particular kind of structure, called a box model, that
Roulette Wheel Selection Game Player
Macalester College DigitalCommons@Macalester College Honors Projects Mathematics, Statistics, and Computer Science 5-1-2013 Roulette Wheel Selection Game Player Scott Tong Macalester College, stong101@gmail.com
Bridge Software for home computers
E B U T A Bridge Software for home computers 1 EBUTA This is an attempt to summarise some of the many computer software products and services available to bridge players. Since there are many such products,
AI Techniques Used in Computer Go
AI Techniques Used in Computer Go Jay Burmeister and Janet Wiles Schools of Information Technology and Psychology The University of Queensland, Australia jay@it.uq.edu.au http://www.psy.uq.edu.au/~jay/
Keywords-Chess gameregistration, Profile management, Rational rose, Activities management.
Volume 5, Issue 2, February 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Online Chess
Adaptive play in Texas Hold em Poker
Adaptive play in Texas Hold em Poker Raphaël Maîtrepierre and Jérémie Mary and Rémi Munos 1 Abstract. We present a Texas Hold em poker player for limit headsup games. Our bot is designed to adapt automatically
How to Win Texas Hold em Poker
How to Win Texas Hold em Poker Richard Mealing Machine Learning and Optimisation Group School of Computer Science University of Manchester / 44 How to Play Texas Hold em Poker Deal private cards per player
Checkers Is Solved. *To whom correspondence should be addressed. E-mail: jonathan@cs.ualberta.ca
Checkers Is Solved Jonathan Schaeffer,* Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen Department of Computing Science, University of Alberta, Edmonton,
Ary, a general game playing program
Ary, a general game playing program Jean Méhat, Tristan Cazenave Abstract We present our program Ary that won the 2009 and 2010 General Game Playing competition. In General Game Playing (GGP), players
CHAPTER 15: IS ARTIFICIAL INTELLIGENCE REAL?
CHAPTER 15: IS ARTIFICIAL INTELLIGENCE REAL? Multiple Choice: 1. During Word World II, used Colossus, an electronic digital computer to crack German military codes. A. Alan Kay B. Grace Murray Hopper C.
What is Artificial Intelligence?
CSE 3401: Intro to Artificial Intelligence & Logic Programming Introduction Required Readings: Russell & Norvig Chapters 1 & 2. Lecture slides adapted from those of Fahiem Bacchus. 1 What is AI? What is
Management Decision Making. Hadi Hosseini CS 330 David R. Cheriton School of Computer Science University of Waterloo July 14, 2011
Management Decision Making Hadi Hosseini CS 330 David R. Cheriton School of Computer Science University of Waterloo July 14, 2011 Management decision making Decision making Spreadsheet exercise Data visualization,
Intent Based Filtering: A Proactive Approach Towards Fighting Spam
Intent Based Filtering: A Proactive Approach Towards Fighting Spam By Priyanka Agrawal Abstract-The cyber security landscape has changed considerably over the past few years. Since 2003, while traditional
Machine Learning. 01 - Introduction
Machine Learning 01 - Introduction Machine learning course One lecture (Wednesday, 9:30, 346) and one exercise (Monday, 17:15, 203). Oral exam, 20 minutes, 5 credit points. Some basic mathematical knowledge
How To Play Go Lesson 1: Introduction To Go
How To Play Go Lesson 1: Introduction To Go 1.1 About The Game Of Go Go is an ancient game originated from China, with a definite history of over 3000 years, although there are historians who say that
Video Poker in South Carolina: A Mathematical Study
Video Poker in South Carolina: A Mathematical Study by Joel V. Brawley and Todd D. Mateer Since its debut in South Carolina in 1986, video poker has become a game of great popularity as well as a game
Neural Networks and Back Propagation Algorithm
Neural Networks and Back Propagation Algorithm Mirza Cilimkovic Institute of Technology Blanchardstown Blanchardstown Road North Dublin 15 Ireland mirzac@gmail.com Abstract Neural Networks (NN) are important
Tartanian5: A Heads-Up No-Limit Texas Hold em Poker-Playing Program
Tartanian5: A Heads-Up No-Limit Texas Hold em Poker-Playing Program Sam Ganzfried and Tuomas Sandholm Computer Science Department Carnegie Mellon University {sganzfri, sandholm}@cs.cmu.edu Abstract We
20-30 minutes, can be used within a longer activity
Locked-in 1 Age group successfully used with: Abilities assumed: Time: Size of group: 11 adult None 20-30 minutes, can be used within a longer activity anything from 2 to hundreds Focus What is an algorithm?
ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
Enhancing Artificial Intelligence in Games by Learning the Opponent s Playing Style
Enhancing Artificial Intelligence in Games by Learning the Opponent s Playing Style Fabio Aiolli and Claudio Enrico Palazzi Abstract As virtual environments are becoming graphically nearly realistic, the
Is it possible to beat the lottery system?
Is it possible to beat the lottery system? Michael Lydeamore The University of Adelaide Postgraduate Seminar, 2014 The story One day, while sitting at home (working hard)... The story Michael Lydeamore
Hyper-connectivity and Artificial Intelligence
Hyper-connectivity and Artificial Intelligence How hyper-connectivity changes AI through contextual computing Chuan (Coby) M 04/03/15 Description of Major Sections Background Artificial intelligence (AI)
CSCI 101 - Historical Development. May 29, 2015
CSCI 101 - Historical Development May 29, 2015 Historical Development 1. IBM 2. Commodore 3. Unix and Linux 4. Raspberry pi IBM IBM or International Business Machine Corporation began in the late 1800's,
FIRST EXPERIMENTAL RESULTS OF PROBCUT APPLIED TO CHESS
FIRST EXPERIMENTAL RESULTS OF PROBCUT APPLIED TO CHESS A.X. Jiang Department of Computer Science, University of British Columbia, Vancouver, Canada albertjiang@yahoo.com M. Buro Department of Computing
A Simulation System to Support Computer Poker Research
A Simulation System to Support Computer Poker Research Luís Filipe Teófilo 1, Rosaldo Rossetti 1, Luís Paulo Reis 2, Henrique Lopes Cardoso 1 LIACC Artificial Intelligence and Computer Science Lab., University
Gamesman: A Graphical Game Analysis System
Gamesman: A Graphical Game Analysis System Dan Garcia Abstract We present Gamesman, a graphical system for implementing, learning, analyzing and playing small finite two-person
Factoring General Games using Propositional Automata
Factoring General Games using Propositional Automata Evan Cox, Eric Schkufza, Ryan Madsen and Michael R. Genesereth Stanford University, CA, USA Abstract In this paper we propose the design of a more robust
10 FREE BASKETBALL DRILLS
BASKETBALL DRILLS AND PRACTICE PLANS 1 10 FREE BASKETBALL DRILLS by Coach Patrick Anderson BASKETBALL DRILLS AND PRACTICE PLANS 2 CONTENTS 1.1 Rapid Swing Pass... 3 1.2 Box Out React Drill... 3 1.3 Bump...
One pile, two pile, three piles
CHAPTER 4 One pile, two pile, three piles 1. One pile Rules: One pile is a two-player game. Place a small handful of stones in the middle. At every turn, the player decided whether to take one, two, or
Example Hand. Suits Suits are ranked in the following order. Suits Spade (highest rank)
Chinese Poker or 13 Card Poker There are 3 or 4 players (3 in Double Combo variation, 4 in all other variations). Each player is dealt 13 cards. The object is to arrange them into 3 groups: one consisting
BBC LEARNING ENGLISH 6 Minute English Do you fear Artificial Intelligence?
BBC LEARNING ENGLISH 6 Minute English Do you fear Artificial Intelligence? NB: This is not a word-for-word transcript Hello, I'm. Welcome to 6 Minute English and with me in the studio is. Hello,. Hello.
KNOWLEDGE-BASED MONTE-CARLO TREE SEARCH IN HAVANNAH. J.A. Stankiewicz. Master Thesis DKE 11-05
KNOWLEDGE-BASED MONTE-CARLO TREE SEARCH IN HAVANNAH J.A. Stankiewicz Master Thesis DKE 11-05 Thesis submitted in partial fulfilment of the requirements for the degree of Master of Science of Artificial
Homework Assignment #1: Answer Key
Econ 497 Economics of the Financial Crisis Professor Ickes Spring 2012 Homework Assignment #1: Answer Key 1. Consider a firm that has future payoff.supposethefirm is unlevered, call the firm and its shares
The Science of Golf. Test Lab Toolkit The Score: Handicap. Grades 6-8
The Science of Golf Test Lab Toolkit The Score: Grades 6-8 Science Technology Engineering Mathematics Table of Contents Welcome to the Test Lab 02 Investigate: Golf Scores 03 Investigate: System 07 Create:
Mathematical Analysis Of Packs Poker. September 22, 2014. Prepared For John Feola New Vision Gaming 5 Samuel Phelps Way North Reading, MA 01864
Mathematical Analysis Of Packs Poker September 22, 2014 Prepared For John Feola New Vision Gaming 5 Samuel Phelps Way North Reading, MA 01864 Office: 978 664-1515 Fax: 978-664 - 5117 www.newvisiongaming.com
Artificial Intelligence (AI)
Overview Artificial Intelligence (AI) A brief introduction to the field. Won t go too heavily into the theory. Will focus on case studies of the application of AI to business. AI and robotics are closely
Term Project: Roulette
Term Project: Roulette DCY Student January 13, 2006 1. Introduction The roulette is a popular gambling game found in all major casinos. In contrast to many other gambling games such as black jack, poker,
Driving Insurance World through Science - 1 - Murli D. Buluswar Chief Science Officer
Driving Insurance World through Science - 1 - Murli D. Buluswar Chief Science Officer What is The Science Team s Mission? 2 What Gap Do We Aspire to Address? ü The insurance industry is data rich but ü
Identifying Player s Strategies in No Limit Texas Hold em Poker through the Analysis of Individual Moves
Identifying Player s Strategies in No Limit Texas Hold em Poker through the Analysis of Individual Moves Luís Filipe Teófilo and Luís Paulo Reis Departamento de Engenharia Informática, Faculdade de Engenharia
Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB)
Bonus Maths 2: Variable Bet Sizing in the Simplest Possible Game of Poker (JB) I recently decided to read Part Three of The Mathematics of Poker (TMOP) more carefully than I did the first time around.
We employed reinforcement learning, with a goal of maximizing the expected value. Our bot learns to play better by repeated training against itself.
Date: 12/14/07 Project Members: Elizabeth Lingg Alec Go Bharadwaj Srinivasan Title: Machine Learning Applied to Texas Hold 'Em Poker Introduction Part I For the first part of our project, we created a
LESSON 7. Leads and Signals. General Concepts. General Introduction. Group Activities. Sample Deals
LESSON 7 Leads and Signals General Concepts General Introduction Group Activities Sample Deals 330 More Commonly Used Conventions in the 21st Century General Concepts This lesson covers the defenders conventional
Learning Agents: Introduction
Learning Agents: Introduction S Luz luzs@cs.tcd.ie October 22, 2013 Learning in agent architectures Performance standard representation Critic Agent perception rewards/ instruction Perception Learner Goals
The Artificial Prediction Market
The Artificial Prediction Market Adrian Barbu Department of Statistics Florida State University Joint work with Nathan Lay, Siemens Corporate Research 1 Overview Main Contributions A mathematical theory
LESSON 1. Opening Leads Against Notrump Contracts. General Concepts. General Introduction. Group Activities. Sample Deals
LESSON 1 Opening Leads Against Notrump Contracts General Concepts General Introduction Group Activities Sample Deals 8 Defense in the 21st Century GENERAL CONCEPTS Defense The opening lead against notrump
Goals. MIT Intermediate Bridge Lesson Series. Defensive Strategies. Lead Decision Process. MIT Intermediate Lesson Series
MIT Intermediate Bridge Lesson Series LEADS: The Decision Process Goals One is on lead 25% of the time. Thus, leading has a significant impact on one's results. Determine the lead is much deeper then ask
NewPokerSoft. Texas Holdem Poker Game Simulator
NewPokerSoft poker for life Texas Holdem Poker Game Simulator www.newpokersoft.com Poker training simulator for Texas Holdem Here, we present the simulator of the Texas Holdem PokerGame. It can be used
A Knowledge-based Approach of Connect-Four
A Knowledge-based Approach of Connect-Four The Game is Solved: White Wins Victor Allis Department of Mathematics and Computer Science Vrije Universiteit Amsterdam, The Netherlands Masters Thesis, October
MAN VS. MACHINE. How IBM Built a Jeopardy! Champion. 15.071x The Analytics Edge
MAN VS. MACHINE How IBM Built a Jeopardy! Champion 15.071x The Analytics Edge A Grand Challenge In 2004, IBM Vice President Charles Lickel and coworkers were having dinner at a restaurant All of a sudden,
Betting Best-Of Series
Betting Best-Of Series John Mount May 7, 8 Introduction We use the United States Major League Baseball World Series to demonstrate some of the arbitrage arguments used in mathematical finance. This problem
Mastering Quoridor. Lisa Glendenning THESIS. Submitted in Partial Fulfillment of the Requirements for the Degree of
Mastering Quoridor by Lisa Glendenning THESIS Submitted in Partial Fulfillment of the Requirements for the Degree of Bachelor of Science Computer Science The University of New Mexico Albuquerque, New Mexico
Analyzing the Procurement Process in a Simplified Version of the TAC SCM Game
Analyzing the Procurement Process in a Simplified Version of the TAC SCM Game Hosna Jabbari December 9, 2005 Abstract The TAC supply chain management game presents a simulated market environment with automated
CS91.543 MidTerm Exam 4/1/2004 Name: KEY. Page Max Score 1 18 2 11 3 30 4 15 5 45 6 20 Total 139
CS91.543 MidTerm Exam 4/1/2004 Name: KEY Page Max Score 1 18 2 11 3 30 4 15 5 45 6 20 Total 139 % INTRODUCTION, AI HISTORY AND AGENTS 1. [4 pts. ea.] Briefly describe the following important AI programs.
21 st Century Knowledge Worker: the Centaur
21 st Century Knowledge Worker: the Centaur Daniel Kiss Introduction The centaur is a well-known mythological creature, half-human half-horse. The most famous of centaurs was Chiron, the teacher of Asclepius,
Generalized Widening
Generalized Widening Tristan Cazenave Abstract. We present a new threat based search algorithm that outperforms other threat based search algorithms and selective knowledge-based for open life and death
Example Hand Say you are dealt the following cards: Suits Suits are ranked in the following order.
Chinese Poker or 13 Card Poker This game is played with 4 players. Each player is dealt 13 cards. The object is to arrange them into 3 groups: one consisting of 3 cards (front hand), and two consisting
Source. http://en.wikipedia.org/wiki/poker
AI of poker game 1 C H U N F U N G L E E 1 0 5 4 3 0 4 6 1 C S E 3 5 2 A R T I F I C I A L I N T E L L I G E N C E P R O. A N I T A W A S I L E W S K A Source CAWSEY, ALISON. THE ESSENCE OF ARTIFICAL INTELLIGENCE.
BEGINNER S BRIDGE NOTES. Leigh Harding
BEGINNER S BRIDGE NOTES Leigh Harding PLAYING THE CARDS IN TRUMP CONTRACTS Don t play a single card until you have planned how you will make your contract! The plan will influence decisions you will have
Game theory and AI: a unified approach to poker games
Game theory and AI: a unified approach to poker games Thesis for graduation as Master of Artificial Intelligence University of Amsterdam Frans Oliehoek 2 September 2005 ii Abstract This thesis focuses
Find-The-Number. 1 Find-The-Number With Comps
Find-The-Number 1 Find-The-Number With Comps Consider the following two-person game, which we call Find-The-Number with Comps. Player A (for answerer) has a number x between 1 and 1000. Player Q (for questioner)
Pool Play Brackets 3 TEAM POOL PLAY FORMAT. Game 1 1 vs. 2* Game 2 2 vs. 3* Game 3 3 vs. 1* Example 3 Team Pool Play 4 TEAM POOL PLAY FORMAT
Pool Play Brackets Game 1 Game 2 Game 3 Team 1 Iowa Team 2 Kansas Team 3 Missouri Iowa vs. Kansas* Kansas vs. Missouri* Missouri vs. Iowa* Note: Games may be played in any order 3 TEAM POOL PLAY FORMAT
AN A R TI F I C I AL I N TE L L IG E N C E AG E N T F OR TE X A S HOL D E M P O KE R P ATRI C K M C CU R LEY 0 62 4 91 7 90
AN A R TI F I C I AL I N TE L L IG E N C E AG E N T F OR TE X A S HOL D E M P O KE R P ATRI C K M C CU R LEY 0 62 4 91 7 90 2 An Artificial Intelligence Agent for Texas Hold em Poker I declare tha t this
Machine Learning: Overview
Machine Learning: Overview Why Learning? Learning is a core of property of being intelligent. Hence Machine learning is a core subarea of Artificial Intelligence. There is a need for programs to behave
(b) You draw two balls from an urn and track the colors. When you start, it contains three blue balls and one red ball.
Examples for Chapter 3 Probability Math 1040-1 Section 3.1 1. Draw a tree diagram for each of the following situations. State the size of the sample space. (a) You flip a coin three times. (b) You draw
Research Directions in Computer Game AI. Rafael Cabredo
Research Directions in Computer Game AI Rafael Cabredo Your speaker Rafael Cabredo Faculty at De La Salle University Research interests: AI in Computer Games Graphics Game Development Contact info: cabredor@dlsu.edu.ph
OPENING LEADS. Audrey Grant. How to Take More Tricks on Defense THE IMPACT OF AGAINST NOTRUMP CONTRACTS
BIL Presentation - February 20, 2013 THE AUDREY GRANT BETTER BRIDGE SERIES THE IMPACT OF OPENING LEADS AGAINST NOTRUMP CONTRACTS How to Take More Tricks on Defense Audrey Grant The Impact of Opening Leads
Using games to support. Win-Win Math Games. by Marilyn Burns
4 Win-Win Math Games by Marilyn Burns photos: bob adler Games can motivate students, capture their interest, and are a great way to get in that paperand-pencil practice. Using games to support students
LESSON 7. Managing the Trump Suit. General Concepts. General Introduction. Group Activities. Sample Deals
LESSON 7 Managing the Trump Suit General Concepts General Introduction Group Activities Sample Deals 170 Lesson 7 Managing the Trump Suit GENERAL CONCEPTS Play of the Hand Drawing trumps Playing the trump
Machine Learning CS 6830. Lecture 01. Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu
Machine Learning CS 6830 Razvan C. Bunescu School of Electrical Engineering and Computer Science bunescu@ohio.edu What is Learning? Merriam-Webster: learn = to acquire knowledge, understanding, or skill
Poker Strategies. Joe Pasquale CSE87: UCSD Freshman Seminar on The Science of Casino Games: Theory of Poker Spring 2006
Poker Strategies Joe Pasquale CSE87: UCSD Freshman Seminar on The Science of Casino Games: Theory of Poker Spring 2006 References Getting Started in Hold em, E. Miller excellent beginner book Winning Low
Making Sense of the Mayhem: Machine Learning and March Madness
Making Sense of the Mayhem: Machine Learning and March Madness Alex Tran and Adam Ginzberg Stanford University atran3@stanford.edu ginzberg@stanford.edu I. Introduction III. Model The goal of our research
YesFreeCash.com Free Bonus Hunting Tutorial For Beginners
YesFreeCash.com Free Bonus Hunting Tutorial For Beginners Written by the team of www.yesfreecash.com 2007 yesfreecash.com This is a guideline written by yesfreecash.com to help people who don t know much