Is the board game "Go" NP complete?
Posted
by sharkin
on Stack Overflow
See other posts from Stack Overflow
or by sharkin
Published on 2009-11-12T23:24:48Z
Indexed on
2010/05/22
23:41 UTC
Read the original article
Hit count: 416
There are plenty of Chess AI's around, and evidently some are good enough to beat some of the world's greatest players.
I've heard that many attempts have been made to write successful AI's for the board game Go, but so far nothing has been conceived beyond average amateur level.
Could it be that the task of mathematically calculating the optimal move at any given time in Go is an NP-complete problem?
© Stack Overflow or respective owner