Author: Tom Kerrigan
Date: 15:41:07 12/10/99
Go up one level in this thread
In an ideal world, a chess program would try all the possible move sequences in a game, and pick a move based on that analysis. In the real world, trying all the possible move sequences takes WAY too long. But it is possible to try the sequences that are only a few moves long. The problem is that after only a few moves, the game usually isn't over. So you have to guess what would happen if you tried all the moves. So people make static evaluation functions, which guess the outcome of the game without making any moves (hence the word "static"). They typically count up all the material and some positional aspects, like doubled pawns and exposed kings. -Tom
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.