![]() Wait, what are the two words in the "portmanteau." I thought "fun" + "confetti". This includes FUNFETTI, which I know somehow, how? ( 1A: Colorful Pillsbury cake with a portmanteau name). It was the only thing in the grid that wasn't familiar to me. Still, today, no idea, so I just got it all from crosses. I definitely used it as Word of the Day before, because I remember the little puzzle-solving animation (above). I laughed when I looked up TOWER OF HANOI after I'd finished solving because I realized instantly that I have "never heard of this answer" at least once before. I liked this puzzle too! A constructor's generational similarity isn't the only factor in puzzle groovability. I like puzzles by all kinds of people, but it's not terribly surprising that my favorite constructor of Friday puzzles, Robyn Weintraub, is approximately Rex years old. ![]() she looks much more like my daughter than she does me, so maybe, Maybe, generational similarity matters, and it's simply more likely that you'll groove on a puzzle made by someone your own age than by someone who isn't. Also, the constructor appears to be a young woman, i.e. "I WAS TOLD THIS WAS EASY!" Well it was easy, but not ridiculously easy, so I think my daughter's just better at solving than she thinks. But I knew this puzzle was "Easy" before I even started, so then of course I'd get frustrated with myself when any answer gave me trouble. Who could foresee such betrayal!? Et tu, Ella!? Anyway, I'm proud of her Saturday accomplishment (I couldn't finish a Saturday puzzle at all until I'd been solving for years) (they were harder back then, but still). It's the raison d'être of the entire Internet-ruining things you love, or might love, before you've even had a chance to enjoy them. Don't blame social media-That's Where People Go To Spoil Things. I have learned that when it comes to "spoilers," I have only myself to blame. I don't want even the tiniest bit of information or inference in my head. Once the puzzle comes out (at 10pm the night before), I don't look at social media til I'm done solving, precisely so that I know Nothing about the puzzle when I sit down to solve it. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2 n − 1, where n is the number of disks. With 3 disks, the puzzle can be solved in 7 moves.
0 Comments
Leave a Reply. |