Hi,
On Wed, Feb 13, 2008 at 7:51 PM, Don Dailey <[EMAIL PROTECTED]> wrote:
> In a serious competition you would want to throttle down the playing
> strength (when playing black) so that it could win more and not just
> quit (resign) out of frustration!
Why throttle the playing strength? Wouldn
Hi there
I am new here, but have read the list for a few monthes.
I am a mathematician, finishing my PhD on quantum statistics (that is
statistics on quantum objects, quantum information, etc.).
So do not expect me to write any code, but I could have suggestions for
heuristics in the choice of mov
Registration is now open for this Sunday's bot tournament. This will
use full-sized boards for both divisions. It will start at 16:00 GMT,
and take place in the Asian night, European evening, and American
daytime. Time limits will be 45 minutes each, sudden death. It will end
around half an h
Vlad Dumitrescu wrote:
> Why throttle the playing strength? Wouldn't be enough to raise the
> threshold where the program resigns?
> Naively put: if all results say the game is lost, switch the
> evaluation to "best possible score" and continue playing for a while.
> If any winning paths appear, s
Hi Jonas,
welcome to the list.
The idea of using f(score) instead of sign(score) is interesting. Long
ago, I tried tanh(K*score) on 9x9 (that was before the 2006 Olympiad, so
it may be worth trying again), and I found that the higher K, the
stronger the program. Still, I believe that other f
For those who haven't seen it, here is a nice paper describing the
benefits of open source software. This journal (JMLR) is also starting
a new track for publications relating to open source software.
http://jmlr.csail.mit.edu/papers/volume8/sonnenburg07a/sonnenburg07a.pdf
-Dave
