2 ms·
But all algorithms that deterministically play a finite combinatorial game can be represented as a decision tree. (there may be other, far more succinct represe
by zodiac 5y ago
But all algorithms that deterministically play a finite combinatorial game can be represented as a decision tree. (there may be other, far more succinct representations)
- a-dub 5y agoahh yeah. still curious what the first node looks like though ... (and it it's similar across what people are finding)