Brute-force computation has eclipsed humans in chess, and it could soon do the same in the ancient Asian game of Go.
Feng-hsiung Hsu, a key designer of Deep Blue--the IBM computer that in 1997 defeated chess grandmaster Garry Kasparov, then the world champion--now proposes to apply the same approach to the vastly more complex Chinese game of Weiqi, known in the West by its Japanese name, Go.
That approach, known as brute-force analysis, exploits the peculiar ability of computers to calculate vast numbers of possible game outcomes while sidestepping their weakness in judgment and planning.