4 ms·

So this is basically "early search-tree pruning"? Or, how is it different from that, exactly? (I believe early search-tree pruning has been used in chess algori

So this is basically "early search-tree pruning"? Or, how is it different from that, exactly? (I believe early search-tree pruning has been used in chess algorithms for years.)

sp332 8y ago
It samples from the data randomly, which can be massively parallelized. As it runs, it adapts the distribution that it samples from, which is similar to pruning.
- LyndsySimon 8y ago
  > It samples from the data randomly If this is true, then it's not an "optimization algorithm" at all.