We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byFrancis Patterson
Modified about 1 year ago
Heidi Newton Peter Andreae Artificial Intelligence
© Peter Andreae Overview Talk about three of the topics from the online book AI with language: Chatterbots AI for selling stuff: Association rules AI for games: Basic game search 2
© Peter Andreae AI with language Using language is one of the distinguishing features of human intelligence. Making computers use language well is hard! We have not solved this problem yet Would it be useful to have computers that could use human language? Where? 3
© Peter Andreae Chatterbots What are they? general vs domain specific fixed vs learning Let’s try some: Eliza: http://nlp-addiction.com/eliza/ ALICE: http://www.pandorabots.com/pandora/talk?botid=f5d922d97e345aa1 Cleverbot: http://www.cleverbot.com/ Work in pairs, chat with them, try at least two bots 4
© Peter Andreae Chatterbots Which was best? Were they any good? How could you tell it wasn’t a person? What were its limitations? 5
© Peter Andreae Turing Test Turing test: the most famous test for successful artificial intelligence Based on computers using language A Human and a Computer, each try to convince a judge that they are the human, communicating only over a typed chat session If the judge is fooled, then the computer must be intelligent. Book describes an activity for students to run a Turing test using one of the chatterbots (not time for us to do it here) 6
© Peter Andreae 2. Association Rules What does Amazon (and many online retailers) do when you click on an item? How do supermarkets decide where to place items? Note: Recommender Systems are closely related. 7
© Peter Andreae Association Rule Learning Machine learning algorithms look for patterns in purchasing data. If 30% of the people who buy an LED torch also buy rechargable batteries, then Whenever a person selects an LED torch, suggest that they might want to buy rechargable batteries. Should you recommend torches if they buy batteries? If 20% of people who buy corn chips also buy salsa dip, then put salsa dip on a shelf near the corn chips to increase sales If 80% of the people who buy milk also buy bread, then put them on opposite sides of the store to make people pass by as many other shelves as possible 8
© Peter Andreae Association Rule Learning How do you find the associations? How do you tell if they are “strong enough” We are planning an activity for the book involving searching for associations in supermarket reciepts 9
© Peter Andreae 3. AI for games Lots of different applications of AI in games Games were part of AI research from the beginning Modern computer games need even more AI. Min-Max search is a basic AI game playing strategy Applicable to 2-person board games Fundamental to the AI chess playing systems (eg Deep Blue) Paper and pencil activities to explore this. 10
© Peter Andreae Min Max search for O’s & X’s Suppose it is O’s turn and the board looks like this What should O do? 11
© Peter Andreae O’s choices X’s Choices win lose win It’s O’s turn: what should O do? Search forwards to explore all the options
© Peter Andreae O’s choice X’s Choice It’s O’s turn: what should O do? Work backwards to determine status of earlier positions X will try to make O lose
© Peter Andreae O’s choices O’s choice X’s Choice It’s O’s turn: what should O do? Work backwards to determine status of earlier positions O will try to win
© Peter Andreae O’s choice X’s Choices It’s O’s turn: what should O do? Work backwards to determine status of earlier positions X will try to make O lose
© Peter Andreae O’s choice It’s O’s turn: what should O do? Work backwards to determine status of earlier positions O will try to win
© Peter Andreae More Min Max Search What happens if you can’t search all the way to the end? Have to stop and measure how good the board looks. Eg, a piece count Work backwards with the minimum score (for opponent’s turn) maximum score (for player’s turn)
© Peter Andreae Black’s turn 0 advantage +1 +2
© Peter Andreae Black’s turn 0 advantage +1 +2 0
School of Engineering and Computer Science Victoria University of Wellington Copyright: Peter Andreae, VUW AI for games: min-max search COMP #
What is Intelligence? Exploring Computer Science – Lesson 1-8.
AI for Connect-4 (or other 2-player games) Minds and Machines.
Adversarial Search We have experience in search where we assume that we are the only intelligent being and we have explicit control over the “world”. Lets.
DEEP RED An Intelligent Approach to Chinese Checkers.
Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.
The Development of AI St Kentigerns Academy Unit 3 – Artificial Intelligence.
A My Name is Alice We will look at this book as writers, thinking about how the author put it together. What are some things that make this book fun to.
Minimax Trees: Utility Evaluation, Tree Evaluation, Pruning CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 2 Adapted from slides of Yoonsuck.
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
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.
CLASS 9. COGNITIVE PSYCHOLOGY COMPUTER METAPHOR Computer metaphor: thinking is simply the processing of information =
ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.
Artificial Intelligence Bodies of animals are nothing more than complex machines - Rene Descartes.
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.
Shallow Blue Project 2 Due date: April 5 th. Introduction Second in series of three projects This project focuses on getting AI opponent Subsequent project.
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
CPSC 322 Introduction to Artificial Intelligence October 25, 2004.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ? making computers that think? the automation of activities we associate.
AI CSC361: Game Playing1 Game Playing CSC361. AI CSC361: Game Playing2 Game Playing Why is game playing of interest to AI? How are two player games different.
Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)
CSCI 4310 Lecture 6: Adversarial Tree Search. Book Winston Chapter 6.
CIS 310: Visual Programming, Spring 2006 Western State College 310: Visual Programming Othello.
Business Development Services 1 What’s your pricing strategy? Session 6.
Artificial Intelligence in Game Design Heuristics and Other Ideas in Board Games.
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.
Learning Othello The quest for general strategy building.
CS 4700: Foundations of Artificial Intelligence Bart Selman Reinforcement Learning R&N – Chapter 21 Note: in the next two parts of RL, some of the figure/section.
The Mind of the Machine: Artificial Intelligence? Paul Curzon Queen Mary, University of London Created by Peter McOwan and Paul Curzon of Queen Mary,
Welcome to... A Game of X’s and O’s
Development of a Machine-Learning-Based AI For Go By Justin Park.
Adversarial Search: Game Playing Reading: Chess paper.
Online Chess Project 3 Due date: April 17 th. Introduction Third in series of three projects This project focuses on adding online support –2 players.
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.
What is AI An attempt to imitate human reactions by scripting reactions to happen when a certain cause is brought about.
Game-playing AIs Part 1 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part I (this set of slides) Motivation Game Trees Evaluation.
BE SAFE ONLINE I pads, computer, video games BE SAFE. Because you don’t know who your talking to!?
School of Engineering and Computer Science Victoria University of Wellington Copyright: Peter Andreae, VUW IRC, parsing, protocols COMP # 25.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
Every chess master was once a beginner. Irving Chernev.
University College Cork (Ireland) Department of Civil and Environmental Engineering Course: Engineering Artificial Intelligence Dr. Radu Marinescu Lecture.
Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.
1 search CS 331/531 Dr M M Awais A* Examples:. 2 search CS 331/531 Dr M M Awais 8-Puzzle f(N) = g(N) + h(N)
Investigation #1 Factors and Products. 1.1 Playing the Factor Game.
More on Logic Today we look at the for loop and then put all of this together to look at some more complex forms of logic that a program will need The.
How to Play Chess By: John. Dedication I dedicate this project to my family because we all love chess.
Artificial Intelligence and Searching CPSC 315 – Programming Studio Spring 2013 Project 2, Lecture 1 Adapted from slides of Yoonsuck Choe.
Games with Chance Other Search Algorithms CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 3 Adapted from slides of Yoonsuck Choe.
CompSci Recursion & Minimax Playing Against the Computer Recursion & the Minimax Algorithm Key to Acing Computer Science If you understand everything,
© 2017 SlidePlayer.com Inc. All rights reserved.