Author: Bo Persson
Date: 04:07:58 08/18/02
Go up one level in this thread
On August 17, 2002 at 19:50:25, William H Rogers wrote: >The main reason for making chess programs run fast is that they have to examine >millions of moves and that all takes time. The faster a program run the deeper >it can examine all of the possible moves on the table. Even if you had the most >sofistecated evaluation routine, you would still want the program to run as fast >as possible to insure that you had chosen the best move available to you program >in the allowed amount of time, reguardless of how deep you searched. >Bill But the idea here is that if you have an extremely sophisticated evaluation, you might not *have* to search millions and billions of stupid moves to find the good ones. The only problem is that nobody seems to know how to create this kind of evaluation. Research opportunity! Bo Persson bop2@telia.com
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.