Welcome, Guest. Please Login or Register.
Nov 24th, 2024, 7:25am

Home Home Help Help Search Search Members Members Login Login Register Register
Arimaa Forum « Cracking Go by Brute Force »


   Arimaa Forum
   Arimaa
   Off Topic Discussion
(Moderators: christianF, supersamu)
   Cracking Go by Brute Force
« Previous topic | Next topic »
Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print
   Author  Topic: Cracking Go by Brute Force  (Read 1041 times)
Fritzlein
Forum Guru
*****



Arimaa player #706

   
Email

Gender: male
Posts: 5928
Cracking Go by Brute Force
« on: Oct 26th, 2007, 4:37pm »
Quote Quote Modify Modify

The man who built Deep Blue is at it again.  He claims there can be a brute-force computer Go champion ten years from now.  http://www.spectrum.ieee.org/oct07/5552
 
If branching factor is the only issue, then to search as deeply for Go as Deep Blue did for chess requires "only" a speedup of a million.  A million is 10^6 = 2^20, so twenty doublings of processing power.  A gap of twenty years between the computers conquering chess and computers conquering Go does not seem outlandish.  On that score Hsu can perhaps convince me.
 
But I remain very skeptical about the evaluation of terminal nodes in a search tree.  The static evaluation of chess positions by Deep Blue was reasonably good.  Right now the static evaluation of Go positions by computers is terrible.  I don't understand how grafting one portion of the search tree onto another place will fix this.
 
Also, he anticipates alpha-beta pruning plus recursive null-move pruning effectively quadruples search depth.  I know that for alpha-beta pruning to work the move-ordering must be good, and I suppose the same is true for recursive null-move pruning.  But where does the good move-ordering come from?
 
I have to say that despite Microsoft potentially funding this research to the tune of millions of dollars, I expect the some developer to win the Arimaa Challenge long before Go falls to computers.
IP Logged

chessandgo
Forum Guru
*****



Arimaa player #1889

   


Gender: male
Posts: 1244
Re: Cracking Go by Brute Force
« Reply #1 on: Oct 27th, 2007, 3:43am »
Quote Quote Modify Modify

Hey, thanks for the link. Needless to say, I would gladly bet with Mr Hsu that humans will still be a long shot better than computers in a decade, but it would be great to see computer programs play well at go.
 
And indeed, this is quite bad news for the safety of the arimaa challenge ... seems like we will have to work hard to make it hold Smiley
IP Logged

Pages: 1  Reply Reply Notify of replies Notify of replies Send Topic Send Topic Print Print

« Previous topic | Next topic »

Arimaa Forum » Powered by YaBB 1 Gold - SP 1.3.1!
YaBB © 2000-2003. All Rights Reserved.