Position Evaluation in Computer Go Martin Muller Dept. of Computer Science and Information Engineering National Dong Hwa University Reporter : Lo Jung-Yun.

Slides:



Advertisements
Similar presentations
Fuzzy Reasoning in Computer Go Opening Stage Strategy P.Lekhavat and C.J.Hinde.
Advertisements

Development of the Best Tsume-Go Solver
ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2008.
Heidi Newton Peter Andreae Artificial Intelligence.
Artificial Intelligence in Game Design Heuristics and Other Ideas in Board Games.
Life in the Game of Go David B. Benson Surveyed by Akihiro Kishimoto.
1 土木工程系 暑期實習課程 Roadmap 國立臺北科技大學. 第 2 週 第 7 週 第 9 週 第 10 週 通知既有廠商、通知老師找廠商 目前成效 研究生業界實習 -Roadmap 老師填寫校外實習機會評估表、 收回校外實習機會評估表、 確認廠商內容並公佈、 請導師向學生說明實習機會。 老師填寫校外實習機會評估表、
Research Proposal 人機介面研究之實驗設計 Yu-Hui Tao 2011/5/4.
Maximizing the Chance of Winning in Searching Go Game Trees Presenter: Ling Zhao March 16, 2005 Author: Keh-Hsun Chen Accepted by Information Sciences.
微 積 分微 積 分微 積 分微 積 分. Computer Setup 推車 cut down the cables !! 無影手 把黑板還給老師 作業與考試 融合 __ 一種態度、不只一個方法.
November 10, 2009Introduction to Cognitive Science Lecture 17: Game-Playing Algorithms 1 Decision Trees Many classes of problems can be formalized as search.
Engineering Mathematics
專題製作(一) 邱明星 老師 遠東科技大學 資訊管理系. 專題製作的緣起 Learning how to learn. Know more. Learning space.
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.
Reinforcement Learning of Local Shape in the Game of Atari-Go David Silver.
CS1103 電機資訊工程實習 Department of Computer Science National Tsing Hua University.
1 Life-and-Death Problem Solver in Go Author: Byung-Doo Lee Dept of Computer Science, Univ. of Auckland Presented by: Xiaozhen Niu.
Computer Go Research at the University of Alberta Martin Müller.
Retargetting Motion to New Characters SIGGRAPH ’98 Speaker: Alvin Date: 6 July 2004.
大華技術學院九十三學年度 資工系計算機概論教學大綱 吳弘翔. Wu Hung-Hsiang2 科目名稱:計算機概論與實習 適用班別:夜資工技一A 授課老師:吳弘翔 學分數: 4 修別:必修 老師信箱:
第二十一章 研究流程、論文結構        與研究範例 21-1  研究流程 21-2  論文結構 21-3  研究範例.
校務資訊系統 畢業離校操作說明 報告日期 : 務必先點選 ” 步驟一 ” 謝大美 大學部 中文系四年級 女 台中市北屯區 xx 路 xx 號 修改原留的資料 請點選此處 修改原留的資料 請點選此處.
1 高等演算法 授課老師 : 陳建源 研究室 : 法 401 網站
1 An Improved Safety Solver for Computer Go Presented by: Xiaozhen Niu Date: 2004/02/24.
大華技術學院九十五學年度 資工系計算機概論教學大綱 吳弘翔. Wu Hung-Hsiang2 科目名稱:計算機概論與實習 授課老師:吳弘翔 學分數: 4 修別:必修 老師信箱:
Inside HARUKA Written by Ryuichi Kawa Surveyed by Akihiro Kishimto.
ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2006.
National United University Department of Electrical Engineering ( Meiling CHEN ) Lecture 00 應用線性代數 (3 學分 ) Linear algebra and its applications.
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:
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. 如何準備研究所考試 2. 現在修課情況.
OmniFile Full Text 系列資料庫 個人化服務設定步驟. 此相關資料庫之個人化服 務只提供類似專題選粹的 服務,然無提供 mail 通知的 服務,讀者可建立個人 ID , 並儲存檢索策略,日後需 再進入該資料庫,查詢檢 索策略之新進文章。 導航目次 個人化服務說明 個人帳號密碼申請 個人化服務設定.
Reinforcement Learning of Local Shape in the Game of Atari-Go David Silver.
SlugGo: A Computer Baduk Program Presenter: Ling Zhao April 4, 2006 by David G Doshay, Charlie McDowell.
1 化學品管理系統介紹 工研院資訊中心 何玲菁 內容  目的  作業流程  權責  系統登入  功能說明  系統展示  Q & A.
Wei Qi, Baduk, Go a game of strategy
Knowledge Acquisition from Game Records Takuya Kojima, Atsushi Yoshikawa Dept. of Computer Science and Information Engineering National Dong Hwa University.
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
Chapter 2 Introduction to C Programming Associate Prof. Yuh-Shyan Chen Dept. of Computer Science and Information Engineering National Chung-Cheng University.
物件導向實習 極高的忘記答題率 … AB 卷都有的題目 : 4(1). Define method overloading 明明寫出了方法, 卻不回答老師的題目 (1)( 只要 寫出定義就好了 ) 另外, 讀題一定要仔細 : Two overloaded methods average.
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.
Apostles Chess Club Session Three. Chess Piece Symbols The symbols shown above are the ones most used when showing chess pieces in print or on the internet.
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.
Renju Presented by JungYun Lo National Dong Hwa University Department of Computer Science and Information Engineering Artificial Intelligence Laboratory.
 Summary  How to Play Go  Project Details  Demo  Results  Conclusions.
南台科技大學 資訊工程系 A web page usage prediction scheme using sequence indexing and clustering techniques Adviser: Yu-Chiang Li Speaker: Gung-Shian Lin Date:2010/10/15.
智慧型系統實驗室 iLab 南台資訊工程 1 Evaluation for the Test Quality of Dynamic Question Generation by Particle Swarm Optimization for Adaptive Testing Department of.
Introduction to Chess Club
Connect Four AI Robert Burns and Brett Crawford. Connect Four  A board with at least six rows and seven columns  Two players: one with red discs and.
Asus WL-500GP OS/Platform/Environment Introduction.
Senior Project Poster Day 2007, CIS Dept. University of Pennsylvania Reversi Meng Tran Faculty Advisor: Dr. Barry Silverman Strategies: l Corners t Corners.
Game Playing. Introduction One of the earliest areas in artificial intelligence is game playing. Two-person zero-sum game. Games for which the state space.
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
Outline Intro to Representation and Heuristic Search Machine Learning (Clustering) and My Research.
Lesson 1 History of Chess Why We Teach Chess Goal of Chess.
Parallelization in Computer Board Games Ian Princivalli.
Learning to Play the Game of GO Lei Li Computer Science Department May 3, 2007.
CHESS Basics for Beginners. BOARD SET-UP The letters go across the board in front of you. “White on right!” Each player has a white square in their right.
A Levoy PowerPoint Presentation
Introduction to Computer Science Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan ( 台大資訊工程系.
An AI Game Project. Background Fivel is a unique hybrid of a NxM game and a sliding puzzle. The goals in making this project were: Create an original.
1 Evaluation Function for Computer Go. 2 Game Objective Surrounding most area on the boardSurrounding most area on the board.
When the king is being attacked directly by an opponent’s piece we say the king is in check.
義守大學資訊工程學系 作者:郭東黌, 張佑康 報告人:徐碩利 Date: 2006/11/01
Machine Learning for Go
Isolation – Champion Program
Pipelined Architecture for Multi-String Matching
Presentation transcript:

Position Evaluation in Computer Go Martin Muller Dept. of Computer Science and Information Engineering National Dong Hwa University Reporter : Lo Jung-Yun

Outline Introduction Exact Evaluation in Explorer Heuristic Territory Evaluation in Explorer Full-Board Evaluation Open Problem and Future Work Project Progress

Introduction Describe the position evaluation methods used in Explorer Two different approach –Modularized heuristic evaluation using the concept of zones –An emphasis on exact evaluation methods for several types of local situations

Exact Evaluation in Explorer Safe Territory –Both static rules and method based on local search for detecting groups of blocks is safe Capturing Race (semeai) –Also by static rules End Game Area

Heuristic Territory Evaluation in Explorer Distinguish several different types of points Divider and potential divider Zone –Safe zone –Potential zone –Threatened zone –Unused zone Point outside the territory –Near points –Junction points –Far-away points

Heuristic Territory Evaluation in Explorer Divider and potential divider –Computed using pattern matching Safe zone –Are surrounded only by stones and dividers, and the interior is strongly controlled by stones Potential zone –Weaker than safe territory, either because part of the boundary is only a potential divider, or because the control over the inside is not strong enough Threatened zone –Weaker than potential zone Unused zone –Contain strong opponent groups

Different Types of Points Divider and Potential Divider –Using pattern matching

Different Types of Points Zone, potential zone, threatened zone, and unused zone

Point Outside The Territory Divider-adjusted distances

Point Outside The Territory Far-awayPoints are at least distance 5 away from both player JunctionPoints are less than 5 and which the difference of distance to black and white is at most 1 NearRemaining points are either black or white

Full-Board Evaluation Weight setting Safe territory±1 Potential territory±½ Near point±0.2 Junction point and far-away point0

Open Problems and Future Work Maximize the chance of winning, not for score

Project progress A B C D E F A. 確定明確的方向及題目 B. 充實基本知識 C. 規劃系統及收集資訊 D. 系統實作 E. 驗收及改善 F. 論文撰寫

Project progress Function –Open *.sgf file (using Neko’s parser) –Put stones on the board Running –Check capture –Some data structure Stone string Stone group