Re: [computer-go] Computer Go tournament at EGF

[Don Dailey <drd@xxxxxxx>]

David,  

The point he is making is that you can't isolate the execution time of
the algorithm from the playing strength.  It IS in fact easy to write
a perfect go program given no time constraints (just search until
solution.)  The issue isn't how GOOD your program is, it is how good
it is in a given amount of time.

- Don



   X-Original-To: computer-go@xxxxxxxxxxxxxxxxx
   From: David G Doshay <ddoshay@xxxxxxxxxxxxxxxxx>
   Date: Sat, 12 Feb 2005 08:04:05 -0800
   Reply-To: computer-go <computer-go@xxxxxxxxxxxxxxxxx>
   Sender: computer-go-bounces@xxxxxxxxxxxxxxxxx
   X-Spam-Score: -5.811
   X-Spam-Flag: NO
   X-Scanned-By: MIMEDefang 2.42


   On 10, Feb 2005, at 1:00 AM, Michal Bazynski wrote:

   > i disagree with this a little bit. it is real easy for me to write a 
   > program that plays optimal Go, I'll just be forced to forfeit on time 
   > if there are _any_ time limits (or memory limits :-( ).
   > which is not a good argument for taking time limits away. same with 
   > slugGo - the whole challenge of computer Go is making it play 
   > reasonably good in reasonable time. It it can't play in reasonable 
   > time than it might not be all that much different from generating the 
   > whole game tree...

   I disagree with this a little bit ...  ;^)
   If it is so easy then you should do it!
     ... except that no one has been able to write a strong Go program yet.

   Cheers,
   David


   _______________________________________________
   computer-go mailing list
   computer-go@xxxxxxxxxxxxxxxxx
   http://www.computer-go.org/mailman/listinfo/computer-go/

_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/