Timeline for Is there a single best move in every position?
Current License: CC BY-SA 3.0
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 11, 2014 at 13:55 | comment | added | ThunderGr | @SilverlightFox Specifically about chess, the problem is expected to be solved before quantum computing. Chess is finite enough that current era computers should be able to process it with no significant problems. However, it is not likely that high-end computers will be devoted to something like chess anytime soon :) | |
Feb 11, 2014 at 13:34 | comment | added | SilverlightFox | Theoretically, the problem with the amount of calculation time is something that quantum computing would overcome. | |
Feb 4, 2014 at 15:06 | history | answered | ThunderGr | CC BY-SA 3.0 |