The Lounge is rated PG. If you're about to post something you wouldn't want your
kid sister to read then don't post it. No flame wars, no abusive conduct, no programming
questions and please don't post ads.
I just computed the number of solutions (all solutions, not optimal ones) to the problem where this[^] was a solution (ie all coverings of the yellow cells with rectangles):
Scissors cuts paper, paper covers rock, rock crushes lizard, lizard poisons Spock, Spock smashes scissors, scissors decapitates lizard, lizard eats paper, paper disproves Spock, Spock vaporizes rock, and as it always has, rock crushes scissors.
I did some work in that direction recently (also the Exact Cover variant, which turns out to be easier). It makes some pretty pictures, like this[^] (Set Cover variant) and this[^] (Exact Cover variant).
Spoiler alert: I solved it with ZDDs. Runs in about two seconds. Half a second for the Exact Cover variant.
Is that interesting enough to write an article about? I've got some stories about trade-offs and design decisions, and pretty pictures of the results.
My daughter was thrilled when Matt Smith came on stage for this one - we had sacked off Stevie Wonder to see Orbital on the Other Stage - I have seen Orbital many times (including every performance at Glastonbury) - they do a very good show - the two chaps in the band have the surname Hartnoll - as did an early Doctor
Last Visit: 31-Dec-99 18:00 Last Update: 28-Jun-17 8:48