zdnetindia.com— Computers can beat some of the world's top chess players, but the most powerful machines have failed at the popular Asian board game Go, in which human intuition has so far proven key.
Feb 24, 2007View in Crawl 4
Daredemo Kantan Chou Chikun no Tsumego is actually a better DS game especially if your beginning. It's more of thousands of problems and you need to solve them. Basically you are try to make eyes and save your pieces so usually you have a move or a few and it'll tell you if your right or wrong. If wrong, you can keep attempting it till you get it right.I have a screenshot of it here<a class="user" href="http://mrbass.org/nintendoDS/games">http://mrbass.org/nintendoDS/games</a>
That's not the only hard part. Chess has 20 possible moves in its opening position, and perhaps 20-30 possible moves in the average game position. So thinking two moves deep for both player only means looking at about 30^4 = 810,000 positions (ballpark).Go, on the other hand, has a branching factor of about 150. Thinking two moves deep for both players is 506,250,000 different lines.That's just not tractable. Taken together with the evaluation function problems, it means that the usual minmax algorithm used for chess like games isn't feasible, something entirely different is needed.
kragthediggerFeb 25, 2007
quoting ACM ICPC problems now ? :)~K
Closed AccountFeb 25, 2007
My computer can beat me at Chess - but I can whip it's ass at Kickboxing.
trigger0219Feb 25, 2007
Here is content...<a class="user" href="http://senseis.xmp.net/?UCT">http://senseis.xmp.net/?UCT</a>Contains pseudo code of algorithm and links to academic papers and more
au071Feb 25, 2007
For now maybe, but have you seen terminator?
mrbassFeb 25, 2007
Daredemo Kantan Chou Chikun no Tsumego is actually a better DS game especially if your beginning. It's more of thousands of problems and you need to solve them. Basically you are try to make eyes and save your pieces so usually you have a move or a few and it'll tell you if your right or wrong. If wrong, you can keep attempting it till you get it right.I have a screenshot of it here<a class="user" href="http://mrbass.org/nintendoDS/games">http://mrbass.org/nintendoDS/games</a>
bisqwitFeb 25, 2007
Yeah, it seems like the one who wrote the article knows nothing about the game of Go. "Capture spaces"... shudder.Buried as inaccurate.
scarblacFeb 26, 2007
That's not the only hard part. Chess has 20 possible moves in its opening position, and perhaps 20-30 possible moves in the average game position. So thinking two moves deep for both player only means looking at about 30^4 = 810,000 positions (ballpark).Go, on the other hand, has a branching factor of about 150. Thinking two moves deep for both players is 506,250,000 different lines.That's just not tractable. Taken together with the evaluation function problems, it means that the usual minmax algorithm used for chess like games isn't feasible, something entirely different is needed.