I like using word association as a game. It’s quick to learn, doesn’t need any equipment, and it’s no problem to join or leave the table whenever you like.

Try to get from some word (eg HOME) to some other word (eg SUMMIT) taking only small, obvious steps.

Each step should make a pair of terms that “obviously” fit together. They can fit together because they sound similar (HOME -> ROAM), or they are written similarly (HOME -> HOLE), or have an obviously-related meaning (HOME -> AWAY)… anything that makes sense to the group.

You can take turns around a circle. When it’s your turn, you announce the next link. If anyone thinks the link isn’t small enough or obvious enough, they can object and you’ll need to pick a different link. Then it’s the next person’s turn.

You can play competitively if you like (the person to reach the target word wins) but it also works fine without announcing a winner.

Ha, I missed that part. Subtle.

What does Willow (1986) have to do with data? Isn’t it, like, a sword-and-sorcery fantasy movie?

Oh I bet there’s a character with a name that sounds like the word “data”.

!science_memes@mander.xyz discussed long-term storage:

https://mander.xyz/post/26896717

(dunno if linking to a post is going to work, let’s see)

Color codes will pass through pipes just like any other output.

In this case, your grep is being smarter than you want and actually parsing the incoming color codes itself.

You can try a simpler program like head, tail, or even sed -n /ii/p to see it for yourself.

You can also control GNU grep’s color processing with --color but you may not find exactly what you seek.