{"title":"在围棋游戏中有效确定“生命状态”的数学公式","authors":"Masafumi Sato, Koichi Anada, M. Tsutsumi","doi":"10.1109/ICIT.2016.7475016","DOIUrl":null,"url":null,"abstract":"The game of Go is an ancient board game. In this game, players aim to capture the stones of their opponent by enclosing them. One possible condition for a stone is described as \"safe\". A safe stone can never be captured. This has been represented with a static determination by Benson [1]. In this paper, we analyze this determination mathematically, using the BW graph model that was introduced by Sato et al. [2][3][4][5]. As the result, we propose a new representation that reduces the required number of backtracking searches.","PeriodicalId":116715,"journal":{"name":"2016 IEEE International Conference on Industrial Technology (ICIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A mathematical formulation to efficiently determine \\\"life status\\\" in the game of Go\",\"authors\":\"Masafumi Sato, Koichi Anada, M. Tsutsumi\",\"doi\":\"10.1109/ICIT.2016.7475016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The game of Go is an ancient board game. In this game, players aim to capture the stones of their opponent by enclosing them. One possible condition for a stone is described as \\\"safe\\\". A safe stone can never be captured. This has been represented with a static determination by Benson [1]. In this paper, we analyze this determination mathematically, using the BW graph model that was introduced by Sato et al. [2][3][4][5]. As the result, we propose a new representation that reduces the required number of backtracking searches.\",\"PeriodicalId\":116715,\"journal\":{\"name\":\"2016 IEEE International Conference on Industrial Technology (ICIT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Industrial Technology (ICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2016.7475016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Industrial Technology (ICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2016.7475016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A mathematical formulation to efficiently determine "life status" in the game of Go
The game of Go is an ancient board game. In this game, players aim to capture the stones of their opponent by enclosing them. One possible condition for a stone is described as "safe". A safe stone can never be captured. This has been represented with a static determination by Benson [1]. In this paper, we analyze this determination mathematically, using the BW graph model that was introduced by Sato et al. [2][3][4][5]. As the result, we propose a new representation that reduces the required number of backtracking searches.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
