![]() StartingPoints Aliases (info) Referenced by Homepages
|
Computer Go
Keywords: Software
IntroductionThere is much yet to be done in the field of computer Go. While many different approaches have been tried, the level of the best Go playing programs is still low, even compared to amateur dan players (at least 10 stones!), not to mention professionals. Thus computer Go is a very exciting part of Artificial Intelligence (AI), many new ideas and techniques are yet to be discovered. It's interesting to note that compared to the approach which proved so successful with Chess, brute force is useless for solving Go problems given the huge branching factor of the game tree. In fact, Go endgames been proven to be PSpace-hard, let alone other parts of the game. Also, many other aspects of Go, including life and death, are also known to be NP-hard. This means that it is very unlikely to be able to find a reasonably fast algorithm for playing perfect Go. So it looks like it's all about heuristics (surprise surprise). PhilosophyBefore delving into computer Go, it would behoove the novice to consider some philosophical questions about computers and Go. ProgramsPlease see Go Programs for a discussion about the best programs currently available. ProgrammingSee Computer Go Programming for details on implementing Go programs. CompetitionsBelow are competitions where Go playing programs can be tested. International Competitions: Regional Competitions:
Small Board Competitions: History of Go Programs
Random Linkage
(Smaller Go Bibliography, with comments)
Computer Go discussionWhat do you think this page should become? Issues:
Authors: Gounter, Chestnut This is a copy of the living page "Computer Go" at Sensei's Library. ![]() |