[computer-go] 19x19 Study - prior in bayeselo, and KGS study

[terry mcintyre]

We could test this: find some nakade problems in the games, crank up the number of simulations, and see if Mogo finds the crucial moves.

There's the question of how long "eventually" is. 

I
 
Terry McIntyre <terrymcintyre at yahoo.com> 
“Wherever is found what is called a paternal government, there is found state education. It has been discovered that the best way to insure implicit obedience is to commence tyranny in the nursery.”
 
Benjamin Disraeli, Speech in the House of Commons [June 15, 1874]

----- Original Message ----
From: Don Dailey <drdailey at cox.net>
To: computer-go <computer-go at computer-go.org>
Sent: Wednesday, January 30, 2008 11:10:01 AM
Subject: Re: [computer-go] 19x19 Study - prior in bayeselo, and KGS study


Is 
nakade 
actually 
a 
problem 
in 
mogo?  
 
Are 
there 
positions 
it 
could
never 
solve 
or 
is 
merely 
a 
general 
weakness.  
  

I 
thought 
the 
search 
corrected 
such 
problems 
eventually.

- 
Don


Gian-Carlo 
Pascutto 
wrote:
> 
Don 
Dailey 
wrote:
>
>> 
If 
a 
nakade 
fixed 
version 
of 
mogo 
(that 
is 
truly 
scalable) 
was 
in 
the
>> 
study,  
how 
much 
higher 
would 
it 
be 
in 
your 
estimation?  
  
>
> 
You 
do 
realize 
that 
you 
are 
asking 
how 
much 
perfect 
life 
and 
death
> 
knowledge 
is 
worth?
>
_______________________________________________
computer-go 
mailing 
list
computer-go at computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/






      ____________________________________________________________________________________
Never miss a thing.  Make Yahoo your home page. 
http://www.yahoo.com/r/hs