Games, computers, and artificial intelligence NDHU CSIE AI Lab 羅仲耘.

Slides:



Advertisements
Similar presentations
Game Playing CS 63 Chapter 6
Advertisements

Institute for Knowledge and Agent Technology 1 Entertainment and Computer Games Universiteit Maastricht / IKAT
February 7, 2006AI: Chapter 6: Adversarial Search1 Artificial Intelligence Chapter 6: Adversarial Search Michael Scherger Department of Computer Science.
For Monday Read chapter 7, sections 1-4 Homework: –Chapter 4, exercise 1 –Chapter 5, exercise 9.
1 CSC 550: Introduction to Artificial Intelligence Fall 2008 search in game playing  zero-sum games  game trees, minimax principle  alpha-beta pruning.
CS 484 – Artificial Intelligence
COMP-4640: Intelligent & Interactive Systems Game Playing A game can be formally defined as a search problem with: -An initial state -a set of operators.
Class Project Due at end of finals week Essentially anything you want, so long as it’s AI related and I approve Any programming language you want In pairs.
Adversarial Search CSE 473 University of Washington.
Games solved:Now and in the future H.jaap van den Herik, Jos W.H.M. Uiterwijk, Jack van Rijswijck Summarized by Seung-joon Yi.
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.
An Introduction to Artificial Intelligence Lecture VI: Adversarial Search (Games) Ramin Halavati In which we examine problems.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
CS10 : The Beauty and Joy of Computing Lecture #14 : Computational Game Theory A 19-year project led by Prof Jonathan Schaeffer, he used dozens.
Poker for Fun and Profit (and intellectual challenge) Robert Holte Computing Science Dept. University of Alberta.
CSE 471/598 Intro to AI (Lecture 1). Course Overview What is AI –Intelligent Agents Search (Problem Solving Agents) –Single agent search [Project 1]
CS10 The Beauty and Joy of Computing Lecture #22 : Computational Game Theory A 19-year project led by Prof Jonathan Schaeffer, he used dozens.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6: Adversarial Search Fall 2008 Marco Valtorta.
Computers Playing Games Arif Zaman CS 101. Acknowledgements Portions of this are taken from MIT’s open-courseware
Artificial Intelligence and Searching CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 1 Adapted from slides of Yoonsuck Choe.
How computers play games with you CS161, Spring ‘03 Nathan Sturtevant.
Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker * Andrew Gilpin and Tuomas Sandholm, CMU,
Adversarial Search: Game Playing Reading: Chess paper.
Reinforcement Learning in the Presence of Hidden States Andrew Howard Andrew Arnold {ah679
Game Playing State-of-the-Art  Checkers: Chinook ended 40-year-reign of human world champion Marion Tinsley in Used an endgame database defining.
Dynamic Difficulty Adjustment for a Novel Board Game Presented by: Pier P. Guillen EE 570 – Artificial Intelligence December 7 th, 2010.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
PSU CS 370 – Introduction to Artificial Intelligence Game MinMax Alpha-Beta.
Survey of AI for games. AI vs. AI for games Traditional AI: – Made to handle unseen inputs, large state space – Too many options possible to compute an.
1 Computer Group Engineering Department University of Science and Culture S. H. Davarpanah
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 6 –Adversarial Search Thursday –AIMA, Ch. 6 –More Adversarial Search The “Luke.
Computing & Information Sciences Kansas State University Lecture 9 of 42 CIS 530 / 730 Artificial Intelligence Lecture 9 of 42 William H. Hsu Department.
Instructor: Vincent Conitzer
Memory and Analogy in Game-Playing Agents Jonathan Rubin & Ian Watson University of Auckland Game AI Group
Adversarial Search Chapter 6 Section 1 – 4. Search in an Adversarial Environment Iterative deepening and A* useful for single-agent search problems What.
CHAPTER 4 PROBABILITY THEORY SEARCH FOR GAMES. Representing Knowledge.
The challenge of poker NDHU CSIE AI Lab 羅仲耘. 2004/11/04the challenge of poker2 Outline Introduction Texas Hold’em rules Poki’s architecture Betting Strategy.
Poker as a Testbed for Machine Intelligence Research By Darse Billings, Dennis Papp, Jonathan Schaeffer, Duane Szafron Presented By:- Debraj Manna Gada.
Jack Chen TJHSST Computer Systems Lab Abstract The purpose of this project is to explore Artificial Intelligence techniques in the board game.
Applied machine learning in game theory Dmitrijs Rutko Faculty of Computing University of Latvia Joint Estonian-Latvian Theory Days at Rakari, 2010.
Neural Network Implementation of Poker AI
Carla P. Gomes CS4700 CS 4701: Practicum in Artificial Intelligence Carla P. Gomes
DEEP RED An Intelligent Approach to Chinese Checkers.
Artificial Intelligence and Searching CPSC 315 – Programming Studio Spring 2013 Project 2, Lecture 1 Adapted from slides of Yoonsuck Choe.
Artificial Intelligence in Games
Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri CS 440 / ECE 448 Introduction to Artificial Intelligence.
Paula Matuszek, CSC 8520, Fall Based in part on aima.eecs.berkeley.edu/slides-ppt 1 CS 8520: Artificial Intelligence Adversarial Search Paula Matuszek.
Learning to Play the Game of GO Lei Li Computer Science Department May 3, 2007.
Artificial Intelligence
For Monday Read chapter 7, sections 1-4 Homework: –Chapter 4, exercise 1 –Chapter 5, exercise 9.
Spring, 2005 CSE391 – Lecture 1 1 Introduction to Artificial Intelligence Martha Palmer CSE391 Spring, 2005.
Computers and Games Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi Reijer Grimbergen (Saga University) Jeff Rollason (Oxford.
CS 188: Artificial Intelligence Spring 2006 Lecture 23: Games 4/18/2006 Dan Klein – UC Berkeley.
CS 188: Artificial Intelligence Fall 2006 Lecture 7: Adversarial Search 9/19/2006 Dan Klein – UC Berkeley Many slides over the course adapted from either.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 5 Adversarial Search (Thanks Meinolf Sellman!)
1 Chapter 6 Game Playing. 2 Chapter 6 Contents l Game Trees l Assumptions l Static evaluation functions l Searching game trees l Minimax l Bounded lookahead.
Artificial Intelligence AIMA §5: Adversarial Search
Instructor: Vincent Conitzer
Stochastic tree search and stochastic games
4. Games and adversarial search
Strategies for Poker AI player
Artificial Intelligence and Searching
Instructor: Vincent Conitzer
Instructor: Vincent Conitzer
Mini-Max search Alpha-Beta pruning General concerns on games
Adversarial Search CMPT 420 / CMPG 720.
Artificial Intelligence and Searching
Artificial Intelligence and Searching
Presentation transcript:

Games, computers, and artificial intelligence NDHU CSIE AI Lab 羅仲耘

2004/10/07Games, computers, and artificial intelligence2 Outline Games types –Puzzles –Two-player perfect-information games –Imperfect-information and stochastic games New frontiers Predicted program strengths Poker Future works References

2004/10/07Games, computers, and artificial intelligence3 Puzzles 24-puzzles –Search-space size from O(10 25 ) to O(10 12 ) Crossword puzzles –Without understanding the semantics of the puzzles’ clues. Other Interesting puzzles –Rubik’s Cube and Sokoban.

2004/10/07Games, computers, and artificial intelligence4 Two-player perfect- information games Chess –Deep blue Othello –LOGISTELLO –Improving heuristic mini-max search by supervised learning Hex –Hexy –Theorem-prover-like search

2004/10/07Games, computers, and artificial intelligence5 Two-player perfect- information games (cont’) Shogi –Have a long way to go Go –Still a weak player Others –Draughts(10x10 checker) –Lines of Action –Amazons –Octi

2004/10/07Games, computers, and artificial intelligence6 Two-player perfect- information games (cont’)

2004/10/07Games, computers, and artificial intelligence7

2004/10/07Games, computers, and artificial intelligence8 Imperfect-information and stochastic games Information is hidden. Backgammon Poker Scrabble

2004/10/07Games, computers, and artificial intelligence9 New frontiers Any topic in interactive games –Action games –RPG –Adventure games –Strategy games –“God” games –Sport games Not only Graphics but also AI !

2004/10/07Games, computers, and artificial intelligence10 Predicted program strengths

2004/10/07Games, computers, and artificial intelligence11 Poker Has a number of attributes that make it an interesting domain for AI research. –Incomplete knowledge –Multiple competing agents –Risk management –Opponent modeling –Deception –Dealing with unreliable information

2004/10/07Games, computers, and artificial intelligence12 Future works Study more references in these papers. Study related mathematics (e.g. probability)

2004/10/07Games, computers, and artificial intelligence13 References Games, computers and artificial intelligence / Jonathan Schaeffer, H. Jaap van den Herik The challenge of Poker / Darse Billings, Aaron Davidson, Jonathan Schaeffer, Duane Szafron Games solved: Now and in the future / H. Jaap van den Herik, Jos W.H.M. Uiterwijk, Jack van Rijswijck All from Artificial Intelligence 134 (2002)

2004/10/07Games, computers, and artificial intelligence14 Thanks for your attention!