I’m not taking a stance on “Othello is solved”, but offer a digression about a lookup table being a valid solution to a tractable problem, or its subproblem. I

I’m not taking a stance on “Othello is solved”, but offer a digression about a lookup table being a valid solution to a tractable problem, or its subproblem. I don’t see a lot of people saying this (not parent either), but I know that many hope for closed-form solutions to things, even secretly. It just dang doesn’t look that way anymore. Weird when a finite set is sufficient to prove subproblems that cover a perplexingly different or larger domain. Whether a proof is accepted or not, we’ll still kinda wonder on the structure of special cases in computational complexity. They seem to work unreasonably well, and we rarely find them by hand/brainmeat.