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.

Slides:



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

Computational Intelligence: Some Insights from Board Games Fernand Gobet Brunel University.
The Game of Go Go is an ancient Chinese board game that is believed to be 2,000 to 4,000 years old. Anton Ninno, OCM-BOCES
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.
More info: Science & Technology interpreted through Engineering & the Arts, all understood with elements.
Introduction to Artificial Intelligence (40-417).
"Programming a Computer to Play Chess" A presentation of C. Shannon's 1950 paper by Andrew Oldag April
The Turk First chess playing machine, made in 1770.
Artificial Intelligence AI: The branch of computer science dedicated to the creation of machines that perform task which if done by humans would be considered.
The Implementation of Artificial Intelligence and Temporal Difference Learning Algorithms in a Computerized Chess Programme By James Mannion Computer Systems.
Artificial Intelligence for Games Game playing Patrick Olivier
Artificial Intelligence in Game Design Heuristics and Other Ideas in Board Games.
Games as a Test Bed for Developing AI Applications (in Physics) Brains vs Computers Symposium of the “van der Waals” study association December 10, 2013.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Adversarial Search Board games. Games 2 player zero-sum games Utility values at end of game – equal and opposite Games that are easy to represent Chess.
Mastering Chess An overview of common chess AI Adam Veres.
Go and Chess Made by icemilk. What is Go? (Weiqi 圍棋, Igo 囲碁, buduk 바둑 ) Go is the oldest board game. Go is a territorial game, where each player tries.
Use “Search” for Pathfinding FactorySchool Library Hospital Park Newsagent University church Example from Alison Cawsey’s book start finish.
Computer Simulation (2) Game Playing. Different Types of Games How many players? –One –Two Element of chance? –Deterministic –Nondeterministic Outcome.
Learning Shape in Computer Go David Silver. A brief introduction to Go Black and white take turns to place down stones Once played, a stone cannot move.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
1 Game Playing Chapter 6 (supplement) Various deterministic board games Additional references for the slides: Luger’s AI book (2005). Robert Wilensky’s.
1 Solving Ponnuki-Go on Small Board Paper: Solving Ponnuki-Go on small board Authors: Erik van der Werf, Jos Uiterwijk, Jaap van den Herik Presented by:
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.
Games & Adversarial Search Chapter 6 Section 1 – 4.
Computer Chess. Humble beginnings The Turk Ajeeb Mephisto El Ajedrecista.
The Game of Go Go is an ancient Chinese board game that is believed to be 2,000 to 4,000 years old. Anton Ninno, OCM-BOCES
Corea Japan China WeiqiGoBaduk. The Go is one of the oldest board game in the world. Its true origins are unknown, though it almost certainly originated.
Go – Presentation Outline Go. What is it –Equipment Go Skills Go History Players – Random Names and Faces Computers and Go, Internet The Rules of Go A.
Wei Qi, Baduk, Go a game of strategy
Artificial Intelligence in Game Design Problems and Goals.
Upper Confidence Trees for Game AI Chahine Koleejan.
Artificial Intelligence in Games CA107 Topics in Computing Dr. David Sinclair School of Computer Applications
By: Joe Merullo Julia Stone and Olivia Pollock. Who plays the game? The game is played by two players who alternately place black and white stones on.
Computer Go : A Go player Rohit Gurjar CS365 Project Proposal, IIT Kanpur Guided By – Prof. Amitabha Mukerjee.
Development of a Machine-Learning-Based AI For Go By Justin Park.
 Summary  How to Play Go  Project Details  Demo  Results  Conclusions.
Adversarial Search Chapter 6 Section 1 – 4. Outline Optimal decisions α-β pruning Imperfect, real-time decisions.
Game Playing. Towards Intelligence? Many researchers attacked “intelligent behavior” by looking to strategy games involving deep thought. Many researchers.
The Mind of the Machine: Artificial Intelligence? Paul Curzon Queen Mary, University of London Created by Peter McOwan and Paul Curzon of Queen Mary,
Machine Learning for an Artificial Intelligence Playing Tic-Tac-Toe Computer Systems Lab 2005 By Rachel Miller.
Introduction to Machine Learning Kamal Aboul-Hosn Cornell University Chess, Chinese Rooms, and Learning.
Backtracking and Games Eric Roberts CS 106B January 28, 2013.
Each piece is represented by a symbol. The pieces all stand in the same position at the start of the game the pieces are the Rook, the Knight, the Bishop,
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.
Parallelization in Computer Board Games Ian Princivalli.
Learning to Play the Game of GO Lei Li Computer Science Department May 3, 2007.
Artificial Intelligence
Pigeon Problems Revisited Pigeons (Columba livia) as Trainable Observers of Pathology and Radiology Breast Cancer Images.
Strategic Reasoning with Game Description Language Ji Ruan, Prof. W. van der Hoek, Prof. M. Wooldridge Department of Computer Science From Specific Game.
A Scalable Machine Learning Approach to Go Pierre Baldi and Lin Wu UC Irvine.
Applications of Machine Learning to the Game of Go David Stern Applied Games Group Microsoft Research Cambridge (working with Thore Graepel, Ralf Herbrich,
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
1 Evaluation Function for Computer Go. 2 Game Objective Surrounding most area on the boardSurrounding most area on the board.
AI: AlphaGo European champion : Fan Hui A feat previously thought to be at least a decade away!!!
Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.
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.
A Brief History of Computer Go Dr. Chun Sun (Microsoft Inc, Boston) For HXGNY GO EXPO, June 2013.
Understanding AlphaGo. Go Overview Originated in ancient China 2,500 years ago Two players game Goal - surround more territory than the opponent 19X19.
Next Level Tic-Tac-Toe
Domain of chess problem
Done Done Course Overview What is AI? What are the Major Challenges?
Videos NYT Video: DeepMind's alphaGo: Match 4 Summary: see 11 min.
CSC 110 – Fluency in Information Technology Chess
AlphaGo and learning methods
AlphaGO from Google DeepMind in 2016, beat human grandmasters
The intelligent piece of paper: so what is an algorithm?
Presentation transcript:

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 deep strategy. Hard for computers.

History Originated in ancient China ~2000BC. Spread to Korea and Japan, “Golden-Age” mid-19 th century. Spread to West late 19 th century. British Go Association founded "While the Baroque rules of Chess could only have been created by humans, the rules of Go are so elegant, organic, and rigorously logical that if intelligent life forms exist elsewhere in the universe, they almost certainly play Go." - Edward Lasker, Chess International Master and founder of American Go Association

Rules (Basics) Black and White take turns to place stones on the intersections of a 19x19 board. Stones are not moved, but can be captured by filling all their liberties.

Rules (Scoring) 1 point per territory, 1 point per capture. Player with most points at the end wins. White: 25Black: 24

Rules (Suicide) You are not allowed to commit suicide (play a stone with no liberties).

Two Eyes Live A group with 2 eyes can never be captured, it is “alive”.

Strategy Surrounding game: 圍棋 Go is a game of balance: 1.Territory vs. Thickness 2.Attack vs. Defence Unlike Chess which is mainly analytical, Go also uses intuition, a lot of pattern matching and heuristics.

Computer Go Go is challenging for Artificial Intelligence. In 1997 IBM’s Deep Blue defeated Chess World Champion Gary Kasparov. An intermediate amateur Go player can easily beat the best Go programs.

Why Is Go Hard? A large board and high branching factor give a vast game-tree complexity of about compared to chess’s Difficult evaluation function. Hard to emulate the heuristics and pattern matching of humans. Brute force is not enough, Moore’s law → next century.

Recent Advances Monte Carlo techniques: play out many games with a simple move selection algorithm to the end where the evaluation function is much easier. August 2008 defeated professional 8 dan Myungwan Kim with a 9 stone handicap. Running on 800 processors, 4.7 Ghz, 15 Teraflops supercomputer (1000x Deep Blue).

Example Game

More Information Cambridge Go Society: KGS Go Server: Sensei’s Library (Go wiki): Me