The Many Faces of Go - 바둑

Go, called "baduk" in Korean and "wei-chi" in Chinese, is a 4,000 year-old game of strategy played by more than 100 million people

"The Many Faces of Go" is the 2008 World computer go 19x19 and 9x9 champion, 2002 World Computer Go Champion, 1998 World Computer Go Champion, and ten time US Computer Go Champion. It is one of the strongest Computer Go opponents in the world, and has many other great features including an integrated IGS client so you can play on the Internet. A sophisticated set of go problems and a Joseki tutor help you improve your game.  It includes several go players of different strengths, from 2 kyu to 18 kyu, so players of any level can have a challenging game.

In 2006 and 2007 a new breakthrough algorithm for computer go (Monte Carlo Tree Search), was developed in France.  This new approach plays thousands of pseudorandom games each second, and collects statistics on the moves to choose where to play.  With very little go knowledge, this algorithm can beat any of the traditional, knowledge-based, go programs.  However the style of this new algorithm by itself is strange.  Many Faces of Go, version 12 is the only program to combine the new search algorithm with the go knowledge from version 11 to get the benfit of both. It gains strength from Monte Carlo evaluation, but avoids most of the strange moves.  This led to over five stones increase in playing strength.  At the 2008 ICGA world championship, the pure Monte Carlo programs beat all of the traditional programs, and Many Faces of Go version 12 beat all of the Monte Carlo and traditional programs.

http://www.smart-games.com/manyfaces.html