Anyways, I've often thought about Super Smash Bros. (particularly, Melee) as a prime example of that idea.
1,443 karma · joined April 13, 2014
scientist.wang
Anyways, I've often thought about Super Smash Bros. (particularly, Melee) as a prime example of that idea.
> reasonable possibilities are too many to analyze, one is forced to pretty much guess.
You could say the same thing about chess, but an experienced player wouldn't, because they know which candidate moves are reasonable and which lines to delve into through intuition shaped by experience.
Similarly, you might say the same about poker. The possible hands your opponent has are actually quite large, but an experienced player can have a reasonable idea of the possible hands and their probabilities, which may involve eg ignoring most hands as unrealistic and bucketing hands into classes.
(and it could happen again: https://polymarket.com/event/another-dildo-thrown-at-wnba-ga...
https://polymarket.com/event/dildo-thrown-at-wnba-game-on-au... )
But that statement doesn't apply to the version of Dijkstra's developed in this paper right?
> Universal optimality is a powerful beyond-worst-case performance guarantee for graph algorithms that informally states that a single algorithm performs as well as possible for every single graph topology.
Wandb and React can get honorable mentions.
But the original content is talking about the past, not the modern era.
No part of this is true or even really makes sense.
It's been satisfying!