Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hardware or software??

Author: leonid

Date: 16:07:17 03/06/00

Go up one level in this thread


On March 06, 2000 at 18:14:30, Tom Kerrigan wrote:

>On March 06, 2000 at 17:28:12, leonid wrote:
>
>>It was real fun. I thought that I spoke to the Heiner and was astounded when he
>>said that putting the checking moves at the head of the line had no sense
>>whatsoever. This is why I have asked before if you use in your mate solver my
>>kind of alignment.
>
>I don't have a mate solver.
>
>>Mistake from my side that I have forgotten that in alpha-beta we see each ply
>>two times. Exception only some positions that have only one response in the
>>frist search. And if in each ply we see only around 2, 3 or 4 moves, your logic
>
>Alpha-beta does not visit positions twice. I don't know what you're talking
>about when you say "we see each ply two times" and "first search." I only do one
>search. (Unless you count iterative deepening.)


Tom, don't use with me too sofisticated wording. It can be that "iterative
deepening" correspond to my two line search. My logic see (if this is really
good way to do so) first search where she find, as I said, moves from which
final choice must be done later. Sometime it is only one move available, then no
farther search is required. Very often, just in the middle of the game, number
of the moves to choose later can go up to the 15 or 20. Here lost of time in
second revision is considerable. And this is in shortening of this second
revision that some speeding is possible. It is true also that final move could
be found in one line search but in total it will make you lose a lot of extra
time. All the difference will be in what is in my logic "maximum" that is in
only one line search will be put to maximum all the time. In two line  search
this first "maximum" is not put automatically to the biggest maximum.



>>metioned before. In more positions have the advantage of time but general time
>>disadvantage. This is probably derive from the logic that checking moves must go
>
>You can't have the advantage and the disadvantage at the same time.


You can. If you find the advantage in 10 position is equal to 10 seconds but in
two bad positions you loose 20 seconds, here you have all this strange paradox.
Alining of moves with the checking moves at the head give this strange and very
big advantage from time to time.


>>only around 2, 3 or 4 moves (very often just one move). Probably in order of
>>reducing actual branching factor to more good one it must be done in second
>>revision. There practically you must see what moves between the "good moves" is
>>the best one. In this case some limitation of the moves seeing inside of the
>>final revision could be done without putting that much the final result to big
>>danger.
>
>I don't know what you mean by "second revision" or "final revision".


Tom, for sure I must go and learn finally all this official wording with the
reading of the theory in the same time. You indicated this need to me one more
time.


If you could rapidly say me how you look for the final move with the alpha-beta
it will be also helpful. Maybe by reading your description I will find if the
difference really exist. It is all the time possible. My logic was almost 100%
came from my head. Sometime it is not enough. I still remember that when I read
very rapidly some description of your game, with your help, I found that
difference is simply amazing. I never expected that it could be so big.

Leonid.


>-Tom



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.