Author: Bas Hamstra
Date: 05:34:37 09/01/02
Go up one level in this thread
>>Heyyy Tony! :-) >> >>Just for a comparison: >> >>- Well, aspiration we agree. > >In other words you always start iterations >with search(-infinite,infinite,depth)? Yes, that is correct. The second move with [a, a+1]. In case of a FH I research with full [a,b] window. >>- History I'm not sure, though I still use it. Some say piece square sorting >>is a good alternative. > >What do you mean? Do you mean having a smaller table of piece,square instead >of a table of square,square? No, although what you mention is *also* a nice idea that might work better than the standard way. It takes into consideration that a certain piecetype is good at a certain square, regardless where it came from. Sounds good. But what I meant was sorting on the basis of "centrality", moves that go to the centre first, moves away from the centre last. ><snipped> >>- FP I don't believe in. You? > >Is FP forward pruning? >I use pruning based on evaluation,remaining depth and other conditions. No I meant strictly the futility pruning myth :-) Best regards, Bas.
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.