|
| From: | Christopher D. Yep |
| Subject: | Re: [Bug-gnubg] Bug: 1-sided database |
| Date: | Tue, 30 Sep 2003 08:47:29 -0400 |
At 02:04 PM 9/24/2003 +0000, Jørn Thyssen wrote:
As an interesting side note I was actually in doubt how to handle gammons in the one sided database. When the database is generated the best moves are found by selecting the move with the lowest average number of rolls to bear off. But what about the gammon distribution? As I've implemented it the bearoff and gammon dist are totally independent, so the bearoff distribution for a given position may be based on different "best moves" than the gammon distribution. In principle this could lead to wrong cubeless gwcs and gammons for positions where gammon is possible: If I'm playing to save gammon I'll select my moves primarily based on the gammon distribution so the bearoff distribution is "wrong" since it may be based on different moves, hence the calculated gwc is wrong. If I'm playing to win I'll select my moves based on the bearoff distribution, so the gammon dist is "wrong", hence the calculated gammon percentage is wrong.
By the above, I assume that the gammon distribution is determined by selecting the move with the lowest average number of rolls to bearoff off at least one checker. Is that correct?
If so, I like this.
Fortunately, I'm saved by the fact that when gammons are possible the gwc is typically zero and vice versa: when wins are possible gammons are usually not. However, I've never verified this...
Right, when trying to save the gammon the gwc is usually very close to 0. When the race is "competitive" (i.e. between 1% and 99% winning chances), the chance of one side winning a gammon is very close to 0.
I can't think of a better way to combine winning chances and gammon chances into the database (without a ton of extra work), so I like how things are done now.
Chris
| [Prev in Thread] | Current Thread | [Next in Thread] |