--- Jacques Basaldúa [EMAIL PROTECTED] escribió:
I wouldn't understand anyway. I never understood the
need of
Java, much less that of an incompatible clone. I can
For me, time/speed. I'm a full time worked, I can't
affort the X3 or X5 time I will take coding it on
C/C++. Also, I work
Given your original description I'm not so sure if what you're doing should
actually be called a nearest neighbor method. It may be more like a decision
tree... This said, the curse of dimensionality is a general problem which
can come up with all similarity/distance based approaches using finite
Hi, Jacques,
1. Is this a complete go engine? I have renamed the gnugo.exe file
in the /exe directory and the program no longer works. If it is not
an engine, what is it?
This is simple metamachine program.
Ver.1.0 includes mm_hybrid.cpp in GNU directory.
This file is a modified program of
On Mar 13, 2007, at 23:27 , Peter Drake wrote:
Hmmm -- p. 735 of Russell Norvig's AI text contains a strong argument
that nearest-neighbor methods cannot be trusted for high- dimensional
data.
AFAIK that's because when you add more and more dimensions and try to
calculate the distance
I just want to weigh in on C# here since someone asked about it
earlier in this thread. I recently switched from C++ to C#. I was
not an expert at utilization of the STL, but I made do. Moving to C#
has increase the rate at which I can try new things by at least 10x.
I wish I would have done
I was able to replicate the success (and with more iterations,
failure) of the all-as-first heuristic. But I have not been able to
see an improvement when I prohibit multi-stone suicides (I always
prohibit single-stone suicides). Forgive me, but I am only interested
in your response if you have
I would say the two best things about C# are the IDE and the garbage
collection. Perhaps Java has as-good or better in both regards. I
don't know. I have never been a Java guy. I became familiar with the
.NET platform due to my job.
I think it is fair to say that I ported my C++ code. Some
On Wed, 2007-03-14 at 23:03 -0400, Chris Fant wrote:
I was able to replicate the success (and with more iterations,
failure) of the all-as-first heuristic. But I have not been able to
see an improvement when I prohibit multi-stone suicides (I always
prohibit single-stone suicides). Forgive
