Path: csiph.com!x330-a1.tempe.blueboxinc.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!feeder.news-service.com!news2.euro.net!newsgate.cistron.nl!newsgate.news.xs4all.nl!194.109.133.85.MISMATCH!newsfeed.xs4all.nl!newsfeed6.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail
DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :cc:content-type:content-transfer-encoding; b=McZlkRtJPgXXfWVGWkm6n4kQYKgDRqYhK002hA/b1yvAa7BYEKfHuA6IYFGdmxVh1/ NVxur6npQm1cjAP0WNGnRtmUeR7JawJSixGRCZLd2wn+aeFrKjeUu2JCNN7Nv8vv3Rzm jiUGSaJvhkXPVHLdRNeBgyJSa6urSIKxSNAxM=
MIME-Version: 1.0
In-Reply-To: <4dc428f2$0$29991$c3e8da3$5496439d@news.astraweb.com>
References: <69c1813d-1a9a-4686-9768-8ec1910a45f8@d19g2000prh.googlegroups.com> <4dc428f2$0$29991$c3e8da3$5496439d@news.astraweb.com>
Date: Fri, 6 May 2011 10:43:06 -0700
Subject: Re: Coolest Python recipe of all time
From: geremy condra <debatem1@gmail.com>
To: "Steven D'Aprano" <steve+comp.lang.python@pearwood.info>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Cc: python-list@python.org
Precedence: list
Newsgroups: comp.lang.python
Message-ID: <mailman.1257.1304703790.9059.python-list@python.org>
Lines: 73
NNTP-Posting-Host: 82.94.164.166
Xref: x330-a1.tempe.blueboxinc.net comp.lang.python:4842

On Fri, May 6, 2011 at 9:59 AM, Steven D'Aprano
<steve+comp.lang.python@pearwood.info> wrote:
> On Mon, 02 May 2011 10:33:31 -0700, Raymond Hettinger wrote:
>
>> I think it is time to give some visibility to some of the instructive
>> and very cool recipes in ActiveState's python cookbook.
> [...]
>> What are your favorites?
>
>
> I'm not sure if favourite is the right word, but I'm amazed by this one:
> McCarthy's "amb" (ambiguous) operator.
>
> http://code.activestate.com/recipes/577368
>
> Here's how I might use it to solve the problem if making change. In
> Australian currency, I have 5, 10, 20, 50 cent and $1 and $2 coins.
> Ignoring the dollar coins, how can I make up change for any multiple of
> five cents up to a dollar?
>
> Suppose I have more 5 cent coins that I can deal with, and I want to make
> sure I hand out at least three of them. Here's how to make 45 cents worth
> of change:
>
>>>> amb =3D Amb()
>>>> a =3D amb(range(3, 21)) =A0# number of 5 cent coins
>>>> b =3D amb(range(11)) =A0# number of 10 cent coins
>>>> c =3D amb(range(6)) =A0# number of 20 cent coins
>>>> d =3D amb(range(3)) =A0# number of 50 cent coins
>>>> for _ in amb(lambda a,b,c,d: 5*a+10*b+20*c+50*d =3D=3D 45):
> ... =A0 =A0 print a, b, c, d
> ...
> 3 1 1 0
> 3 3 0 0
> 5 0 1 0
> 5 2 0 0
> 7 1 0 0
> 9 0 0 0
>
>
> Suppose I have some words, and want to put them together so that there
> are a certain number of vowels:
>
>>>> amb =3D Amb()
>>>> a =3D amb(['quick', 'slow', 'hungry', 'wise-old'])
>>>> b =3D amb(['fox', 'hare', 'turtle', 'kangaroo'])
>>>> c =3D amb(['lazy', 'stupid', 'sleepy', 'confused'])
>>>> d =3D amb(['dog', 'aardvark', 'sloth', 'wombat'])
>>>>
>>>> def test(a, b, c, d):
> ... =A0 =A0 s =3D "The %s brown %s jumped over the %s %s." % (a, b, c, d)
> ... =A0 =A0 num_vowels =3D sum(s.count(c) for c in 'aeiou')
> ... =A0 =A0 return num_vowels in (12, 18, 19)
> ...
>>>> for _ in amb(test):
> ... =A0 =A0 print a, b, c, d
> ...
> quick fox lazy sloth
> quick fox lazy dog
> quick kangaroo stupid aardvark
> [...more solutions cut for brevity]
> hungry kangaroo confused aardvark
>
>
>
> As written, amb is just a brute-force solver using more magic than is
> good for any code, but it's fun to play with.

I use a similar technique *a lot* for various kinds of constraint
solvers, but I have yet to come up with a really satisfying spelling
for it. Have you looked at the way this is done in Sage?

Geremy Condra