Soccer n58http://youtube.com/watch?v=ICgL1OWs n58 -Ygohttp://youtube.com/watch?v=N8Q15Uc.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Turing’s Test, Searle’s Objection
Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
NO PAIN, NO GAIN… IT’S TIME TO GROW YOUR BRAIN! PART 1.
Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.
Dark Rooms and Chinese Brains Philosophy of Mind BRENT SILBY Unlimited (UPT)
AI for Connect-4 (or other 2-player games) Minds and Machines.
CS 484 – Artificial Intelligence
Adversarial Search Chapter 5.
Artificial Intelligence for Games Game playing Patrick Olivier
Artificial Intelligence in Game Design Heuristics and Other Ideas in Board Games.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Computer Simulation (2) Game Playing. Different Types of Games How many players? –One –Two Element of chance? –Deterministic –Nondeterministic Outcome.
Intro to Robots 10 Artificial Intelligence “I want to make a computer that will be proud of me” Daniel Hillis.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
CIS 310: Visual Programming, Spring 2006 Western State College 310: Visual Programming Othello.
Random Administrivia In CMC 306 on Monday for LISP lab.
Games & Adversarial Search Chapter 6 Section 1 – 4.
1 4 questions (Revisited) What are our underlying assumptions about intelligence? What kinds of techniques will be useful for solving AI problems? At what.
1 Adversary Search Ref: Chapter 5. 2 Games & A.I. Easy to measure success Easy to represent states Small number of operators Comparison against humans.
Introduction to AI, H. Feili 1 Introduction to Artificial Intelligence LECTURE 1: Introduction What is AI? Foundations of AI The.
Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.
Reference: "Artificial Intelligence, a Modern Approach, 3rd ed."
CIS 197 Computers in Society Professor John Peterson Philosophy Week!
Game Playing.
Artificial Intelligence in Game Design Lecture 22: Heuristics and Other Ideas in Board Games.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Artificial Intelligence
 Summary  How to Play Go  Project Details  Demo  Results  Conclusions.
Game Playing Chapter 5. Game playing §Search applied to a problem against an adversary l some actions are not under the control of the problem-solver.
Mark Dunlop, Computer and Information Sciences, Strathclyde University 1 Algorithms & Complexity 5 Games Mark D Dunlop.
Adversarial Search Chapter 6 Section 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 6 –Adversarial Search Thursday –AIMA, Ch. 6 –More Adversarial Search The “Luke.
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
Artificial Intelligence Bodies of animals are nothing more than complex machines - Rene Descartes.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Introduction to Machine Learning Kamal Aboul-Hosn Cornell University Chess, Chinese Rooms, and Learning.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.
Backtracking and Games Eric Roberts CS 106B January 28, 2013.
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
DEEP RED An Intelligent Approach to Chinese Checkers.
Can you trust your senses?. WHAT DO YOU KNOW? AN INTRODUCTION TO SCEPTICISM.
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.
Definitions of AI There are as many definitions as there are practitioners. How would you define it? What is important for a system to be intelligent?
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.
Game tree search Thanks to Andrew Moore and Faheim Bacchus for slides!
Game tree search Chapter 6 (6.1 to 6.3 and 6.6) cover games. 6.6 covers state of the art game players in particular. 6.5 covers games that involve uncertainty.
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Philosophy 4610 Philosophy of Mind Week 1: Introduction.
Examining the Mechanisms of the Human Brain with Computer Science Arvind Ravichandran.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
ADVERSARIAL SEARCH Chapter 6 Section 1 – 4. OUTLINE Optimal decisions α-β pruning Imperfect, real-time decisions.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
1 Fahiem Bacchus, University of Toronto CSC384: Intro to Artificial Intelligence Game Tree Search I ● Readings ■ Chapter 6.1, 6.2, 6.3, 6.6 ● Announcements:
Uses and Limitations Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Overview of Artificial Intelligence (1) Artificial intelligence (AI) Computers with the ability to mimic or duplicate the functions of the human brain.
Artificial Intelligence AIMA §5: Adversarial Search
COMP3710 Artificial Intelligence Thompson Rivers University
David Kauchak CS52 – Spring 2016
ARTIFICIAL INTELLIGENCE.
Games & Adversarial Search
Adversarial Search.
COMP3710 Artificial Intelligence Thompson Rivers University
Mini-Max search Alpha-Beta pruning General concerns on games
Artificial Intelligence
Games & Adversarial Search
Minimax strategies, alpha beta pruning
Games & Adversarial Search
Presentation transcript:

Soccer n58http://youtube.com/watch?v=ICgL1OWs n58 -Ygohttp://youtube.com/watch?v=N8Q15Uc -Ygo Gl0http://youtube.com/watch?v=1JJsBFiX Gl0

CIS 197 Computers in Society Professor John Peterson

Quiz Recap How does IBM make money with free software? Contrast ODF and OOXML What’s a Turing machine? What is Lady Lovelace’s objection? How does it relate to the chess articles? Why doesn’t Dennett believe people will consider Deep Blue intelligent?

Slashdot Time Watch out for Chinese Hackers!

Reading Assignments For Thursday, the reading is from Wikipedia. It’s a little dense but make sure you get the basic ideas clear before class Thursday.

Poker Did the poker programmers need a special “super computer” to play a good game of poker? Why would poker be harder to play than chess? What is notable about the computer strategy in checkers? Why are researchers interested in poker? What poker game does Polaris play?

Poker What was the format of the tournament? What key aspect of poker was missing? What is a “bot”? What did the human players think of the computer opponent?

Soccer What sort of players did the CMU team field in robot soccer? What is the stated goal of the robot soccer movement? What is the biggest problem facing the robots? Can humanoid robots move with the same agility as humans? Should we fear a robot rebellion?

Artificial Intelligence What is it? What might it be? Drew McDermott

The Brain As a Computer The brain is made up of billions of neurons A neuron is a cell that can send signals to its neighbors The signals depend on inputs from its neighbors Ultimately, input from senses, output to muscles

What If Each Neuron Is Computing Something? Examples: Visual cortex: Some neurons match up images from left and right eyes and compute the disparities --- the differences in depth Hippocampus: In mice, some neurons become more active when mouse is in a particular place (computing degree of match)

Where is the Mind? Brai n Mind Do some neurons have “invisible inputs”? Is the brain nothing but a computer?

Cognitive Science An alliance of disciplines: psychology, philosophy, linguistics, neuroscience, computer science All dedicated to exploring computational models of mind* *Within each field, not everyone is a “computationalist” about mind --- yet.

AI Within CS, AI is the subdiscipline that attacks very hard problems using empirical methods. We try algorithms and see how they work. Alas, we have no general theory of intelligence. We have theories about language processing, speech recognition, game playing, plan creation and execution, robotics, vision, inference, ….

AI Is Not Psychology Computationalism in psychology is known as cognitive psychology. It differs from AI in that it is looking for verification that people’s brains actually compute what their models say they could compute. It’s less concerned with the details of the models. Experiments with people vs. experiments with computers.

Computer Vision How do you get from an image to recognition of an object or a person, or control of object manipulation? An image is an array of numbers (recording light levels). (Compare retinas.) Vision feels easy --- it’s not.

Place Recognition Where was this taken? Remember: We’re comparing arrays of numbers. No two images are exactly the same.

Solution: Adjust for light levels Adjust for scale (zoom) Find the point where the sum of differences of light levels is minimal; if low enough, report “I’ve been here before!”

Computer Chess The best programs can beat almost every human player They do it by searching through game trees

x x o o x x o ox x o o x x x x o o x x x o o xo o x x o o xo x x x o ox o x x o ox o x X X X O O Tic-tac-toe Game Tree

Minimax Algorithm Assign numbers to ending positions (“leaves” of the game tree): 1 if I (computer) win, -1 if I lose, 0 if draw For other nodes of tree, assign number of minimal child at opponent’s nodes, maximal child at my nodes Choose move with highest number

x x o o x x o ox x o o x x x x o o x x x o o xo o x x o o xo x x x o ox o x x o ox o x X X X O O Tic-tac-toe Game Tree 1

x x o o x x o ox x o o x x x x o o x x x o o xo o x x o o xo x x x o ox o x x o ox o x X X X O O 1 1

x x o o x x o ox x o o x x x x o o x x x o o xo o x x o o xo x x x o ox o x x o ox o x X X X O O

x x o o x x o ox x o o x x x x o o x x x o o xo o x x o o xo x x x o ox o x x o ox o x X X X O O

x x o o x x o ox x o o x x x x o o x x x o o xo o x x o o xo x x x o ox o x x o ox o x X X X O O Tic-tac-toe Game Tree

x x o o x x o ox x o o x x x x o o x x x o o xo o x x o o xo x x x o ox o x x o ox o x X X X O O Tic-tac-toe Game Tree

Big Amendment In real games, like chess, we can’t look all the way to the end of the game. So we cut the tree off after a few moves, and use a heuristic evaluation algorithm to estimate how good the position is based on board features (e.g., how many rows I have two of my marks in vs. how many such rows opponent has). Then apply minimax to pass numbers up.

Real Intelligence? Are all the separate subfields of AI going to achieve real computer intelligence? Right now, it depends on what the target turns out to be. People think their minds are single entities with general skills, but we’re discovering more and more specialized modules in the brain. Genius is rare and perhaps unpredictable

Computer Consciousness When they build an “artificial nose,” can it really experience the smell of garlic? Does it know what turpentine smells like? Would it have the same experiences we have? Answer: It wouldn’t experience anything!

But… When we know exactly how information flows through the brain, will we conclude that we can’t experience anything? Guess: Consciousness will turn out to be a matter of modeling oneself as having experiences.

The Self-Modeling Nose Suppose the nose is connected to a robot that can make inferences about what it thought it smelled and what was probably there. It must distinguish between appearance and reality. Appearance in this case is “the way things seem to smell.” At this point it’s helpful to have the concept of “odor”

Qualia We know what “red” looks like, and how it differs from “green.” But there’s nothing much else to say. The brain’s theory of itself stops with these ultimate qualia of things because it has to stop! Robots will have to do the same thing (although the details will differ a lot).

Don’t Get the Wrong Idea… Most AI people hate to talk about consciousness. It’s too fuzzy. This is not what the field is about. It’s about algorithms and experimentation.

Summary The brain computes things Perhaps that’s all it does Cognitive science explores this hypothesis AI is the branch that explores algorithms for difficult computational problems If cognitive science succeeds, it may even explain consciousness