Lauren Argenio and Russell Braun

Slides:

Advertisements

Similar presentations

Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.

Advertisements

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.

Adversarial Search Reference: “Artificial Intelligence: A Modern Approach, 3 rd ed” (Russell and Norvig)

AI for Connect-4 (or other 2-player games) Minds and Machines.

Game Playing (Tic-Tac-Toe), ANDOR graph By Chinmaya, Hanoosh,Rajkumar.

PLANNING THE TIC TAC TOE GAME BY NEEL DAVE. TIC TAC TOE INSTRUCTIONS Tic Tac Toe Instructions The basic concept of Tic Tac Toe 1.This is a game for two.

Tic Tac Toe Architecture CSE 5290 – Artificial Intelligence 06/13/2011 Christopher Hepler.

Heidi Newton Peter Andreae Artificial Intelligence.

Adversarial Search: Game Playing Reading: Chapter next time.

Artificial Intelligence in Game Design

1 Introduction to Computability Theory Lecture11: Variants of Turing Machines Prof. Amos Israeli.

How Computers Play Chess Peter Barnum November 15, 2007 Artificial Intelligence 101.

November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.

1 Lecture 33 Introduction to Artificial Intelligence (AI) Overview  Lecture Objectives.  Introduction to AI.  The Turing Test for Intelligence.  Main.

General Computer Science for Engineers CISC 106 James Atlas Computer and Information Sciences 10/23/2009.

Monte Carlo Go Has a Way to Go Haruhiro Yoshimoto (*1) Kazuki Yoshizoe (*1) Tomoyuki Kaneko (*1) Akihiro Kishimoto (*2) Kenjiro Taura (*1) (*1)University.

Randomized Algorithms. Introduction Algorithm uses a random number to make at least one decision Running time depends on input and random numbers generated.

THE RENJU GAME BY ABHISHEK JAIN, PRANSHU GUPTA & RHYTHM DAS PCLUB SUMMER PROJECT PRESENTATION JUNE, L7 IIT KANPUR MENTOR – SANIL JAIN.

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.

PSU CS 370 – Introduction to Artificial Intelligence Game MinMax Alpha-Beta.

Minimax Trees: Utility Evaluation, Tree Evaluation, Pruning CPSC 315 – Programming Studio Spring 2008 Project 2, Lecture 2 Adapted from slides of Yoonsuck.

Data Structures - CSCI 102 Binary Tree In binary trees, each Node can point to two other Nodes and looks something like this: template class BTNode { public:

Lecture 5 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.

Agents that can play multi-player games. Recall: Single-player, fully-observable, deterministic game agents An agent that plays Peg Solitaire involves.

October 3, 2012Introduction to Artificial Intelligence Lecture 9: Two-Player Games 1 Iterative Deepening A* Algorithm A* has memory demands that increase.

Temperature Discovery Search Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature.

Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.

1 N -Queens via Relaxation Labeling Ilana Koreh ( ) Luba Rashkovsky ( )

SPHERES OF ARTIFICIAL INTELLIGENCE Gafur Djumaniyazov.

Machine Learning for an Artificial Intelligence Playing Tic-Tac-Toe Computer Systems Lab 2005 By Rachel Miller.

Computer Science: A Structured Programming Approach Using C Trees Trees are used extensively in computer science to represent algebraic formulas;

AI and Games by Lauren Argenio Russell Braun. Project Goals What AI is The basics of how it works How it is applied to games –In the past –Present –Future.

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.

Adversarial Search Chapter Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time limits.

Introduction to Game Theory Kamal Aboul-Hosn Cornell University Computers Playing Games.

ARTIFICIAL INTELLIGENCE (CS 461D) Princess Nora University Faculty of Computer & Information Systems.

Pigeon Problems Revisited Pigeons (Columba livia) as Trainable Observers of Pathology and Radiology Breast Cancer Images.

Flowcharts C++ Lab. Algorithm An informal definition of an algorithm is: a step-by-step method for solving a problem or doing a task. Input data A step-by-step.

ConvNets for Image Classification

Artificial Intelligence in Game Design Board Games and the MinMax Algorithm.

Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.

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 Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game Decisions in games Minimax algorithm  -  algorithm Tic-Tac-Toe game.

Artificial Intelligence AIMA §5: Adversarial Search

Adversarial Search and Game-Playing

Adversarial Environments/ Game Playing

Planning & System installation

Game Theory Just last week:

Iterative Deepening A*

PENGANTAR INTELIJENSIA BUATAN (64A614)

Pengantar Kecerdasan Buatan

CSC 110 – Fluency in Information Technology Chess

Dakota Ewigman Jacob Zimmermann

Game Playing in AI by: Gaurav Phapale 05 IT 6010

Artificial Intelligence

Computational Thinking

Tutorial 5 Adversary Search

Gravity Off Win by finding a threat sequence

Artificial Intelligence

CS 171 Discussion Session Week 3

The Friendship Algorithm

The Alpha-Beta Procedure

Introduction to Artificial Intelligence Lecture 9: Two-Player Games I

Search and Game Playing

Pruning 24-Feb-19.

Breakfast Bytes Easy, Hard, and Impossible

AI and Machine Learning

Computational Thinking

Homework 5 (June 14) Material covered: Slides

Unit II Game Playing.

Presentation transcript:

Lauren Argenio and Russell Braun A.I. and Games Lauren Argenio and Russell Braun

Do we even know what thinking is? Turing Test Can machines think? How can we tell? Do we even know what thinking is? Uh oh…

Humans are the best judges of intelligence so… Turing Test Solution: Humans are the best judges of intelligence so… If a computer can convince a human that it is intelligent, then it must be doing something close to “thinking.”

Turing Test

Algorithms An algorithm is a sequence of -Finite -Well-defined instructions for completing a task.

Branch

Loop

Search trees

Search trees

Search trees

Search trees Branch Node Leaf node

Search trees

Search tree used in games Branch Node Leaf node

Search tree used in games

MinMax -2 very good for the OTHER player +2 very good +1, pretty good, but risky

MinMax

MinMax

Project progress Learned how search trees are applied to games Sorting algorithms Search algorithms

Program example Whose turn is it? Computer chooses random move out of the remaining ones available Player Computer Player makes a move Computer makes move Update board Has somebody won? No Yes Congratulate winner

Program example Computer calculates all remaining possible moves Whose turn is it? Player Computer gives a value to each move Computer Computer chooses the set of moves that let it win with the biggest advantage (highest number) Player makes a move Computer makes move Update board Has somebody won? No Yes Congratulate winner

Quiz slide 1. What is the purpose of the Turing test? 2. Describe a possible situation that could be represented by a search tree. 3. Explain how AIs compensate for lack of intuition with greater speed and processing power. 4. What does a leaf node represent in the search tree for a game.

references Wikipedia Google Image Search Shoman, Yoav. "Computer Science and Game Theory." www.acm.org. Association for Computing Machienery. 04 Feb. 2009 <http://www.acm.org/>. http://www.ocf.berkeley.edu/~yosenl/extras/alphabeta/alphabeta.html http://ai-depot.com/articles/minimax-explained/