Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Tree reduced by 10% now

Author: martin fierz

Date: 07:19:38 04/02/04

Go up one level in this thread


On April 01, 2004 at 14:16:22, Artem Pyatakov wrote:

>On April 01, 2004 at 13:11:14, Pallav Nawani wrote:
>
>>Would care to you elaborate a little? What do you mean by the most 'pouplar'
>>move or how is your method different than just having 4 killer moves?
>>
>>Pallav
>
>Pallav,
>
>Good to know somebody in this forum still cares about computer chess programming
>and little advances in the search :-)

i guess lots of people care here :-)

i find your ideas interesting, i simply haven't tried to implement them yet,
because my killer scheme works slightly differently than that used by everybody
else. but i will try one day...

a question related to your move ordering with many killers: how good is your
move ordering overall (FH-ratio)? a program which has very good move ordering
due to all kinds of tricks won't gain as much with a more clever implementation
of killers than a program with practically no move ordering at all.

you must certainly be using a hash move, and then what else?
-> history? (and what type? from-to or from-to-piece or?)
-> SEE or MVV/LVA?
-> further static move ordering with PST?
-> further move ordering with other tricks?

cheers
  martin



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.