Author: Charles Roberson
Date: 15:25:49 01/04/06
Go up one level in this thread
Here's an anlogy that seems to work. You have a large group of swimmers jumping into a lake at the same time to race to someother point. Amongst that group of swimmers are two individuals that believe they have plotted a better path to the other point. The difference between the two swimmers is one is a stronger swimmer (the 2nd strongest in the field (deeper search for chess)) while the other is about average for the field. Each wanted to use their "better" navigational skills to gain an edge of the opponents (similar to the PE in chess). Both swimmers, at the start, are in the middle of a dense pack. The weaker swimmer can not break free of the pack and is thus forced to follow the common path. However, the stronger swimmer can swim over, under and around to break away from the pack. However, unbeknownst to the two swimmers their more efficient path is less efficient due to currents or something. Thus, the weaker swimmer (speed/depth of search) finishes before the stronger swimmer.
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.