Author: rasjid chan
Date: 10:42:36 08/30/05
Go up one level in this thread
It is strange I read this the first time, must be not popular. Can we do an enhanced history heuristic by counting how often B(from2,to2) refutes A(from1,to1) when move B causes a beta-cutoff? short counter_cmh[64][64][64][64]; This seems a huge array! Is it OK? But it may be more reliable than history alone. If B is knight followed by A queen, such patterns may happen often in the current chess tree and likely to be a "cutoff" pattern again and used for move ordering. As other pieces could have changed positions, there may not be a direct hashing. Can we also do counter-move reduction instead of history reduction? There is a sequence of 3 moves A, B, C where C causes a first-time-cutoff and we increment the "first-time-fail-low" counter derived from A,B and use it for reductions. Thanks Rasjid
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.