1 Evaluation of strings in computer Go using APC and Seki judgement Author: Hyun-Soo Park and Kyung-Woo Kang Presented by: Xiaozhen Niu.

Slides:

Advertisements

Similar presentations

Algorithms (and Datastructures) Lecture 3 MAS 714 part 2 Hartmut Klauck.

Advertisements

Development of the Best Tsume-Go Solver

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

Stanford University CS243 Winter 2006 Wei Li 1 Register Allocation.

TECH Computer Science Graphs and Graph Traversals  // From Tree to Graph  // Many programs can be cast as problems on graph Definitions and Representations.

Data Structure and Algorithms (BCS 1223) GRAPH. Introduction of Graph A graph G consists of two things: 1.A set V of elements called nodes(or points or.

Carnegie Mellon Lecture 6 Register Allocation I. Introduction II. Abstraction and the Problem III. Algorithm Reading: Chapter Before next class:

1 Modularity and Community Structure in Networks* Final project *Based on a paper by M.E.J Newman in PNAS 2006.

Author: Jie chen and Yousef Saad IEEE transactions of knowledge and data engineering.

1 A Library of Eyes in Go Author: Thomas Wolf, Matthew Pratola Dept of Mathematics Brock University Presented by: Xiaozhen Niu.

Lecture 6 Image Segmentation

Effective Image Database Search via Dimensionality Reduction Anders Bjorholm Dahl and Henrik Aanæs IEEE Computer Society Conference on Computer Vision.

Region Segmentation. Find sets of pixels, such that All pixels in region i satisfy some constraint of similarity.

HCS Clustering Algorithm

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.

1 Life-and-Death Problem Solver in Go Author: Byung-Doo Lee Dept of Computer Science, Univ. of Auckland Presented by: Xiaozhen Niu.

CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.

1 An Improved Safety Solver for Computer Go Presented by: Xiaozhen Niu Date: 2004/02/24.

Inside HARUKA Written by Ryuichi Kawa Surveyed by Akihiro Kishimto.

Clustering. 2 Outline  Introduction  K-means clustering  Hierarchical clustering: COBWEB.

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:

Greedy Algorithms Like dynamic programming algorithms, greedy algorithms are usually designed to solve optimization problems Unlike dynamic programming.

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.

1 Influence Calculation in Go Paper: Semi-empirical Quantitative Theory of GO Part 1: Estimation of the Influence of a Wall ICGA Journal Vol.25 No.4 December.

Spanning Trees. Spanning trees Suppose you have a connected undirected graph –Connected: every node is reachable from every other node –Undirected: edges.

CS 206 Introduction to Computer Science II 04 / 06 / 2009 Instructor: Michael Eckmann.

1 An Efficient Algorithm for Eyespace Classification in Go Author: Peter Drake, Niku Schreiner Brett Tomlin, Loring Veenstra Presented by: Xiaozhen Niu.

Wei Qi, Baduk, Go a game of strategy

Clustering Unsupervised learning Generating “classes”

Graph 8 a. Graph b. Domain _________ c. Range __________

Texas Learning and Computation Center High Performance Systems Lab Automatic Clustering of Grid Nodes Nov 14, 2005 Qiang Xu, Jaspal Subhlok University.

Image Segmentation Seminar III Xiaofeng Fan. Today ’ s Presentation Problem Definition Problem Definition Approach Approach Segmentation Methods Segmentation.

Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.

1 Efficient Search Ranking in Social Network ACM CIKM2007 Monique V. Vieira, Bruno M. Fonseca, Rodrigo Damazio, Paulo B. Golgher, Davi de Castro Reis,

Prof. Swarat Chaudhuri COMP 482: Design and Analysis of Algorithms Spring 2012 Lecture 10.

Web Document Clustering: A Feasibility Demonstration Oren Zamir and Oren Etzioni, SIGIR, 1998.

A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.

CSCI 115 Chapter 7 Trees. CSCI 115 §7.1 Trees §7.1 – Trees TREE –Let T be a relation on a set A. T is a tree if there exists a vertex v 0 in A s.t. there.

Connected Components Fun with graphs, searching, and queues.

A. Levitin “Introduction to the Design & Analysis of Algorithms,” 3rd ed., Ch. 3 ©2012 Pearson Education, Inc. Upper Saddle River, NJ. All Rights Reserved.

Learning Linear Causal Models Oksana Kohutyuk ComS 673 Spring 2005 Department of Computer Science Iowa State University.

A genetic approach to the automatic clustering problem Author : Lin Yu Tseng Shiueng Bien Yang Graduate : Chien-Ming Hsiao.

CS654: Digital Image Analysis

We are learning to write expressions using variables. (8-1)

CS 8751 ML & KDDData Clustering1 Clustering Unsupervised learning Generating “classes” Distance/similarity measures Agglomerative methods Divisive methods.

Source :2009 Fifth International Joint Conference on INC, IMS and IDC Authors ： Min-Woo Park, Jin-Young Choi, Young-Ju Han, and Tai-Myoung Chung Reporter.

Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation Author: Mark Minas Presenter: Song Gu.

Write a function rule for a graph EXAMPLE 3 Write a rule for the function represented by the graph. Identify the domain and the range of the function.

Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!

Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.

Brute Force A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples: Computing.

Discrete ABC Based on Similarity for GCP

Brute Force A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples: Computing.

Graphs Representation, BFS, DFS

Discrete Mathematicsq

CS 3343: Analysis of Algorithms

CS 3343: Analysis of Algorithms

Short paths and spanning trees

Graph Search Applications

Autumn 2016 Lecture 11 Minimum Spanning Trees (Part II)

Notes Over 2.1 Function {- 3, - 1, 1, 2 } { 0, 2, 5 }

Autumn 2015 Lecture 11 Minimum Spanning Trees (Part II)

Jeopardy Division Graphing Q $100 Q $100 Q $100 Q $100 Q $200 Q $200

Graph Representation (23.1/22.1)

Brute Force A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples: Computing.

A graphing calculator is required for some problems or parts of problems 2000.

Data Mining – Chapter 4 Cluster Analysis Part 2

Richard Anderson Lecture 10 Minimum Spanning Trees

Presentation transcript:

1 Evaluation of strings in computer Go using APC and Seki judgement Author: Hyun-Soo Park and Kyung-Woo Kang Presented by: Xiaozhen Niu

2 Outline Introduction String Graph (SG) Rules Experiments Summary

3 Introduction Problem: life-and-death of strings Major issues: Infeasible by brute-force search Goal: using string graph (SG) and related rules to determine life and death status

4 Basic Structure

5 String Graph (SG) A string graph (SG) can be defined as follows: SG = (V, E) V = {BS, WS, ES} E = {Ed, Eu}, Eu: adjacency relationship, Ed: inclusion relationship.

6 Examples (1) A directed edge: An undirected edge:

7 Euclidean distance based Clustering Calculate distances between the input pattern and the weighted center of each cluster Find the closest cluster within the range of the threshold P

8 Examples

9 Examples (2) An Alive String Graph (ASG):

10 Rules Rule 1: APC: articulation point check Articulation point: if removed the rest of the graph becomes disconnected. Using the number of AP and number of empty points to decide the life and death status

11 Examples (1) Empty points = 6, AP = 0: Empty points = 6, AP = 4, 3, 2:

12 Examples (2) Empty points = 6, AP = 1: Empty points = 7, AP = 1:

13 Evaluation of Seki OSOG: one string and one group S1 and S2 are OSOG, S3 does not need to be OSOG, but with same color of S1

14 Judgment of Seki (JOS) JOS: S2 are surrounded by S3 and without external liberties S1 is OSOG, included in S2 2 empties (e1, e2) in S2 Procedure: Add one stone of s1 in e1 and e2 separately can create new string s4, s5, if s4, s5 are both alive by APC, S1 and S2 are seki. Else, S1 is alive, S2 is dead, e1 and e2 belong to S1

15 Examples Seki: No seki:

16 Evaluation of Stability of Strings

17 Experiments Using IGS_31_counted problems, includes 11,191 points and 1,123 strings

18 Examples

19 Summary Using SG and related rules for static evaluation Advantages: APC can be used to determine small area (size <7) Disadvantages: too optimistic to use in larger area (size >7)! JOS can’t determine if strings are not OSOG