Computer Chess Club Archives


Search

Terms

Messages

Subject: How do your program search of all plys? Identical way?

Author: leonid

Date: 08:38:07 08/03/00


Hi!

In what way your program do its search of one given position? It see all plys in
absolutely identical way or not? Some kind of reusable procedure that work for
all plys, all the time the same way?

I have seen one program that give very high nodes per second rate for the end of
the game. Could never explain it in some credible way. One possible explanation
is that (just maybe) that this program switch at the end of the game to the
search of plys in homogeneous, identical way.

After what I could find by speeking to Herrigan (if my understanding is right)
that his program have reusable, identical search for all the plys. Bob H. said
me, few months ago, that it have specialized search in  one ply. And how about
you?

In my program existe 4 specialized plys but the most sriking difference are
just in two.

Diffenence between identical and "normal" search in my program (I just verified
one doubtful position) was between 228k and 339k per second. 48%.

Thanks for responding,
Leonid.



This page took 0.01 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.