• 6 Posts
  • 336 Comments
Joined 3 years ago
cake
Cake day: June 12th, 2023

help-circle





  • Auto-complete is a legitimate valuable technology and I’d buy the argument that LLMs made for a much better auto-complete (in some situations).

    No one’s going to think that a better auto-complete is a trillion dollar technology, though, so they instead wrapped it in a chat interface so you get a better ELIZA and can use that to fool people into thinking it’s more than what it is.


  • They had to retract three of the findings almost immediately.

    That tells me you can’t rely on whatever model they are using and instead they’re more likely just generating a much larger set of (mostly wrong) random results and then trying to filter out the invalid ones.

    The dump is large enough that there should probably be some legitimate results in there, but that’s just emulating a million monkeys hammering away at a million keyboards.




  • The enemy of your enemy is not your friend.

    Don’t defend Hamas, they’re bad too.

    Moreover, by defending them you’re reinforcing the Israeli lie that the genocide is a war against Hamas.

    It’s not; it’s a genocide being committed against the Palestinian people, and has been since before October 7.

    So don’t buy into the framing pushed by the people committing genocide.

    Instead, center the Palestinian people.

    Focus on their rights and their humanity, and condemning the crimes being committed against them.



  • Solved the words but couldn’t figure out the path to a 5-star. Good luck!

    There’s actually a winning strategy for Waffle that will guarantee that you always get 5 stars (except when you get sloppy or take short-cuts as is human nature):

    Expand if you want to know what it is

    As you hinted at, the first step is to figure out all 6 words. You have to do that before making any swaps.

    Then, it comes down to figuring out the optimal set of swaps.

    … but the key to that is that there is not 1 optimal sequence of swaps, but rather multiple equivalent ones.

    This comes from the fact that you can re-order some of the swaps in an optimal sequence and still have an optimal sequence.

    So, the key is to figure out which swaps have to be in any optimal sequence, and then do those first.

    Specifically:

    1. If there is only one of a given letter in the puzzle (or only one left), then move that directly to its destination space.
    2. If there are two letters that are each in the other’s destination (e.g. an “a” where there needs to be a “b” and a “b” where there needs to be an “a”, then swap those.
    3. If every one of a given letter needs to be swapped with the same letter (e.g. every “a” is in a space that should contain a “b”, or every “a” is supposed to go to a space that currently has a “b”), then you can just move all of those letters to their given destination.

    Go through these steps repeatedly, and as you do new opportunities to apply these same steps show up, so you apply them again.

    This will almost always get you to a solved puzzle.

    The ones where it doesn’t wind up taking you to a simple enough state that you can just solve the remaining swaps by brute force.