Author: Uri Blass
Date: 17:32:10 01/28/06
Go up one level in this thread
On January 28, 2006 at 19:58:36, George Tsavdaris wrote: >On January 28, 2006 at 19:46:09, stuart taylor wrote: > >>Even at ultra long times for each move, if the best move is found, then that is >>already perfection, and we just need to wait for more computing speed. > >Do you ask for _absolute_ perfection on the choice of the moves? >Then you will have to wait not 100 hours, but rather wait our Sun to be >destroyed and rebirth again....! >And not with the current programs. But with a poor minimax engine..... The poor minimax engine will never be able to solve it in a reasonable time. I do not expect it to happen in the next 10 years but if it happens later it is not going to be by the poor minimax engine but by engine that has some function to detect illogical moves and to prune them so it is not going to need to search all moves(of course it will need no errors in detecting illogical moves and even after this process that is hard programming task the tree is too big and memory too short for the computers of today. Uri
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.