Author: Matthew White
Date: 13:04:55 03/10/03
Go up one level in this thread
On March 10, 2003 at 13:44:48, Alvaro Jose Povoa Cardoso wrote: >In Ed Schröder's web page about chess programming, he says he uses the "Historic >Mate Killer", in other words an history heuristic wich considers only moves with >a mate score. >Is seems to me that this scheme should have little benefit in the openging and >middle game phases, because here it is dificult to reach mating moves. >In the endgame that would be a different story I think. >Why doesn't he use a normal history heuristic in all phases? > >Any comments on this? > >Regards, >Alvaro Cardoso In nearly any position you choose, there can be mating possibilities. This heuristic would make cheaper to avoid mate IMO. I would think that avoiding mate would be useful more often in middlegame situations than in endgames, since developing an effective attack could lead to mate before an endgame ever occurs. Just a guess. Regards, Matt
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.