Re: computer-go: FPGA

[Vincent Diepeveen <diep@xxxxxxxxx>]

At 02:18 PM 8/31/00 CEST, you wrote:
>Hi!
>
>>Some of the early work on AI algorithm development for chess was 
>>interesting.
>>That was when computers were too slow to do a brute-force, iterative 
>>deepening
>>search.  If Go succumbs to a brute-force, iterative deepening search, then
>>it would seem that only imperfect information games can be used for AI
>>algorithm development.  That will eliminate all "typical 2 player game(s) 
>>we
>>are used to playing."  Heavy sigh.
>
>Why such a sad conclusion? It would still be a challenge to write a program 
>that plays well WITHOUT brute-force search (especially since as you say, 
>humans don't use that method). Moreover, such an intelligent program should 
>be definitely faster than a brute-force one (on the same hardware) - and 
>thus better!

The conclusion sounds weird to me: why would something more selective
be faster? For brute force you don't lose speed. You do everything.
When being selective 
  a) you lose speed to the selection
  b) smaller branching factor ==> more speed loss (partly result of a)

>regards,
>Vlad
>_________________________________________________________________________
>Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com.
>
>Share information about yourself, create your own public profile at 
>http://profiles.msn.com.
>
>
>