The intelligent piece of paper: so what is an algorithm?

Slides:

Advertisements

Similar presentations

The Development of AI St Kentigerns Academy Unit 3 – Artificial Intelligence.

Advertisements

Adversarial Search Chapter 6 Sections 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.

Computational Intelligence: Some Insights from Board Games Fernand Gobet Brunel University.

Artificial Intelligence By: David Hunt Lee Evans Jonathan Moreton Rachel Moss.

Spit-not-so Prof Paul Curzon Queen Mary University of London With support from Google, D of E.

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

Artificial Intelligence 0. Course Overview Course V231 Department of Computing Imperial College, London © Simon Colton.

Adversarial Search Chapter 5.

The Turk First chess playing machine, made in 1770.

The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Programme By James Mannion Computer Systems.

1 Adversarial Search Chapter 6 Section 1 – 4 The Master vs Machine: A Video.

Mastering Chess An overview of common chess AI Adam Veres.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.

Artificial Intelligence  What is AI?  The study of computations that make it possible to PERCEIVE, REASON, and ACT  Computing, perceiving, reasoning,

Dr Rong Qu Module Introduction.

CPSC 171 Artificial Intelligence Read Chapter 14.

Computer Science 1000 Introduction. What is Computer Science? the study of computers? not quite rather, computers provide a tool for which to carry out.

ARTIFICIAL INTELLIGENCE Introduction: Chapter 1. Outline Course overview What is AI? A brief history The state of the art.

Go An ancient Oriental board game Andrew Simons. Introduction 2 player game of skill. Popular in the Far East, growing in the West. Simple rules, extremely.

REU 2008-Building the First USF Small Size Robot Team Christopher HobbsMentor: Dr. Alfredo Weitzenfeld Department of Computer Science & Engineering Abstract.

Introduction: Chapter 1

THE HISTORY OF NATURAL LANGUAGE PROCESSING (NLP) By: Ryan Lichtig.

Soda Constructor: Exploring the laws of Physics with Computational Thinking Paul Curzon Queen Mary University of London

CSC4444: Artificial Intelligence Fall 2011 Dr. Jianhua Chen Slides adapted from those on the textbook website.

Adversarial Search Chapter 6 Section 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.

The Mind of the Machine: Artificial Intelligence? Paul Curzon Queen Mary, University of London Created by Peter McOwan and Paul Curzon of Queen Mary,

LOG ONTO YOUR COMPUTER USE THE FOLLOWING LOGON IF YOURS DOES NOT WORK: USERNAME: PASSWORD: GO TO:

Make-a-face Prof Paul Curzon Queen Mary, University of London With support from Google, D of.

Scratch an overview for teachers by W Hamilton. What is Scratch? Software designed to inspire children to learn how to program Multimedia focus It is.

Hexahexaflexagon Automata Paul Curzon Queen Mary University of London With support from Google,

Explorers need maps: Abstraction, representations and graphs Paul Curzon Queen Mary University of London

The Imp Computer Prof Paul Curzon Queen Mary, University of London With support from Google,

Change Blindness Presentation: Paul Curzon Change Blindness: Milan Verma & Peter McOwan, Queen.

Artificial Intelligence

Computational Thinking Activities The Magic of Computer Science

Strategic Reasoning with Game Description Language Ji Ruan, Prof. W. van der Hoek, Prof. M. Wooldridge Department of Computer Science From Specific Game.

Artificial Intelligence ( AI ) Ahmed Ismail AIT 600 Spring 08.

Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)

Progression in KS3/4 Algorithms MONDAY 30 TH NOVEMBER SUE SENTANCE.

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

Box Variables Prof Paul Curzon Queen Mary, University of London With support from Google, D of.

Adversarial Search Chapter 5 Sections 1 – 4. AI & Expert Systems© Dr. Khalid Kaabneh, AAU Outline Optimal decisions α-β pruning Imperfect, real-time decisions.

ADVERSARIAL SEARCH Chapter 6 Section 1 – 4. OUTLINE Optimal decisions α-β pruning Imperfect, real-time decisions.

Forces and Magnets – Block 3FM

Game Playing Why do AI researchers study game playing?

Media Skunk Works Ltd. IT Centre, Innovation Way, York Science Park

Active Lesson Ideas David Fourie – Tanglin Trust School.

By James Mannion Computer Systems Lab Period 3

COMP3710 Artificial Intelligence Thompson Rivers University

Done Done Course Overview What is AI? What are the Major Challenges?

Videos NYT Video: DeepMind's alphaGo: Match 4 Summary: see 11 min.

Punch Card Sorting: Binary Radix Sort

Adversarial Search Chapter 5.

Teaching KS3 Computing Session 4 Theory: Boolean logic AND/OR/NOT

Bubble Sort Paul Curzon

Mergesort: The power of divide and conquer

Adversarial Search.

Bakuro: Binary Logical Thinking Puzzles

"שינוק", אלוף העולם בדמקה לאדם ולמכונה זיו בן-אליהו

The SwapPuzzle So what is an algorithm?

Teaching KS3 Computing Session 4 Theory: Boolean logic AND/OR/NOT

Sodarace: Exploring Evolution with Computational Thinking

Queen Mary University of London

At least two sprites moving on the stage.

Computing session 3.

SAMPLE MAN AND MACHINE AISSQ-2012:001 INTRODUCTION ABSTRACT

COMP3710 Artificial Intelligence Thompson Rivers University

Ch. 5 – Adversarial Search

Adversarial Search Chapter 6 Section 1 – 4.

Presentation transcript:

The intelligent piece of paper: so what is an algorithm? Prof Paul Curzon Queen Mary, University of London With support from Google, D of E and the Mayor of London www.teachinglondoncomputing.org Twitter: @TeachingLDNComp

Aims Give you deeper understanding of core topics What is an algorithm Computational thinking in the context of Artificial intelligence Give you practical ways to teach computing in a fun, thought provoking way away from computers, focus on concepts Linked activity sheets and booklets can be downloaded from our website: www.teachinglondoncomputing.org

Artificial Intelligence? What do we mean by Artificial Intelligence? Computing is about making intelligent machines How is it done?…with algorithms What do we mean by human intelligence? If we identify abilities in humans as intelligent, we can then build machines to have these abilities. 1

I have a piece of paper that is more intelligent than anyone in this room!

Perfect Instructions? I am X… and I go first… Move 1: Go in a corner. IF the other player did not go there THEN go in the opposite corner to your move 1. ELSE go in a free corner. …

Algorithm beats humans at their own game 1997, IBM's Deep Blue Supercomputer beat reigning World Chess Champion, Garry Kasparov …Following an algorithm …brute force searching "I'm not afraid to admit that I'm afraid,” -Kasparov

1 Algorithms Algorithms are: sequences of steps to be followed in a given order that achieve some desired effect Everything computers do involves following algorithms written by humans They give computers the power to be ‘intelligent’.

Computational Thinking Lessons Algorithmic thinking Logical Thinking Abstraction

Summary Algorithms and algorithmic thinking can be introduced in lots of fun ways Away from computers! with simple games like noughts and crosses magic puzzles

Twitter: @TeachingLDNComp More support On our website to support this session: Activity sheets Story sheets Slides Details of more worskshops/courses free unplugged sessions subsidised courses (e.g. GCSE programming) www.teachinglondoncomputing.org Twitter: @TeachingLDNComp

Together we are Teaching London Computing Thank you! www.teachinglondoncomputing.org Twitter: @TeachingLDNComp