@fawfulfan@chesscom Elon is right. A (strong) solution is a map from board to best move, and a position's value doesn't depend on the path into it, so counting games is pure double counting and 10^44 positions is the real number. Also, EXPTIME-complete is about n×n chess. 8×8 is one fixed instance.
@thinkingheights@jdlichtman Thanks for the clarification. Well that's kind of my point. If I can't inspect it and I can't even run it, then how can I trust it? At that point I'm just trusting whoever ran the check, which is like the original proof, only a few people had what it takes to verify it
@TCzajka Even for weak solving, the only real path is a cleverness we don't have yet, not a computation we can't afford. Pruning only shaves constants off 10^44
@Kasparov63 Countries with the most chess grandmasters also tend to have colder climates.
Apparently cold weather makes you better at chess. Or perhaps two correlated maps aren't a causal argument.
@minchoi This is cool for prototyping, but making a playable game is a production problem: levels, sound mastering, and art direction, to name a few. So I don't see how you can vibe your way to a shippable indie game, let alone a AAA game.
@SocialContractN 777? But also 897. Both of these fit 72, 105, 171, 288, 480 exactly:
f(n) = (n⁴+2n³+29n²+16n+240)/4 → next = 777
g(n) = f(n) + (n−1)(n−2)(n−3)(n−4)(n−5) → next = 897
5 numbers can't force a 6th, there can't be one valid answer!