Author: Bas Hamstra
Date: 08:40:31 11/18/99
Go up one level in this thread
On November 18, 1999 at 08:35:56, Antonio Dieguez wrote: >On November 18, 1999 at 06:41:49, Bas Hamstra wrote: > >hi Bas, > >>My program uses incremental move generation, in the sense that 1 move at the >>time is generated. I too think the advantage over staged generators (eg. only >>captures) is small, if any at all. > >and which is the move ordering in your program? > >>Bas Hamstra. I have one old complete program and 8 incomplete testbeds :) The complete program uses this: - BM from hash - Non losing caps sorted MVV and within that LVA (so not quite MVV/LVA) - 2 Killers - Non caps unsorted - Losing caps That's it. I see no need for history sorting, nor for SEE sorting. It uses incremental peudo attack updating, that basically makes you have all captures at hand at any time. And a cheap SEE. And cheap Check-checking :) Regards, Bas Hamstra.
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.