April 25, Competing and cooperating with AI. Pantelis P. Analytis. Human behavior in Chess. Competing with AI. Cooperative machines?
|
|
- Christian Dustin Watkins
- 5 years ago
- Views:
Transcription
1 April 25, / 47
2 / 47
3 The case of chess 3 / 47
4 chess The first stage was the orientation phase, in which the subject assessed the situation determined a very general idea of what to do next. The second stage, the exploration phase was manifested by looking at some branches of the game tree. The third stage, or investigation phase resulted in the subject choosing a probable best move. Finally, in the fourth stage, the proof phase, saw the subject confirming with him/herself that the results of the investigation were valid. 4 / 47
5 chess Masters search through about the same number of possibilities as weaker players-perhaps even fewer, almost certainly not more-but they are very good at coming up with the right moves for further consideration, whereas weaker players spend considerable time analyzing the consequences of bad moves. De Groot found an intriguing difference between masters weaker players in his short-term memory experiments. Masters showed a remarkable ability to reconstruct a chess position almost perfectly after viewing it for only 5 sec. 5 / 47
6 Pattern recognition in chess experts (Chase Simon, 1978) 6 / 47
7 Pattern recognition in chess experts (Chase Simon, 1978) 7 / 47
8 Artificial intelligence timeline 8 / 47
9 Search strategies possible boards possible games since sequence matters. 9 / 47
10 Search strategies 10 / 47
11 Samuel s checkers player 11 / 47
12 Bernstein s chess player 12 / 47
13 Tesauro s TD-gammon 13 / 47
14 Kasparov vs. Deep Blue 14 / 47
15 IBM s Watson 15 / 47
16 winners in Jeopardy 16 / 47
17 Watson s progress 17 / 47
18 Evidence accumulation in humans 18 / 47
19 Performance In Atari games 19 / 47
20 Performance In Atari games 20 / 47
21 AlphaGo 21 / 47
22 AlphaGo 22 / 47
23 AlphaGo 23 / 47
24 Texas holdem Libratus 24 / 47
25 The graph coloring problem 25 / 47
26 The graph coloring problem (Kearns et al. 2006) 26 / 47
27 The graph coloring problem (Kearns et al. 2006) 27 / 47
28 With a little help from the bots (Shirado Christakis, 2017) 28 / 47
29 With a little help from the bots (Shirado Christakis, 2017) 29 / 47
30 Cooperation with machines, (Crall et al. 2017) 30 / 47
31 Cooperation with machines (Crall et al. 2017) 31 / 47
32 Cooperation with machines (Crall et al. 2017) 32 / 47
33 33 / 47
34 Elisa: the first chatbot Developed by Joseph Weizenbaum in 1966 to imitate the behavior of a Rogerian psychotherapist. 34 / 47
35 Parry: bot with schizophrenia the only serious interesting attempt by any program designer to win even a severely modified Turing has been Kenneth Colby. He had genuine psychiatrists interview PARRY. He did not suggest that they might be talking or typing to a computer; rather he made up some plausible story about why they were communicating with a real live patient via teletype. Then he took the PARRY transcript, inserted it into a group of teletype transcripts gave them to another group of experts?more psychiatrists? said, One of these was a conversation with a computer. Can you figure out which one it was? They couldn t. in Daniel Dennett 35 / 47
36 Captcha the inverse Turing 36 / 47
37 The trolley problem 37 / 47
38 The trolley problem: the fat guy 38 / 47
39 Variations of the problem 39 / 47
40 The autonomous car dilemma 40 / 47
41 The autonomous car dilemma Study one had 182 participants, while study two / 47
42 The autonomous car dilemma Study three had 259 participants, study four 267, study five 367 study six / 47
43 The position based model 43 / 47
44 The position based model 44 / 47
45 The cascade model 45 / 47
46 Dynamic Bayesian network model 46 / 47
Computer Science 1400: Part #8: Where We Are: Artificial Intelligence WHAT IS ARTIFICIAL INTELLIGENCE (AI)? AI IN SOCIETY RELATING WITH AI
Computer Science 1400: Part #8: Where We Are: Artificial Intelligence WHAT IS ARTIFICIAL INTELLIGENCE (AI)? AI IN SOCIETY RELATING WITH AI What is Artificial Intelligence (AI)? Artificial Intelligence
More informationFinal Lecture: Fun, mainly
Today s Plan Final Lecture: Fun, mainly Minesweeper Conway s Game of Life The Busy-Beaver function Eliza The Turing Test: Can a machine be intelligent? The Chinese Room: Maybe not. A Story about a Barometer
More information4/20/12. Weak AI. CS 112 Introduction to Programming. Lecture #37: AI and Future of CS. Artificial Intelligence. (Spring 2012) Zhong Shao
4/20/12 Artificial Intelligence CS 112 Introduction to Programming Fundamental questions. Is real life described by discrete rules, or not? Can we build a intelligent computer from living components? Can
More informationCS 112 Introduction to Programming
CS 112 Introduction to Programming (Spring 2012) Lecture #37: AI and Future of CS Zhong Shao Department of Computer Science Yale University Office: 314 Watson http://flint.cs.yale.edu/cs112 Acknowledgements:
More informationFun, Games, and AI. Conway's Game of Life. TSP Competition. Conway's Game of Life
TSP Competition Fun, Games, and AI 1. Morgan Ong. 16781.863. 2. Zhihong Zu. 17,006.725. 3. Mitchell Namias. 17,083.4. Smallest insertion. 17265.628. Nearest insertion. 27868.710. Best so far. Jeff Bagdis,
More informationUNIT 13A AI: Games & Search Strategies
UNIT 13A AI: Games & Search Strategies 1 Artificial Intelligence Branch of computer science that studies the use of computers to perform computational processes normally associated with human intellect
More informationArtificial intelligence: past, present and future
Artificial intelligence: past, present and future Thomas Bolander, Associate Professor, DTU Compute Danske Ideer, 15 March 2017 Thomas Bolander, Danske Ideer, 15 Mar 2017 p. 1/21 A bit about myself Thomas
More informationArtificial Intelligence CS365. Amitabha Mukerjee
Artificial Intelligence CS365 Amitabha Mukerjee What is intelligence Acting humanly: Turing Test Turing (1950) "Computing machinery and intelligence": "Can machines think?" Imitation Game Acting humanly:
More informationGame AI Challenges: Past, Present, and Future
Game AI Challenges: Past, Present, and Future Professor Michael Buro Computing Science, University of Alberta, Edmonton, Canada www.skatgame.net/cpcc2018.pdf 1/ 35 AI / ML Group @ University of Alberta
More informationWhat is Artificial Intelligence? Alternate Definitions (Russell + Norvig) Human 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. What is AI? What is
More informationOverview. Origins. Idea of programming computers for "intelligent" behavior. First suggested by Alan Turing, 1950.
Lecture S2: Artificial Intelligence Lecture S2: Artificial Intelligence Overview Origins A whirlwind tour of Artificial Intelligence. Idea of programming computers for "intelligent" behavior. First suggested
More informationUNIT 13A AI: Games & Search Strategies. Announcements
UNIT 13A AI: Games & Search Strategies 1 Announcements Do not forget to nominate your favorite CA bu emailing gkesden@gmail.com, No lecture on Friday, no recitation on Thursday No office hours Wednesday,
More informationTHE AI REVOLUTION. How Artificial Intelligence is Redefining Marketing Automation
THE AI REVOLUTION How Artificial Intelligence is Redefining Marketing Automation The implications of Artificial Intelligence for modern day marketers The shift from Marketing Automation to Intelligent
More informationIntroduction and History of AI
15-780 Introduction and History of AI J. Zico Kolter January 13, 2014 1 What is AI? 2 Some classic definitions Buildings computers that... Think like humans Act like humans Think rationally Act rationally
More informationCS 331: Artificial Intelligence Adversarial Search II. Outline
CS 331: Artificial Intelligence Adversarial Search II 1 Outline 1. Evaluation Functions 2. State-of-the-art game playing programs 3. 2 player zero-sum finite stochastic games of perfect information 2 1
More informationAI in Tabletop Games. Team 13 Josh Charnetsky Zachary Koch CSE Professor Anita Wasilewska
AI in Tabletop Games Team 13 Josh Charnetsky Zachary Koch CSE 352 - Professor Anita Wasilewska Works Cited Kurenkov, Andrey. a-brief-history-of-game-ai.png. 18 Apr. 2016, www.andreykurenkov.com/writing/a-brief-history-of-game-ai/
More informationConway's Game of Life. Artificial Intelligence. Conway's Game of Life. Conway's Game of Life
Artificial Intelligence Conway's Game of Life John Conway hacker's emblem Introduction to Computer Science Sedgewick and Wayne Copyright 2007 http://www.cs.princeton.edu/introcs 2 Conway's Game of Life
More informationTEMPORAL DIFFERENCE LEARNING IN CHINESE CHESS
TEMPORAL DIFFERENCE LEARNING IN CHINESE CHESS Thong B. Trinh, Anwer S. Bashi, Nikhil Deshpande Department of Electrical Engineering University of New Orleans New Orleans, LA 70148 Tel: (504) 280-7383 Fax:
More informationCSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes.
CSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes. Artificial Intelligence A branch of Computer Science. Examines how we can achieve intelligent
More informationQuick work: Memory allocation
Quick work: Memory allocation The OS is using a fixed partition algorithm. Processes place requests to the OS in the following sequence: P1=15 KB, P2=5 KB, P3=30 KB Draw the memory map at the end, if each
More informationCPS 570: Artificial Intelligence Two-player, zero-sum, perfect-information Games
CPS 57: Artificial Intelligence Two-player, zero-sum, perfect-information Games Instructor: Vincent Conitzer Game playing Rich tradition of creating game-playing programs in AI Many similarities to search
More informationArtificial Intelligence. Conway's Game of Life. Conway's Game of Life
Artificial Intelligence Introduction to Computer Science Sedgewick and Wayne Copyright 2007 http://www.cs.princeton.edu/introcs Conway's Game of Life Conway's Game of Life Conway's game of life. Critters
More informationCS440/ECE448 Lecture 11: Stochastic Games, Stochastic Search, and Learned Evaluation Functions
CS440/ECE448 Lecture 11: Stochastic Games, Stochastic Search, and Learned Evaluation Functions Slides by Svetlana Lazebnik, 9/2016 Modified by Mark Hasegawa Johnson, 9/2017 Types of game environments Perfect
More informationWhat's involved in Intelligence?
AI Methodology Theoretical aspects Mathematical formalizations, properties, algorithms Engineering aspects The act of building (useful) machines Empirical science Experiments What's involved in Intelligence?
More informationCOMS 493 AI, ROBOTS & COMMUNICATION
COMS 493 AI, ROBOTS & COMMUNICATION Agenda AI Introduction Review Presentation Sign-up History, Hype & Reality Preview Review http://gunkelweb.com/coms493 Presentations History, Hype & Reality Objective:
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 6. Board Games Search Strategies for Games, Games with Chance, State of the Art Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität
More informationWhat's involved in Intelligence?
AI Methodology Theoretical aspects Mathematical formalizations, properties, algorithms Engineering aspects The act of building (useful) machines Empirical science Experiments What's involved in Intelligence?
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 6. Board Games Search Strategies for Games, Games with Chance, State of the Art Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität
More informationThomas Hofmann Institute for Machine Learning, ETH Zürich
A.I. A Genie in the Bottle? Thomas Hofmann Institute for Machine Learning, ETH Zürich 1 What is A.I.? What is Intelligence? Intelligence is the ability to understand or to make sense and to act accordingly.
More informationCOMP219: Artificial Intelligence. Lecture 2: AI Problems and Applications
COMP219: Artificial Intelligence Lecture 2: AI Problems and Applications 1 Introduction Last time General module information Characterisation of AI and what it is about Today Overview of some common AI
More informationMonte Carlo Tree Search
Monte Carlo Tree Search 1 By the end, you will know Why we use Monte Carlo Search Trees The pros and cons of MCTS How it is applied to Super Mario Brothers and Alpha Go 2 Outline I. Pre-MCTS Algorithms
More informationSchool of EECS Washington State University. Artificial Intelligence
School of EECS Washington State University Artificial Intelligence 1 } Classic AI challenge Easy to represent Difficult to solve } Zero-sum games Total final reward to all players is constant } Perfect
More informationCSC321 Lecture 23: Go
CSC321 Lecture 23: Go Roger Grosse Roger Grosse CSC321 Lecture 23: Go 1 / 21 Final Exam Friday, April 20, 9am-noon Last names A Y: Clara Benson Building (BN) 2N Last names Z: Clara Benson Building (BN)
More informationCSE 40171: Artificial Intelligence. Adversarial Search: Games and Optimality
CSE 40171: Artificial Intelligence Adversarial Search: Games and Optimality 1 What is a game? Game Playing State-of-the-Art Checkers: 1950: First computer player. 1994: First computer champion: Chinook
More informationA.M. Turing, computer pioneer, worried about intelligence in humans & machines; proposed a test (1950) thinks with electricity
Progress has been tremendous Lawrence Snyder University of Washington, Seattle The inventors of ENIAC, 1 st computer, said it thinks with electricity Do calculators think? Does performing arithmetic, which
More informationGame playing. Chapter 5, Sections 1 6
Game playing Chapter 5, Sections 1 6 Artificial Intelligence, spring 2013, Peter Ljunglöf; based on AIMA Slides c Stuart Russel and Peter Norvig, 2004 Chapter 5, Sections 1 6 1 Outline Games Perfect play
More informationProgress has been tremendous. Lawrence Snyder University of Washington, Seattle
Progress has been tremendous Lawrence Snyder University of Washington, Seattle Lawrence Snyder 2004 The inventors of ENIAC, 1 st computer, said it thinks with electricity Do calculators think? Does performing
More informationGames and Adversarial Search
1 Games and Adversarial Search BBM 405 Fundamentals of Artificial Intelligence Pinar Duygulu Hacettepe University Slides are mostly adapted from AIMA, MIT Open Courseware and Svetlana Lazebnik (UIUC) Spring
More informationCreating a Poker Playing Program Using Evolutionary Computation
Creating a Poker Playing Program Using Evolutionary Computation Simon Olsen and Rob LeGrand, Ph.D. Abstract Artificial intelligence is a rapidly expanding technology. We are surrounded by technology that
More informationPoker AI: Equilibrium, Online Resolving, Deep Learning and Reinforcement Learning
Poker AI: Equilibrium, Online Resolving, Deep Learning and Reinforcement Learning Nikolai Yakovenko NVidia ADLR Group -- Santa Clara CA Columbia University Deep Learning Seminar April 2017 Poker is a Turn-Based
More informationThe REAL Problem With Artificial Intelligence:
The REAL Problem With Artificial Intelligence: A Lack of Understanding Dr. Frank Jones January 2016 Outline of This Talk Beginning (YOU ARE HERE) Middle End Definition: Artificial Intelligence: The branch
More informationArtificial Intelligence Search III
Artificial Intelligence Search III Lecture 5 Content: Search III Quick Review on Lecture 4 Why Study Games? Game Playing as Search Special Characteristics of Game Playing Search Ingredients of 2-Person
More informationDeepStack: Expert-Level AI in Heads-Up No-Limit Poker. Surya Prakash Chembrolu
DeepStack: Expert-Level AI in Heads-Up No-Limit Poker Surya Prakash Chembrolu AI and Games AlphaGo Go Watson Jeopardy! DeepBlue -Chess Chinook -Checkers TD-Gammon -Backgammon Perfect Information Games
More informationRandom Administrivia. In CMC 306 on Monday for LISP lab
Random Administrivia In CMC 306 on Monday for LISP lab Artificial Intelligence: Introduction What IS artificial intelligence? Examples of intelligent behavior: Definitions of AI There are as many definitions
More informationARTIFICIAL INTELLIGENCE (CS 370D)
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) (CHAPTER-5) ADVERSARIAL SEARCH ADVERSARIAL SEARCH Optimal decisions Min algorithm α-β pruning Imperfect,
More informationGoals of this Course. CSE 473 Artificial Intelligence. AI as Science. AI as Engineering. Dieter Fox Colin Zheng
CSE 473 Artificial Intelligence Dieter Fox Colin Zheng www.cs.washington.edu/education/courses/cse473/08au Goals of this Course To introduce you to a set of key: Paradigms & Techniques Teach you to identify
More informationCS6700: The Emergence of Intelligent Machines. Prof. Carla Gomes Prof. Bart Selman Cornell University
EMERGENCE OF INTELLIGENT MACHINES: CHALLENGES AND OPPORTUNITIES CS6700: The Emergence of Intelligent Machines Prof. Carla Gomes Prof. Bart Selman Cornell University Artificial Intelligence After a distinguished
More informationCS 380: ARTIFICIAL INTELLIGENCE
CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH 10/23/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Recall: Problem Solving Idea: represent
More informationGame-playing Programs. Game trees
This article appeared in The Encylopedia of Cognitive Science, 2002 London, Macmillan Reference Ltd. Game-playing Programs Article definition: Game-playing programs rely on fast deep search and knowledge
More informationLecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey
Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey Outline 1) What is AI: The Course 2) What is AI: The Field 3) Why to take the class (or not) 4) A Brief History of AI 5) Predict
More informationCS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH Santiago Ontañón so367@drexel.edu Recall: Problem Solving Idea: represent the problem we want to solve as: State space Actions Goal check Cost function
More informationCMSC 372 Artificial Intelligence. Fall Administrivia
CMSC 372 Artificial Intelligence Fall 2017 Administrivia Instructor: Deepak Kumar Lectures: Mon& Wed 10:10a to 11:30a Labs: Fridays 10:10a to 11:30a Pre requisites: CMSC B206 or H106 and CMSC B231 or permission
More informationCS 380: ARTIFICIAL INTELLIGENCE MONTE CARLO SEARCH. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE MONTE CARLO SEARCH Santiago Ontañón so367@drexel.edu Recall: Adversarial Search Idea: When there is only one agent in the world, we can solve problems using DFS, BFS, ID,
More informationThese are the slides accompanying the book Artificial Intelligence and Games through the gameaibook.org website
These are the slides accompanying the book Artificial Intelligence and Games through the gameaibook.org website 1 Some reasons why a course on game AI is time-relevant and important 2 Some potential learning
More informationAdversarial Search and Game- Playing C H A P T E R 6 C M P T : S P R I N G H A S S A N K H O S R A V I
Adversarial Search and Game- Playing C H A P T E R 6 C M P T 3 1 0 : S P R I N G 2 0 1 1 H A S S A N K H O S R A V I Adversarial Search Examine the problems that arise when we try to plan ahead in a world
More informationOutline. Introduction to AI. Artificial Intelligence. What is an AI? What is an AI? Agents Environments
Outline Introduction to AI ECE457 Applied Artificial Intelligence Fall 2007 Lecture #1 What is an AI? Russell & Norvig, chapter 1 Agents s Russell & Norvig, chapter 2 ECE457 Applied Artificial Intelligence
More informationAdversarial search (game playing)
Adversarial search (game playing) References Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Nilsson, Artificial intelligence: A New synthesis. McGraw Hill,
More informationArtificial Intelligence. Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University
Artificial Intelligence Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University What is AI? What is Intelligence? The ability to acquire and apply knowledge and skills (definition
More informationOutline. What is AI? A brief history of AI State of the art
Introduction to AI Outline What is AI? A brief history of AI State of the art What is AI? AI is a branch of CS with connections to psychology, linguistics, economics, Goal make artificial systems solve
More informationGame Design Verification using Reinforcement Learning
Game Design Verification using Reinforcement Learning Eirini Ntoutsi Dimitris Kalles AHEAD Relationship Mediators S.A., 65 Othonos-Amalias St, 262 21 Patras, Greece and Department of Computer Engineering
More informationArtificial Intelligence. Minimax and alpha-beta pruning
Artificial Intelligence Minimax and alpha-beta pruning In which we examine the problems that arise when we try to plan ahead to get the best result in a world that includes a hostile agent (other agent
More informationLecture 33: How can computation Win games against you? Chess: Mechanical Turk
4/2/0 CS 202 Introduction to Computation " UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department Lecture 33: How can computation Win games against you? Professor Andrea Arpaci-Dusseau Spring 200
More informationCS 771 Artificial Intelligence. Adversarial Search
CS 771 Artificial Intelligence Adversarial Search Typical assumptions Two agents whose actions alternate Utility values for each agent are the opposite of the other This creates the adversarial situation
More informationGame Playing. Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.
Game Playing Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM. Game Playing In most tree search scenarios, we have assumed the situation is not going to change whilst
More informationWhat is AI? Robert Platt Northeastern University
Robert Platt Northeastern University Some material used from: 1. Russell/Norvig, AIMA 2. Stacy Marsella, CS4100 3. Seif El-Nasr, CS4100 4. Amy Hoover, CS4100 Historical perspective: Handbook of AI: the
More informationDecision Making in Multiplayer Environments Application in Backgammon Variants
Decision Making in Multiplayer Environments Application in Backgammon Variants PhD Thesis by Nikolaos Papahristou AI researcher Department of Applied Informatics Thessaloniki, Greece Contributions Expert
More informationHumanization of Computational Learning in Strategy Games
1 Humanization of Computational Learning in Strategy Games By Benjamin S. Greenberg S.B., C.S. M.I.T., 2015 Submitted to the Department of Electrical Engineering and Computer Science in Partial Fulfillment
More informationFoundations of AI. 6. Board Games. Search Strategies for Games, Games with Chance, State of the Art
Foundations of AI 6. Board Games Search Strategies for Games, Games with Chance, State of the Art Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller SA-1 Contents Board Games Minimax
More informationADVERSARIAL SEARCH. Today. Reading. Goals. AIMA Chapter , 5.7,5.8
ADVERSARIAL SEARCH Today Reading AIMA Chapter 5.1-5.5, 5.7,5.8 Goals Introduce adversarial games Minimax as an optimal strategy Alpha-beta pruning (Real-time decisions) 1 Questions to ask Were there any
More informationCS 4700: Foundations of Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence selman@cs.cornell.edu Module: Adversarial Search R&N: Chapter 5 Part II 1 Outline Game Playing Optimal decisions Minimax α-β pruning Case study: Deep Blue
More informationHow AI Won at Go and So What? Garry Kasparov vs. Deep Blue (1997)
How AI Won at Go and So What? Garry Kasparov vs. Deep Blue (1997) Alan Fern School of Electrical Engineering and Computer Science Oregon State University Deep Mind s vs. Lee Sedol (2016) Watson vs. Ken
More informationWhat is AI? AI is the reproduction of human reasoning and intelligent behavior by computational methods. an attempt of. Intelligent behavior Computer
What is AI? an attempt of AI is the reproduction of human reasoning and intelligent behavior by computational methods Intelligent behavior Computer Humans 1 What is AI? (R&N) Discipline that systematizes
More informationCSE 473 Artificial Intelligence (AI)
CSE 473 Artificial Intelligence (AI) Rajesh Rao (Instructor) Jennifer Hanson (TA) Evan Herbst (TA) http://www.cs.washington.edu/473 Based on slides by UW CSE AI faculty, Dan Klein, Stuart Russell, Andrew
More informationGame Playing State-of-the-Art CSE 473: Artificial Intelligence Fall Deterministic Games. Zero-Sum Games 10/13/17. Adversarial Search
CSE 473: Artificial Intelligence Fall 2017 Adversarial Search Mini, pruning, Expecti Dieter Fox Based on slides adapted Luke Zettlemoyer, Dan Klein, Pieter Abbeel, Dan Weld, Stuart Russell or Andrew Moore
More informationAdversarial Search. Soleymani. Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 5
Adversarial Search CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2017 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 5 Outline Game
More informationLecture 1 Introduction to AI
Lecture 1 Introduction to AI Kristóf Karacs PPKE-ITK Questions? What is intelligence? What makes it artificial? What can we use it for? How does it work? How to create it? How to control / repair / improve
More informationIntroduction to Talking Robots
Introduction to Talking Robots Graham Wilcock Adjunct Professor, Docent Emeritus University of Helsinki 8.12.2015 1 Robots and Artificial Intelligence Graham Wilcock 8.12.2015 2 Breakthrough Steps of Artificial
More informationUsing Neural Network and Monte-Carlo Tree Search to Play the Game TEN
Using Neural Network and Monte-Carlo Tree Search to Play the Game TEN Weijie Chen Fall 2017 Weijie Chen Page 1 of 7 1. INTRODUCTION Game TEN The traditional game Tic-Tac-Toe enjoys people s favor. Moreover,
More informationBy David Anderson SZTAKI (Budapest, Hungary) WPI D2009
By David Anderson SZTAKI (Budapest, Hungary) WPI D2009 1997, Deep Blue won against Kasparov Average workstation can defeat best Chess players Computer Chess no longer interesting Go is much harder for
More informationCan Computers Think? Dijkstra: Whether a computer can think is about as interesting as whether a submarine can swim. 2006, Lawrence Snyder
Can Computers Think? Dijkstra: Whether a computer can think is about as interesting as whether a submarine can swim. 2006, Lawrence Snyder Thinking with Electricity The inventors of ENIAC, 1 st computer,
More informationTD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play
NOTE Communicated by Richard Sutton TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play Gerald Tesauro IBM Thomas 1. Watson Research Center, I? 0. Box 704, Yorktozon Heights, NY 10598
More informationExperiments with Tensor Flow Roman Weber (Geschäftsführer) Richard Schmid (Senior Consultant)
Experiments with Tensor Flow 23.05.2017 Roman Weber (Geschäftsführer) Richard Schmid (Senior Consultant) WEBGATE CONSULTING Gegründet Mitarbeiter CH Inhaber geführt IT Anbieter Partner 2001 Ex 29 Beratung
More informationArtificial Intelligence
Artificial Intelligence One way to define Artificial Intelligence (AI) is as a branch of science trying to determine and formally describe, permitting a computer implementation the solutions for hard problems.
More informationAI & Machine Learning. By Jan Øye Lindroos
AI & Machine Learning By Jan Øye Lindroos About This Talk Brief introduction to AI: Definition and Characteristics Machine Learning: Types of ML, example algorithms Historical Overview: 1940-Present Present
More informationReinforcement Learning in Games Autonomous Learning Systems Seminar
Reinforcement Learning in Games Autonomous Learning Systems Seminar Matthias Zöllner Intelligent Autonomous Systems TU-Darmstadt zoellner@rbg.informatik.tu-darmstadt.de Betreuer: Gerhard Neumann Abstract
More information3 rd December AI at arago. The Impact of Intelligent Automation on the Blue Chip Economy
Hans-Christian AI AT ARAGO Chris Boos @boosc 3 rd December 2015 AI at arago The Impact of Intelligent Automation on the Blue Chip Economy From Industry to Technology AI at arago AI AT ARAGO The Economic
More informationCS 1571 Introduction to AI Lecture 1. Course overview. CS 1571 Intro to AI. Course administrivia
CS 1571 Introduction to AI Lecture 1 Course overview Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administrivia Instructor: Milos Hauskrecht 5329 Sennott Square milos@cs.pitt.edu TA: Swapna
More informationARTIFICIAL INTELLIGENCE
BABEŞ-BOLYAI UNIVERSITY Faculty of Computer Science and Mathematics ARTIFICIAL INTELLIGENCE Introduction Summary Short questions about AI History of AI Applications of AI 2 Short questions about AI What
More informationGame 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.
More informationGame-playing: DeepBlue and AlphaGo
Game-playing: DeepBlue and AlphaGo Brief history of gameplaying frontiers 1990s: Othello world champions refuse to play computers 1994: Chinook defeats Checkers world champion 1997: DeepBlue defeats world
More informationAdversarial Search and Game Playing. Russell and Norvig: Chapter 5
Adversarial Search and Game Playing Russell and Norvig: Chapter 5 Typical case 2-person game Players alternate moves Zero-sum: one player s loss is the other s gain Perfect information: both players have
More informationAdversarial Search. Human-aware Robotics. 2018/01/25 Chapter 5 in R&N 3rd Ø Announcement: Slides for this lecture are here:
Adversarial Search 2018/01/25 Chapter 5 in R&N 3rd Ø Announcement: q Slides for this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse471/lectures/adversarial.pdf Slides are largely based
More informationV. Adamchik Data Structures. Game Trees. Lecture 1. Apr. 05, Plan: 1. Introduction. 2. Game of NIM. 3. Minimax
Game Trees Lecture 1 Apr. 05, 2005 Plan: 1. Introduction 2. Game of NIM 3. Minimax V. Adamchik 2 ü Introduction The search problems we have studied so far assume that the situation is not going to change.
More informationAutomated Suicide: An Antichess Engine
Automated Suicide: An Antichess Engine Jim Andress and Prasanna Ramakrishnan 1 Introduction Antichess (also known as Suicide Chess or Loser s Chess) is a popular variant of chess where the objective of
More informationIntroduction to Artificial Intelligence CS540-1
Introduction to Artificial Intelligence CS540-1 slide 1 AI Examples: Cars that drive themselves 2005: DARPA grand challenge http://video.google.com/videoplay?docid=- 8274817955695344576&hl=en 2011: Google
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Adversarial Search Prof. Scott Niekum The University of Texas at Austin [These slides are based on those of Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationDIT411/TIN175, Artificial Intelligence. Peter Ljunglöf. 2 February, 2018
DIT411/TIN175, Artificial Intelligence Chapters 4 5: Non-classical and adversarial search CHAPTERS 4 5: NON-CLASSICAL AND ADVERSARIAL SEARCH DIT411/TIN175, Artificial Intelligence Peter Ljunglöf 2 February,
More informationGame Playing. Philipp Koehn. 29 September 2015
Game Playing Philipp Koehn 29 September 2015 Outline 1 Games Perfect play minimax decisions α β pruning Resource limits and approximate evaluation Games of chance Games of imperfect information 2 games
More informationTraining a Back-Propagation Network with Temporal Difference Learning and a database for the board game Pente
Training a Back-Propagation Network with Temporal Difference Learning and a database for the board game Pente Valentijn Muijrers 3275183 Valentijn.Muijrers@phil.uu.nl Supervisor: Gerard Vreeswijk 7,5 ECTS
More informationCS 188: Artificial Intelligence
CS 188: Artificial Intelligence Adversarial Search Instructor: Stuart Russell University of California, Berkeley Game Playing State-of-the-Art Checkers: 1950: First computer player. 1959: Samuel s self-taught
More information