My mercy threshold is 27 stones, and this position is not a problem. It
gets the same win rate (10.6%) with or without mercy. The mercy rule makes
about 1.25% faster.
David
> -Original Message-
> From: computer-go-boun...@computer-go.org [mailto:computer-go-
> boun...@computer-go.org] O
Seems like it needs to not count dead stones, otherwise it will believe that a
large number of dead stones is better than a smaller number of live stones.
Any such rule will also need to differentiate between dead and seki.
Terry McIntyre
“We hang the petty thieves and appoint the great one
On Tue, Aug 18, 2009 at 10:24 AM, Brian Sheppard wrote:
> What do you do in your program?
Not using the mercy-rule.
I believe you can gain 10%-20% performance on 9x9 using a mercy-rule.
But in its most simple form I don't see how it can be used reliably. I
don't know if the gain in performance o
Well, it's a trade-off of course, but a?mercy rule threshold of 20?might
be?pushing it a bit. For 9x9, I typically use 30. If you only invoke the rule
for external nodes at least N plys away from any internal nodes, then the tree
will catch some of these problems.
Some playout policies tend
Sorry, I cannot waive the course prerequisites.
---
Keh-Hsun Chen (Ken), Ph.D.
Professor and Associate Chair of Computer Science
UNC Charlotte | Dept. of Computer Science
9201 University City Blvd. | Charlotte, NC 28223
Phon