Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: 3 mating problems - How much time your programs take?

Author: Jari Huikari

Date: 03:29:06 08/18/00

Go up one level in this thread


On August 17, 2000 at 19:41:37, leonid wrote:

>On August 17, 2000 at 09:08:33, Jari Huikari wrote:

>How your program solve the mate? Some special part that is probably must be
>called "mate solver", or something like "check extension"?

Nero 5 don't have any special solver for mates. They are found during it's
ordinary game tree search.

Nero 4 has "forced mate finder" which is used before ordinary search. It
looks for lines in which opponent has only one legal reply to each Nero's
move. (Like the mate in 8 of the third position I sended.)

Usually the "forced mate finder" takes almost no time. But in some position
it worked too slowly, and I added a time limit that it leaves enough thinking
time for ordinary search too.

In Nero 5 I don't have that feature any more (or yet?) Because I noticed that
those forced mates don't exist very often in games.

In Nero 5 I extend one ply in ordinary search when I find somewhere only one
legal move for either side. (E.g. that mate in 8 is found in searchdepth=8
with 7 extensions.) It's slower in finding some mates, but it also finds
forced lines to capture pieces.

					Jari



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.