Go Meeting Talk1 Generation of Patterns with External Conditions for the Game of Go Paper presentation

Slides:



Advertisements
Similar presentations
A Memory-optimized Bloom Filter using An Additional Hashing Function Author: Mahmood Ahmadi, Stephan Wong Publisher: IEEE GLOBECOM 2008 Presenter: Yu-Ping.
Advertisements

Iris Recognition Under Various Degradation Models Hans Christian Sagbakken.
Template for CENG 421/ELEC536 assignments Author.
A Memory Efficient Retrograde Algorithm and Its Application To Chinese Chess Endgames  Reference : MSRI Publications Volume 42, 2002  Writer : Ren Wu.
Transposition Tables Jos Uiterwijk May 3, Transpositions A transposition is the re-occurrence of a position in a search process. For example, in.
Abstract Proof Search Studied by Tristan Cazenave Surveyed by Akihiro Kishimoto.
1 A Library of Eyes in Go Author: Thomas Wolf, Matthew Pratola Dept of Mathematics Brock University Presented by: Xiaozhen Niu.
Search for Transitive Connections Ling Zhao University of Alberta October 27, 2003 Author: T. Cazenave and B. Helmstetter published in JCIS'03.
Encoding images Skills: none IT concepts: an image representation code, the number of bits in a code, the amount of information in an image This work is.
The Move Decision Strategy of Indigo Author: Bruno Bouzy Presented by: Ling Zhao University of Alberta March 7, 2007.
Combining Tactical Search and Monte-Carlo in the Game of Go Presenter: Ling Zhao University of Alberta November 1, 2005 by Tristan Cazenave & Bernard Helmstetter.
Classifying Motion Picture Audio Eirik Gustavsen
Strategies Based On Threats Ling Zhao University of Alberta March 10, 2003 Comparative evaluation of strategies based on the values of direct threats by.
Generalized Threats Search Paper Review Paper Author: T. Cazenave Review by: A. Botea.
Worst-Case TCAM Rule Expansion Ori Rottenstreich (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel)
Metarules To Improve Tactical Go Knowledge By Tristan Cazenave Presented by Leaf Wednesday, April 28 th, 2004.
An Adversarial Planning Approach to Go Paper Authors: S. Willmott, J. Richardson, A. Bundy, J. Levine Presentation Author: A. Botea.
1 An Improved Safety Solver for Computer Go Presented by: Xiaozhen Niu Date: 2004/02/24.
A TABU SEARCH APPROACH TO POLYGONAL APPROXIMATION OF DIGITAL CURVES.
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:
Multipurpose Strategic Planning In the Game of Go Paper presentation Authors: Shui Hu and Paul E. Lehner Presentation by: Adi Botea.
HybridCuts: A Scheme Combining Decomposition and Cutting for Packet Classification Wenjun Li Xianfeng Li School of Electronic and Computer Engineering.
1 Recognizing safe territories Presented by: Xiaozhen Niu Date: 2003/09/22.
1 An Open Boundary Safety-of- Territory Solver for the Game of Go Author: Xiaozhen Niu, Martin Mueller Dept of Computing Science University of Alberta.
Optimizing a Chess Heuristic Using Evolutionary Algorithms Benjamin Rhew
1 An Efficient Algorithm for Eyespace Classification in Go Author: Peter Drake, Niku Schreiner Brett Tomlin, Loring Veenstra Presented by: Xiaozhen Niu.
RECURSIVE PATTERNS WRITE A START VALUE… THEN WRITE THE PATTERN USING THE WORDS NOW AND NEXT: NEXT = NOW _________.
Crowdsourcing Game Development for Collecting Benchmark Data of Facial Expression Recognition Systems Department of Information and Learning Technology.
CISC 235: Topic 6 Game Trees.
1 An Efficient Classification Approach Based on Grid Code Transformation and Mask-Matching Method Presenter: Yo-Ping Huang Tatung University.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Human eye sclera detection and tracking using a modified.
1 SOC Test Architecture Optimization for Signal Integrity Faults on Core-External Interconnects Qiang Xu and Yubin Zhang Krishnendu Chakrabarty The Chinese.
Loading a Cache with Query Results Laura Haas, IBM Almaden Donald Kossmann, Univ. Passau Ioana Ursu, IBM Almaden.
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.
Creating With Code.
Information Visualization DH /02/21 Proposal for Project 1 Title Cool Photo of Student 1 Student 1 Cool Photo of Student 2 Student.
A Memory-efficient Huffman Decoding Algorithm
Cost-Optimal Symbolic Pattern Database Planning with State Trajectory and Preference Constraints Stefan Edelkamp University of Dortmund.
TaintScope Presented by: Hector M Lugo-Cordero, MS CAP 6135 April 12, 2011.
A New Approach to Image Authentication Using Chaotic Map and Sudoku Puzzle 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia.
Advisor : Ku-Yaw Chang Student : Wei-Lu Lin
Cube Kohonen Self-Organizing Map (CKSOM) Model
Intelligent Database Systems Lab Presenter: Wu, Jhen-Wei Authors: Fabian Bürger, Josef Pauli ICPRAM. Representation Optimization with Feature Selection.
Outline Intro to Representation and Heuristic Search Machine Learning (Clustering) and My Research.
Intelligent Database Systems Lab Presenter : Chang,Chun-Chih Authors : CHRISTOS BOURAS, VASSILIS TSOGKAS 2012, KBS A clustering technique for news articles.
FPL Sept. 2, 2003 Software Decelerators Eric Keller, Gordon Brebner and Phil James-Roxby Xilinx Research Labs.
Intelligent Database Systems Lab Presenter : Kung, Chien-Hao Authors : Eghbal G. Mansoori 2011,IEEE FRBC: A Fuzzy Rule-Based Clustering Algorithm.
Implementation of a Relational Database as an Aid to Automatic Target Recognition Christopher C. Frost Computer Science Mentor: Steven Vanstone.
School Improvement Specialist Meeting April 4, 2012.
Hanyang University Hyunok Oh Energy Optimal Bit Encoding for Flash Memory.
Integer Exponents. Warm Up Find Each Product or Quotient x x ÷ ÷ x x
Magazine Collage Search, Cut, Arrange, Paste. There are many different approaches to creating a magazine collage. You can draw and color a background.
Bell Work3/10/2015 Simplify. Chapter 7 Exponents and Polynomials Next Chapter.
COE-571 Digital System Testing A Pattern Ordering Algorithm for Reducing the Size of Fault Dictionaries Authors: P. Bernardi, M. Grosso, M. Rebaudengo,
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.
Conflict Resolution of Chinese Chess Endgame Knowledge Base Bo-Nian Chen, Pangfang Liu, Shun-Chin Hsu, Tsan-sheng Hsu.
Everything is a number Everything in a computer memory and on storages is a number. Number  Number Characters  Number by ASCII code Sounds  Number.
L. Benini, G. DeMicheli Stanford University, USA A. Macii, E. Macii, M
Lossy Compression of DNA Microarray Images
Department of Electrical & Computer Engineering
TITLE Authors Institution RESULTS INTRODUCTION CONCLUSION AIMS METHODS
Topic 12 Patterns and Relationships Lessons 12-1 thru 12-3
Topic 1: Data Representation
Efficient Huffman Decoding
一種兼顧影像壓縮與資訊隱藏之技術 張 真 誠 國立中正大學資訊工程學系 講座教授
Title Introduction: Discussion & Conclusion: Methods & Results:
Unit 10 Review Around the World.
PN, PN2 and PN* in Lines of Action
Building pattern  Complete the following tables and write the rule 
Presentation transcript:

Go Meeting Talk1 Generation of Patterns with External Conditions for the Game of Go Paper presentation Author: Tristan Cazenave Presentation by: Adi Botea

Go Meeting Talk2 Outline Motivation Go Patterns with External Conditions –What they are –Representation –Generation Experimental Results Conclusion

Go Meeting Talk3 Motivation Heuristic Search needs enhancements (e.g., transposition tables) Go Patterns can be a powerful enhancement to Heuristic Search Humans can learn from such databases

Go Meeting Talk4 Go Patterns with External Conditions Images reproduced from the paper

Go Meeting Talk5 Go Patterns with External Conditions Images reproduced from the paper

Go Meeting Talk6 Go Patterns with External Conditions Images reproduced from the paper

Go Meeting Talk7 Go Patterns with External Conditions External Conditions: –It is the number of external liberties of groups that matters –Used in many Go programs BUT… –Now they are generated automatically

Go Meeting Talk8 Go Patterns with External Conditions Image reproduced from the paper

Go Meeting Talk9 Representation MaxNrLibertyIfEnemy: no conditions, 0, 1 MinNrLibertyIfFriend:no conditions, 1, 2 MaxNrLiberty:no conditions, 0, 1 MinNrLiberty:no conditions, 1, 2 9x9x3x3 = 729 rules Image reproduced from the paper

Go Meeting Talk10 Representation Moves for White: Images reproduced from the paper

Go Meeting Talk11 Included Patterns Images reproduced from the paper

Go Meeting Talk12 Included Patterns Images reproduced from the paper

Go Meeting Talk13 Number of Possible Patterns Image reproduced from the paper

Go Meeting Talk14 Generation Each pattern coded as a 32-bit integer Save memory: –Only a few rules lead to win or winning positions –Different sets of conditions can be associated with a pattern

Go Meeting Talk15 Generation

Go Meeting Talk16 Generation

Go Meeting Talk17 Generation Further optimizations: –Unmove only the last deduced patterns –Order of Test and Cut –Rule-Coverage Reductions Image reproduced from the paper

Go Meeting Talk18 Results – Eyes on the side Images reproduced from the paper

Go Meeting Talk19 Results – Life in the Corner Images reproduced from the paper

Go Meeting Talk20 Results Image reproduced from the paper

Go Meeting Talk21 Results Image reproduced from the paper

Go Meeting Talk22 Results Image reproduced from the paper

Go Meeting Talk23 Conclusion Go Patterns with External Conditions: –What are they? –How to represent them? –How to generate them? –Results