Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

An ounce of hypocrisy is worth a pound of ambition. -- Michael Korda


interests / rec.games.backgammon / Re: Most tedious problem imaginable

SubjectAuthor
* Most tedious problem imaginablepeps...@gmail.com
`* Re: Most tedious problem imaginableTimothy Chow
 `- Re: Most tedious problem imaginablepeps...@gmail.com

1
Most tedious problem imaginable

<25ddc2eb-c7ba-4f5a-86e4-d8b25200ec5an@googlegroups.com>

  copy mid

https://www.novabbs.com/interests/article-flat.php?id=11806&group=rec.games.backgammon#11806

  copy link   Newsgroups: rec.games.backgammon
X-Received: by 2002:a05:620a:13b3:b0:74b:c328:3d2a with SMTP id m19-20020a05620a13b300b0074bc3283d2amr517069qki.5.1681510730266;
Fri, 14 Apr 2023 15:18:50 -0700 (PDT)
X-Received: by 2002:a05:622a:1a8b:b0:3df:bda6:692f with SMTP id
s11-20020a05622a1a8b00b003dfbda6692fmr2124543qtc.6.1681510730003; Fri, 14 Apr
2023 15:18:50 -0700 (PDT)
Path: i2pn2.org!i2pn.org!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: rec.games.backgammon
Date: Fri, 14 Apr 2023 15:18:49 -0700 (PDT)
Injection-Info: google-groups.googlegroups.com; posting-host=217.155.59.144; posting-account=X1j9wgoAAADLt4UnZrIneT3jwl9HvLMd
NNTP-Posting-Host: 217.155.59.144
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <25ddc2eb-c7ba-4f5a-86e4-d8b25200ec5an@googlegroups.com>
Subject: Most tedious problem imaginable
From: pepste...@gmail.com (peps...@gmail.com)
Injection-Date: Fri, 14 Apr 2023 22:18:50 +0000
Content-Type: text/plain; charset="UTF-8"
X-Received-Bytes: 1214
 by: peps...@gmail.com - Fri, 14 Apr 2023 22:18 UTC

I have a dull-as-ditchwater construction problem.
Construct a money position where the optimal checker play is unique but
where the loss in equity from choosing the second-best play is as small
as possible.

Paul

Re: Most tedious problem imaginable

<u1d770$1t396$1@dont-email.me>

  copy mid

https://www.novabbs.com/interests/article-flat.php?id=11809&group=rec.games.backgammon#11809

  copy link   Newsgroups: rec.games.backgammon
Path: i2pn2.org!i2pn.org!eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: tchow12...@yahoo.com (Timothy Chow)
Newsgroups: rec.games.backgammon
Subject: Re: Most tedious problem imaginable
Date: Fri, 14 Apr 2023 23:55:11 -0400
Organization: A noiseless patient Spider
Lines: 19
Message-ID: <u1d770$1t396$1@dont-email.me>
References: <25ddc2eb-c7ba-4f5a-86e4-d8b25200ec5an@googlegroups.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Sat, 15 Apr 2023 03:55:12 -0000 (UTC)
Injection-Info: dont-email.me; posting-host="eb7bbdb167610b927f5cc441f8d68591";
logging-data="2002214"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19Asw4j8OtLouq6yc3A6VvTEVKyWkCXzdg="
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101
Thunderbird/102.10.0
Cancel-Lock: sha1:RsG54RI8BVEsTnQ+tR9oQYeHaJM=
In-Reply-To: <25ddc2eb-c7ba-4f5a-86e4-d8b25200ec5an@googlegroups.com>
Content-Language: en-US
 by: Timothy Chow - Sat, 15 Apr 2023 03:55 UTC

On 4/14/2023 6:18 PM, peps...@gmail.com wrote:
> I have a dull-as-ditchwater construction problem.
> Construct a money position where the optimal checker play is unique but
> where the loss in equity from choosing the second-best play is as small
> as possible.

My intuition is that this is almost equivalent to the
task of constructing a position where the player on roll has
the smallest possible nonzero winning probability. The best
candidates for that problem are nearly hopeless pure races,
where the underdog has to roll boxcars over and over and the
favorite has to roll 21 over and over. I would imagine that
a small variant of that position would yield an excellent
solution to your problem. For example, if the favorite
misplays a 21 then that's not going to cost much equity.

---
Tim Chow

Re: Most tedious problem imaginable

<9082c04f-1d34-4409-bef5-82ab4700b553n@googlegroups.com>

  copy mid

https://www.novabbs.com/interests/article-flat.php?id=11810&group=rec.games.backgammon#11810

  copy link   Newsgroups: rec.games.backgammon
X-Received: by 2002:a05:622a:40cf:b0:3ea:ab64:a56e with SMTP id ch15-20020a05622a40cf00b003eaab64a56emr1595869qtb.1.1681557059230;
Sat, 15 Apr 2023 04:10:59 -0700 (PDT)
X-Received: by 2002:a05:622a:1884:b0:3bf:cdf8:61f4 with SMTP id
v4-20020a05622a188400b003bfcdf861f4mr2574381qtc.4.1681557058998; Sat, 15 Apr
2023 04:10:58 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!proxad.net!feeder1-2.proxad.net!209.85.160.216.MISMATCH!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: rec.games.backgammon
Date: Sat, 15 Apr 2023 04:10:58 -0700 (PDT)
In-Reply-To: <u1d770$1t396$1@dont-email.me>
Injection-Info: google-groups.googlegroups.com; posting-host=217.155.59.144; posting-account=X1j9wgoAAADLt4UnZrIneT3jwl9HvLMd
NNTP-Posting-Host: 217.155.59.144
References: <25ddc2eb-c7ba-4f5a-86e4-d8b25200ec5an@googlegroups.com> <u1d770$1t396$1@dont-email.me>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <9082c04f-1d34-4409-bef5-82ab4700b553n@googlegroups.com>
Subject: Re: Most tedious problem imaginable
From: pepste...@gmail.com (peps...@gmail.com)
Injection-Date: Sat, 15 Apr 2023 11:10:59 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
 by: peps...@gmail.com - Sat, 15 Apr 2023 11:10 UTC

On Saturday, April 15, 2023 at 4:55:15 AM UTC+1, Timothy Chow wrote:
> On 4/14/2023 6:18 PM, peps...@gmail.com wrote:
> > I have a dull-as-ditchwater construction problem.
> > Construct a money position where the optimal checker play is unique but
> > where the loss in equity from choosing the second-best play is as small
> > as possible.
> My intuition is that this is almost equivalent to the
> task of constructing a position where the player on roll has
> the smallest possible nonzero winning probability. The best
> candidates for that problem are nearly hopeless pure races,
> where the underdog has to roll boxcars over and over and the
> favorite has to roll 21 over and over. I would imagine that
> a small variant of that position would yield an excellent
> solution to your problem. For example, if the favorite
> misplays a 21 then that's not going to cost much equity.
>
> ---
> Tim Chow
Yes, that's a great way to get a candidate solution.
The problem is almost certainly unsolvable.
I think the standard most-unlikely-loss position is:
Favourite has 14 checkers on their 3 point and one
on their ace point. The underdog has 15 checkers on their 22 point.
The underdog is on roll.
Misplaying the underdog's initial roll is probably a bad idea as the extra
backgammons suffered by the underdog are likely to be significant.
So the underdog should be given a 33 and play that optimally.
Now it's not clear to me that, if the favourite rolls a 21, there is any loss
of equity by misplaying. But anyway, it's not an interesting problem, and this
is certainly a good approach for anyone who is desperate to waste time
on this issue.

Paul

1
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor