Geeking : 4786


Off-Topic / Geek / 4786	4785 \| 4787

Subject:	Re: On the recursive subdivision of two-dimensional food items
Newsgroups:	lugnet.off-topic.geek
Date:	Mon, 16 Aug 2004 21:46:22 GMT
Viewed:	1067 times

In lugnet.off-topic.geek, Todd Lehman wrote: snip

Let e (epsilon) be the smallest bite size you are willing to eat, and consider the following pseudocode:

    Procedure Savor (Piece A)
        If the size of A is less than 2e
            Eat A.
        Else
            Subdivide A into two equal portions B and C.
            Hide B from yourself (the edge of the plate is fine).
            Savor C.
            Savor B.
        End If
    End Procedure

And what makes this even more impressive is that earlier in the evening, Todd gave every impression of a man so tired he couldn’t hit the ground two tries out of three (although I know a LEGO-on-my-mind powernap can do wonders).

:) Kelly

Message is in Reply To:

		On the recursive subdivision of two-dimensional food items
Last night at IHOP, after copious amounts of beer at Rocklands, a few of us were talking about how we cut our food up into differently-sized portions during the eating process, and I realized that an algorithm exists for maximizing the total (...) (20 years ago, 16-Aug-04, to lugnet.off-topic.geek, lugnet.events.brickfest, FTX)

14 Messages in This Thread:

Entire Thread on One Page:: Nested: All | Brief | Compact | Dots
Linear: All | Brief | Compact

Custom Search