3 ms·
Well, it's a finite space, and with a big enough lookup table then a chess engine will always win.
by yters 8y ago
Well, it's a finite space, and with a big enough lookup table then a chess engine will always win.
- pedrosorio 8y agoIf you're truly not aware of the issues with optimizing problems in "finite spaces", I recommend you take an online course in: https://en.wikipedia.org/wiki/Combinatorial_optimization https://en.wikipedia.org/wiki/Combinatorial_optimization
- derangedHorse 8y agoHis argument still stands. The fact that combinatorial optimization is difficult doesn't change the fact that the problem space is finite and can theoretically be enumerated by a very fast computer with lots of space. This also means that the heuristics that are typically used (that dramatically reduce the problem space at a rate tied to the size of the problem) can make the exploration of potential solutions much easier than it once was.