Author: Frank Schneider
Date: 12:55:50 04/01/98
semi Aprils fool idea to solve tactical tests faster:
Testpositions can be characterized as positions with one
superior move that looks bad at first.
An idea to find solutions one iteration early is this:
Search move 1 of every ply to depth n as usual
Search subsequent moves as usual to depth n with a (beta, beta+1)
window
research each move to depth n+1 with a (beta+x, beta+x+1) window
This research will be cheap if it fails, but it if not it is quite
likely the solution and
1) it is found one ply earlier
2) since the window is (beta+x, beta+x+1) instead of (beta, beta+x),
the search (and research with (beta+x, infinit) is cheaper
This works for testpositions only, I'm afraid .... :-)
Frank
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.