Author: Bob Durrett
Date: 07:21:38 12/18/02
Go up one level in this thread
In the discussion about opening books, the following appeared: <snip> For example, if it is playing for a win, it should eliminate >all drawish lines (i.e., set their probability to 0) from the list of choices. <snip> This prompts the question as to whether or not it is feasible to modify a chess engine so that it would "play for a win" in the middlegame. For example, when the chess engine is examining a position to identify good moves from that position, perhaps it is possible to weight the move values, giving greater weight to moves that seem to offer winning chances. Similarly, moves that seem drawish could be given less weight. Possibly, this idea could be extended to the search algorithm too. The exact method would depend on the algorithm. The idea is that, somehow, move sequences that offer winning chances would be given preference over drawish move sequences. [Note that a drawish move sequence might lead to a leaf node which received a higher evaluation score than the leaf node from the preferred move sequence.] Question: Is this feasible? Bob D.
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.