3 ms·
The same applies to proof search. Once you fix a finite foundational set of axioms the game proceeds exactly as in chess.
by measurablefunc 1y ago
The same applies to proof search. Once you fix a finite foundational set of axioms the game proceeds exactly as in chess.
- wizzwizz4 1y agoYou can't use minimax with alpha-beta pruning for proof search, but that's sufficient to play chess at a high level. I don't see what you're seeing. Chess and mathematics are completely different kinds of problem.