Chess tree looks like classical example. Each node is a boardstate, edges are allowed moves. Working heuristics in move evaluators can be understood as sort of theorem “if such-n-such algorithm recognizes this state, it’s an evidence in favor of white winning 1.5:1”. Note that it’s possible to build powerful NN-player without explicit search.
That’s interesting! What would be some examples of axioms and theorems that describe a directed tree?
Chess tree looks like classical example. Each node is a boardstate, edges are allowed moves. Working heuristics in move evaluators can be understood as sort of theorem “if such-n-such algorithm recognizes this state, it’s an evidence in favor of white winning 1.5:1”. Note that it’s possible to build powerful NN-player without explicit search.