Jump to content

Computer Go programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 134.100.6.192 (talk) at 11:09, 30 May 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

You must add a |reason= parameter to this Cleanup template – replace it with {{Cleanup|reason=<Fill reason here>}}, or remove the Cleanup template.

Unlike for chess, there are no "good" computer programs yet to play the game of Go, although its simple rules seem perfect for programming. The effords invested in go-programming are comparable to those of chess, so the reasons have to lie in the game itself. Two points are always mentioned:

  • the high branching factor, e.g 361 possible moves at the beginning
  • no simple evaluation function

The missing evaluation function is considered the biggest problem, as it makes impossible all brute-force-algorithms used for chess. Because of this, compouter go even fails for smaller boards like 9x9 until now.

Human players use not just logical analysis for playing, but also their creativity, intuition and cognition. Because of this and the fail of traditional algorithms, Go has become an interesting research field in Artificial Intelligence.


Topics to cover:

See also