CS 112 Introduction to Programming

Similar documents
4/20/12. Weak AI. CS 112 Introduction to Programming. Lecture #37: AI and Future of CS. Artificial Intelligence. (Spring 2012) Zhong Shao

Fun, Games, and AI. Conway's Game of Life. TSP Competition. Conway's Game of Life

Conway's Game of Life. Artificial Intelligence. Conway's Game of Life. Conway's Game of Life

Artificial Intelligence. Conway's Game of Life. Conway's Game of Life

Final Lecture: Fun, mainly

Overview. Origins. Idea of programming computers for "intelligent" behavior. First suggested by Alan Turing, 1950.

What is Artificial Intelligence? Alternate Definitions (Russell + Norvig) Human intelligence

What is AI? Robert Platt Northeastern University

April 25, Competing and cooperating with AI. Pantelis P. Analytis. Human behavior in Chess. Competing with AI. Cooperative machines?

CSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes.

Random Administrivia. In CMC 306 on Monday for LISP lab

UNIT 13A AI: Games & Search Strategies. Announcements

Foundations of AI. 6. Adversarial Search. Search Strategies for Games, Games with Chance, State of the Art. Wolfram Burgard & Bernhard Nebel

COMP219: Artificial Intelligence. Lecture 2: AI Problems and Applications

Introduction and History of AI

What is AI? AI is the reproduction of human reasoning and intelligent behavior by computational methods. an attempt of. Intelligent behavior Computer

History and Philosophical Underpinnings

Overview. Pre AI developments. Birth of AI, early successes. Overwhelming optimism underwhelming results

Foundations of AI. 6. Board Games. Search Strategies for Games, Games with Chance, State of the Art

ARTIFICIAL INTELLIGENCE

Lecture 1 What is AI?

Foundations of AI. 5. Board Games. Search Strategies for Games, Games with Chance, State of the Art. Wolfram Burgard and Luc De Raedt SA-1

Applied Applied Artificial Intelligence - a (short) Silicon Valley appetizer

Foundations of Artificial Intelligence

UNIT 13A AI: Games & Search Strategies

Foundations of Artificial Intelligence

Dr Rong Qu History of AI

V. Adamchik Data Structures. Game Trees. Lecture 1. Apr. 05, Plan: 1. Introduction. 2. Game of NIM. 3. Minimax

MITOCW MIT15_071S17_Session_1.2.02_300k

Welcome to CompSci 171 Fall 2010 Introduction to AI.

Lecture 33: How can computation Win games against you? Chess: Mechanical Turk

Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey

CS6700: The Emergence of Intelligent Machines. Prof. Carla Gomes Prof. Bart Selman Cornell University

What's involved in Intelligence?

Artificial Intelligence CS365. Amitabha Mukerjee

Artificial Intelligence. Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University

Overview. Introduction to Artificial Intelligence. What is Intelligence? What is Artificial Intelligence? Influential areas for AI

Quick work: Memory allocation

Computer Science 1400: Part #8: Where We Are: Artificial Intelligence WHAT IS ARTIFICIAL INTELLIGENCE (AI)? AI IN SOCIETY RELATING WITH AI

Contents. Foundations of Artificial Intelligence. Problems. Why Board Games?

What's involved in Intelligence?

Artificial Intelligence. Minimax and alpha-beta pruning

Game Playing. Garry Kasparov and Deep Blue. 1997, GM Gabriel Schwartzman's Chess Camera, courtesy IBM.

ES 492: SCIENCE IN THE MOVIES

A.M. Turing, computer pioneer, worried about intelligence in humans & machines; proposed a test (1950) thinks with electricity

COS 402 Machine Learning and Artificial Intelligence Fall Lecture 1: Intro

CS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Lecture #5

Unit 12: Artificial Intelligence CS 101, Fall 2018

Progress has been tremendous. Lawrence Snyder University of Washington, Seattle

CS 188: Artificial Intelligence

CS 380: ARTIFICIAL INTELLIGENCE INTRODUCTION. Santiago Ontañón

ARTIFICIAL INTELLIGENCE (CS 370D)

Creating a Poker Playing Program Using Evolutionary Computation

LECTURE 1: OVERVIEW. CS 4100: Foundations of AI. Instructor: Robert Platt. (some slides from Chris Amato, Magy Seif El-Nasr, and Stacy Marsella)

Philosophy. AI Slides (5e) c Lin

CS 188: Artificial Intelligence Spring Announcements

Announcements. Homework 1. Project 1. Due tonight at 11:59pm. Due Friday 2/8 at 4:00pm. Electronic HW1 Written HW1

The REAL Problem With Artificial Intelligence:

Introduction to Artificial Intelligence

CPS331 Lecture: Search in Games last revised 2/16/10

Chapter 32. Extraordinary Achievements

Monte Carlo Tree Search

CS 343: Artificial Intelligence

Artificial Intelligence A Very Brief Overview of a Big Field

Adversarial 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

Game Playing State-of-the-Art CSE 473: Artificial Intelligence Fall Deterministic Games. Zero-Sum Games 10/13/17. Adversarial Search

Artificial Intelligence

Artificial Intelligence: Definition

ARTIFICIAL INTELLIGENCE

CS 4700: Foundations of Artificial Intelligence

Programming Project 1: Pacman (Due )

More Adversarial Search

Artificial Intelligence Search III

Artificial Intelligence

CS 380: ARTIFICIAL INTELLIGENCE ADVERSARIAL SEARCH. Santiago Ontañón

How AI Won at Go and So What? Garry Kasparov vs. Deep Blue (1997)

MITOCW Project: Backgammon tutor MIT Multicore Programming Primer, IAP 2007

SDS PODCAST EPISODE 110 ALPHAGO ZERO

Announcements. CS 188: Artificial Intelligence Spring Game Playing State-of-the-Art. Overview. Game Playing. GamesCrafters

Adversarial search (game playing)

Introduction to AI. What is Artificial Intelligence?

Adversarial Search. Hal Daumé III. Computer Science University of Maryland CS 421: Introduction to Artificial Intelligence 9 Feb 2012

Games and Adversarial Search

CS343 Introduction to Artificial Intelligence Spring 2012

The Principles Of A.I Alphago

Math 152: Applicable Mathematics and Computing

Artificial Intelligence

CE213 Artificial Intelligence Lecture 1

Game Playing. Philipp Koehn. 29 September 2015

Today. Types of Game. Games and Search 1/18/2010. COMP210: Artificial Intelligence. Lecture 10. Game playing

CS440/ECE448 Lecture 9: Minimax Search. Slides by Svetlana Lazebnik 9/2016 Modified by Mark Hasegawa-Johnson 9/2017

Artificial Intelligence

For our EC331 project we successfully designed and implemented a PIC based Tic-Tac-Toe game using the PIC16874.

CS 730/830: Intro AI. Prof. Wheeler Ruml. TA Bence Cserna. Thinking inside the box. 5 handouts: course info, project info, schedule, slides, asst 1

Thinking and Autonomy

For slightly more detailed instructions on how to play, visit:

CS 188: Artificial Intelligence

CS440/ECE448 Lecture 11: Stochastic Games, Stochastic Search, and Learned Evaluation Functions

CS 771 Artificial Intelligence. Adversarial Search

Logic Programming. Dr. : Mohamed Mostafa

Transcription:

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: some slides used in this class are taken directly or adapted from those accompanying the textbook: Introduction to Programming in Java: An Interdisciplinary Approach by Robert Sedgewick and Kevin Wayne (Copyright 2002-2010)

Artificial Intelligence Fundamental questions. Is real life described by discrete rules, or not? Can we build a intelligent computer from living components? Can a machine do anything a human can do? Can human intelligence be simulated by a machine? Artificial Intelligence (AI). The science and engineering of making intelligent machines. human brain (around 100 billion neurons) Intel Core i7 microprocessor (around 781 million transistors) 2

Weak AI Can a machine appear intelligent? 3

Artificial Intelligence Goal. [Turing 1950] Program computer to exhibit intelligent behavior. Every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it. J. McCarthy *51 1960s. Very optimistic predictions. Reality. Slow progress (with some striking successes). 4

The Chess-Playing Turk 5

Tic-Tac-Toe Tic tac toe. Two person game of skill. Number of possible games. 255,168. 6

Tic-Tac-Toe Minimax algorithm. If game over, return winner. If X's turn, return max score of children. If Y's turn, return min score of children. Tic-tac-toe is solved. X will never lose; O will never lose. assuming optimal play by X 7

Chess Challenge. [Claude Shannon] Develop a computer program to play chess. Number of possible games. 10 23. N-by-N version. EXPTIME-complete. 8

Kasparaov vs. Deep Blue Deep Blue. [IBM] Supercomputer, augmented by VLSI chess chips. 200 million board positions per second. Machine beats man. [February 1996] First computer program to win a chess game against reigning world champion. Q. Does Deep Blue appear intelligent? modern chess programs run on a laptop are now even better than Deep Blue 9

Poker Poker. Multi-player game of skill and luck. Texas hold 'em poker bots. Not currently competitive with pros. 10

Turing Test Can a machine appear intelligent? If so, how could we tell? 11

Turing Test Judge types questions to both. Computer claims to be human. So does human. Pass. If judge cannot tell which entity is human, we say computer has passed the test and is "intelligent." Prediction. [Turing] Computer would pass test by 2000. 12

Eliza Eliza. [Weizenbaum 1966] Program imitates Rogerian psychiatrist. Works by generating scripted responses to keywords. Just 200 lines of code! Q. Does Eliza appear intelligent? A. You be the judge: http://chayden.net/eliza/eliza.html 13

Eliza Pattern Matching Rules key: perhaps decomp: * reasmb: You don't seem quite certain. reasmb: Why the uncertain tone? reasmb: Can't you be more positive? reasmb: You aren't sure? reasmb: Don't you know? key: francais decomp: * reasmb: goto xforeign reasmb: I told you before, I don't understand French. key: sorry decomp: * reasmb: Please don't apologise. reasmb: Apologies are not necessary. reasmb: I've told you that apologies are not required. key: apologise decomp: * reasmb: goto sorry 14

Parry Parry. [Colby 1972] Program imitates a paranoid schizophrenic. Q. What happens when Parry "meets" Eliza? A. You be the judge: http://tools.ietf.org/html/rfc439 15

Turing Test Loebner Prize $100,000 to first program to pass restricted Turing Test. Annual competition held since 1995. Small awards given to best programs. 16

Loebner Contest Dialogs Hello, Judge. My name is Ella. Please tell me your first name, or whatever I should call you." Call me Lisa. Am I male or female? Okay, I will call you 'Lisa. Am I Male Or Female?' I am here recently from Tainjin, China, so please be patient with me. I'm not a patient because I am not ill. Are you feeling well today? What do you think it means that you are not ill? Have you ever been ill? 'Have you ever been ill?' you say? That's it, Lisa Am I Male Or Female! I will schedule a whipping for you." 17

Loebner Contest Dialogs "What do you think of Reading?" "I'm somewhat crazy about reading. I like to read mystery novels." "I meant the town." "Jones lives in the city and is a writer of children's books." "Does Jones live in Reading, then?" "Tomorrow is another day. We can only live today well." "Do you live, then?" "I live then a lot. Someday we will live on another planet." "I think you are already there." 18

Turing Test Extra Credit http://xkcd.com/329 19

Digression: "Reverse" Turing Test Standard Turing test. Judge is human. Reverse Turing test. Judge is computer! Why? Google allows each user 7GB storage. PayPal once offered $5 for each user who opens a new account. Both need to distinguish real humans from bots. 20

Exploiting Intractability: Captcha's OCR. Given degraded text, find original text. CAPTCHA. [completely automated public Turing test to tell computers and humans apart] http://online.wsj.com/public/resources/images/ob-ab313_captch_20060524170113.gif 21

Knowledge Databases Twenty questions. http://www.20q.net Question answering system. http://start.csail.mit.edu Q. Does a computer that can answer questions appear intelligent? 22

IBM Watson IBM Watson. Capable of answering questions posed in natural language. Combination of natural language processing, information retrieval, machine learning, and massively parallel computing. Massively parallel computer. Written in Java and C++. Challenge. Play Jeopardy competitively against best human players. 23

Watson vs. Brad Rudder vs. Ken Jennings 24

Will Watson Put Your Job in Jeopardy? Q. What to do with Watson now? A. Many commercial applications in the works. Business logic. Medical diagnoses. Legal research. The goal is to have computers start to interact in natural human terms across a range of applications and processes, understanding the questions that humans ask and providing answers that humans can understand and justify. The DeepQA Project 25

Will Watson Put Your Job in Jeopardy? Q. What to do with Watson now? A. Many commercial applications in the works. Business logic. Medical diagnoses. Legal research. 26

Strong AI Can a machine be intelligent? 27

Chinese Room Experiment (Searle 1980) Imagine that: You don't understand Chinese. You're alone in a room that has paper slots labeled "input" and "output." You have a big book of Chinese writing. You have English instructions (but no translations) that tell you what to write on your output paper in response to various inputs. 28

Chinese Room Experiment (Searle 1980) And then: Chinese speakers outside the room pass in pieces of paper with Chinese writing. They know these are questions (but you don't). You consult your manual of instructions, figure out the proper Chinese response, copy it down, and pass it out. http://www.mind.ilstu.edu/curriculum/searle_chinese_room/searle_chinese_room.php 29

Chinese Room Experiment (Searle 1980) Q. The folks outside think you understand Chinese. Do you? Q. If a computer did the same, would it understand Chinese? 30

Chinese Room Experiment Weak AI. Can machines be programmed to exhibit intelligent behavior? A. Surely true: Deep Blue, Chinook, TD-Gammon, Watson, Strong AI. Can machines can be programmed to possess intelligence? Searle. Chinese Room is absolute refutation of strong AI. But many disagree! The question of whether a computer can think is no more interesting than the question of whether a submarine can swim. Edsger Dijkstra An interesting question, but... either way, limitless possibilities remain for applications of computer science. 31

DARPA Grand Challenge 32

DARPA Grand Challenge 33

DARPA Grand Challenge 2004 Grand Challenge. Navigate an autonomous vehicle through 142 mile course in Mohave Desert at military speed. Terramax GhostRider 34

DARPA Grand Challenge 2004 Grand Challenge. Navigate an autonomous vehicle through 142 mile course in Mohave Desert at military speed. Results. [failure] Sandstorm (CMU). Reached mile 7.4. Vehicle went off course, got caught on an obstacle and rubber on the front wheels caught fire. 35

DARPA Grand Challenge 2004 Grand Challenge. Navigate an autonomous vehicle through 142 mile course in Mohave Desert at military speed. Results. [failure] Alice (Caltech). Reached mile 1.3. Vehicle went through a fence, and couldn't come back through. 36

DARPA Grand Challenge 2004 Grand Challenge. Navigate an autonomous vehicle through 142 mile course in Mohave Desert at military speed. Results. [failure] Rocky (Virginia Tech). Vehicle brakes locked up in the start area. 37

DARPA Grand Challenge 2004 Grand Challenge. Navigate an autonomous vehicle through 142 mile course in Mohave Desert at military speed. Results. [failure] David (ENSCO). Vehicle flipped in the start area, experienced a fuel leak, and the team needed to shut off the fuel. 38

DARPA Grand Challenge 2005 Grand Challenge. Navigate an autonomous vehicle through 132 mile course in Mohave Desert at military speed. Results. [success] Stanford team won in under 7 hours; $2 million prize. Prospect Eleven (successfully navigated 9.4 miles) Stanley (Stanford Racing Team) failed because of a performance bug, which starved code to control steering 39

DARPA Grand Challenge 2007 Urban Challenge. Navigate an autonomous vehicle through 60 mile course in mock urban environment, while obeying traffic laws and avoiding other vehicles. 40

DARPA Grand Challenge 2007 Urban Challenge. Navigate an autonomous vehicle through 60 mile course in mock urban environment, while obeying traffic laws and avoiding other vehicles. the six finishers of 2007 Urban Challenge 41