Author: Torstein Hall
Date: 13:02:26 10/03/01
Go up one level in this thread
What if you run two paralelle search/chess processes. One going very fast with very little evaluation. The other going slow, with a big evaluation. The fast one always start searching on the move calculated by the slow process with the big evaluation, just checking for big materiall loss, tactical stupidities further down the tree. If it find one, the fast process sends a message goes back to the slow process and tells it do start work on the next best move. Then you perhaps can have the best from two "worlds". Intelligent search, with no tactical blunders! Torstein
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.