Author: leonid
Date: 11:47:24 11/19/99
Go up one level in this thread
On November 19, 1999 at 07:46:33, Antonio Dieguez wrote: >On November 18, 1999 at 18:24:30, leonid wrote: > >>On November 18, 1999 at 11:40:31, Bas Hamstra wrote: >> >>>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. >> >>Since your moves ordering is so different from mine would like to ask you two >>questions: >> >>1) What is BM from hash (best move from hash table?)? >>1) How many nodes per ply your logic is forced to see, in general, when search >> goes by frute force? When in ply we have around 30 nodes. >> >>I am asking you this because beside my different moves ordering, I have the >>impression that mine is still very far from perfection. >> >>My moves ordering start with the moves that lead to check. This give you the >>idea how my moves ordering should be different from your. >> >>Leonid. > >hi again leonid! > >about the issue of try the moves that check the opponent first, wich is rare, I >still dont think its best.Its true that the tree of them is smaller, but if for >example the oponent in the next move only have three or less available moves you >would like to extend and see the continuation with may be 1 ply more right? so >the tree is bigger.Its good to extend I think... but if you dont extend its your >decision. > >me About checking moves first. Believe me or not, I am more surprised that you are that other people don't do the same. Reason for this - I wrote all my logic practially alone. About how much it have sense? Huge difference! I don't speak about my feeling here but about statistics. Can't give exact numbers now but when it was done difference went as much as 100% in 8 plys deep "brute force", "fixed depth", "no extensions" search. Leonid.
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.