22.8.20

Stop Making Sense

b1-66er: "...approximately 20 different fires merged into three major fires that now comprise the S.C.U. Lightning Complex, which is around Santa Clara and Alameda counties."
"The C.Z.U. Lightning Complex fire, concentrated in San Mateo and Santa Cruz counties, has so far consumed over 63,000 acres.."

Special K: I'm following those fires closely. 
SCU is east of San Jose. CZU is Santa Cruz mountains. 

b1: What's your favorite lightning complex? 

K: The one that doesn't burn my house down. 

19.8.20

Just imagine the chocicles!

b1-66er: "A Swiss Town Was Covered In Chocolate Following A Slight Malfunction At A Lindt Factory"

Special K: "Slight"

b1: You know what they call it if it's hot the next day...
...a "meltdown."
"If only all mistakes could be so magical."
"Well, one Swiss town was truly LIVING THE DREAM this past week when a malfunction at a chocolate factory caused magical flecks of chocolate to fly through the air."
"As a result, chocolate nibs, which it described as crushed cocoa beans, flew through the air and thanks to some strong winds, coated some of the town in chocolatey goodness."

K: Similar around here today, except with ash. 
I personally didn't see any. 
I'd rather have chocolate. 

b1: Ash and chocolate doesn't feel like the right idea to me.

K: Yeah. Bad combo. 

b1: Depends on light or dark. 
Dark, I prefer chocolate. 
Light, I prefer ash.
Black beans matter. 

K: That's dark matter. 

16.8.20

Let's say a bear takes an axe, a deck of cards, a doubling cube and a chess board into the woods...

Karpov: Super-interesting discussion of luck in chess vs backgammon, attributed to [Bill] Robertie. 

Best way I saw it put is [by] Robertie…

'Chess is also a probabilistic game but there is no obvious source of randomness so people don't notice [] it is a probabilistic game. [Where it is, in fact] as probabilistic as backgammon but in a different way.
Let's suppose Gary Kasparov, a 2800 player, goes up against a Grand Master who is a 2600 player. If they play a number of games over [] time, Kasparov is going to win 3 out of 4 of the decisive games pretty reliably. He's not going to win them all even though he's clearly the better player. And if Kasparov plays somebody [] he's 400 points better than, he'll win 90-odd percent of the time, but the other guy will win a few.
Why is this happening? It looks the same as if you put two backgammon players, playing 25-point matches, against each other. You'd see the same distribution. You'd see the better player winning a higher percentage, and it would be a pretty steady percentage over time, as long as their skill remained constant.
If you stuck these players in black boxes, [] all you knew from the outside is over here in Box #1 the results go WLWWWLWL and over here in Box #2 the results go WWLWWWL[. Which] box has the two chess players and which box has the two backgammon players? You can't tell the difference. You just get these strings of results and somebody is winning most of them but not all. It's obvious why this is happening in backgammon because you have the dice going on. But why is it happening in chess?
Chess is like this. Imagine it is dark and you have two people with flashlights. One guy has a big flashlight with a wide beam and the other guy has a little flashlight with a narrow beam. [Out] in front of them is a forest, and in the forest is
some treasure. You say to each player, "Okay, you guys go [] in the forest and first one to find the treasure wins." Well, the guy with the big flashlight is the favorite to find the [booty], but it's no guarantee, because the other guy could luck his way and find it [first].
And a game of chess is like that. You look at this position, and there are all these variations [] string out in front of you. You know, "I could do this, or I could do that. And I've only got time to analyze three of these ...." You're searching this tree of possibilities. Depending on how fast you think and how much you know about the game, your tree search is more efficient but it's not guaranteed to get you to the best answer.
The other guy, who's maybe clumsy[,] doesn't think as fast as you and doesn't know as much about the game, could still walk into the main variation almost by chance. That's where the chance in chess comes from. It's entirely invisible. In fact you might feel a little uncomfortable even referring to it as "chance." But [really that's] what's going on, two people basically searching a tree at different speeds.
They are still trying to find the main line, the line [describing] correct play on both sides. The better player mostly searches it better[,] but not always.
That makes chess a probabilistic game, [] that means it's got a lot in common with these other games, such as backgammon and poker.'

7.8.20

A frat dog by any other name

b1-66er: <pic>

Special K: That's fantastic. 

b1:Who's a good doggie? 
Who IS a good doggie?
That's right!
You are!

K: Is he though?

b1: Without the party hat, I'm less sure. 
I wouldn't let him box my kittens. 

K: Yeah. The hat is the great equalizer. 

5.8.20

Brain must be yuZed

Special K: <pic>

b1-66er: I assume it scrolls to:
vöuv must Bear hands -& feet