I think it will be a real challenge for programmers to beat a profession go player. Go is more complex than chess. You not only have to kill ur opponents stones. You have to gain terrority as well (like chessmate in chess but it isn't quite clear whether you have gain those terrorities until the game end.)
Another thing is go board is bigger (19x19 whereas chess is 8x8) and has more moves. so computer has to calculate more if u are gonna use simple tree search algorithms like deepblue does. . Go game start with 361 empty spaces(~200 moves). With current go algorithms, the performance requirements for a chess-like approach to Go can be estimated as 10^27 times greater than that for computer chess. To put it simply u cant brute force a go game yet(not with current computation power and algorithms).
Check out this and this
Slashdot Mirror
NO!! XviD :D
Errr MS is monopoly not just that kind of business model -_-
I think it will be a real challenge for programmers to beat a profession go player. Go is more complex than chess. You not only have to kill ur opponents stones. You have to gain terrority as well (like chessmate in chess but it isn't quite clear whether you have gain those terrorities until the game end.) Another thing is go board is bigger (19x19 whereas chess is 8x8) and has more moves. so computer has to calculate more if u are gonna use simple tree search algorithms like deepblue does. . Go game start with 361 empty spaces(~200 moves). With current go algorithms, the performance requirements for a chess-like approach to Go can be estimated as 10^27 times greater than that for computer chess. To put it simply u cant brute force a go game yet(not with current computation power and algorithms). Check out this and this