A Study of Heuristic Rules for Computer Go Program

• Main Authors: Guo, Yi-Hong, 郭奕宏
• Other Authors: Si-Jing Horng, Zhong-Wan Kao
• Format: Others
• Language: zh-TW
• Published: 1997
• Online Access: http://ndltd.ncl.edu.tw/handle/78851280487138326573

碩士 === 國立台灣工業技術學院 === 電機工程技術研究所 === 85 === Playing a chess game on computer in the intelligent field lasts for a longtime. During past decades, many interesting and practical thories areconstantly discovered and brought up. Especially the chess programs, theyhave achieved the level of the world champion. But compared with thoseprograms of Chess, Othello, Chinese Chess, and a traditional checker-typegame, Go programs are more difficult to design. The reason is that the legalmoves are too many and it is hard to make a right move decision. Thus, therehas been no excellent Go program till now. Go programs have been emphasized and it is challenging. The more researches in all respects, thebetter Go programs produced. The dissertation discusses the ways of designing Go programs and theexperiential rules adopted in the system. The techniques used in the systeminclude the humans'' experiential rules, the Pattern-matching, Alpha-Beta Treeand Database.