{"title":"对围棋游戏情境的宏观理解","authors":"T. Yokogawa, J. Nishino, Y. Mizuno","doi":"10.1109/FUZZY.1995.409877","DOIUrl":null,"url":null,"abstract":"Chess program has a great progress by a method of game tree search. In the contrary, the search method does not work well in GO, because GO has much vaster search space. In this paper, we propose that a fuzzy approach can be applied to GO algorithm; especially for understanding of \"Atsumi(thickness)\". \"Atsumi\" is treated as mixed fuzzy values of various axes similar to ones human players use when they decide the strategy. We also propose that general rules of GO strategy can be written by \"Atsumi\" and show that the approach is applicable to open game or beginning of middle game of GO.<<ETX>>","PeriodicalId":150477,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Fuzzy Systems.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Macroscopic understanding of the game situations in GO\",\"authors\":\"T. Yokogawa, J. Nishino, Y. Mizuno\",\"doi\":\"10.1109/FUZZY.1995.409877\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Chess program has a great progress by a method of game tree search. In the contrary, the search method does not work well in GO, because GO has much vaster search space. In this paper, we propose that a fuzzy approach can be applied to GO algorithm; especially for understanding of \\\"Atsumi(thickness)\\\". \\\"Atsumi\\\" is treated as mixed fuzzy values of various axes similar to ones human players use when they decide the strategy. We also propose that general rules of GO strategy can be written by \\\"Atsumi\\\" and show that the approach is applicable to open game or beginning of middle game of GO.<<ETX>>\",\"PeriodicalId\":150477,\"journal\":{\"name\":\"Proceedings of 1995 IEEE International Conference on Fuzzy Systems.\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1995 IEEE International Conference on Fuzzy Systems.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FUZZY.1995.409877\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1995 IEEE International Conference on Fuzzy Systems.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUZZY.1995.409877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Macroscopic understanding of the game situations in GO
Chess program has a great progress by a method of game tree search. In the contrary, the search method does not work well in GO, because GO has much vaster search space. In this paper, we propose that a fuzzy approach can be applied to GO algorithm; especially for understanding of "Atsumi(thickness)". "Atsumi" is treated as mixed fuzzy values of various axes similar to ones human players use when they decide the strategy. We also propose that general rules of GO strategy can be written by "Atsumi" and show that the approach is applicable to open game or beginning of middle game of GO.<>