Author: leonid
Date: 18:57:47 05/02/01
Go up one level in this thread
On May 02, 2001 at 20:33:48, Paul wrote:
>On May 02, 2001 at 20:12:09, leonid wrote:
>
>>I asked you this because I expected that this time you went by brute force since
>>this position is 10 moves deep. So, your result is 100% right. You have good
>>program!
>
>Thanks!
I see not only that your program is capable of solving position, like last one,
finding in least number of moves the result but it is not afraid of solving
those positions to start with. Your program structure must be very solid.
>>This position happened to have very accessible branching factor for brute force.
>>To my surprise, it took only 38 min 25 sec to say that mate in 9 do not existe.
>>With hash at work it could be even shorter.
>>
>>I solved this position, just like you, by 10 moves selective search.
>
>You changed something in your brute force program recently, right? How much did
>that speed you up? Just curious!
You asked the right question since I tried this position on both version.
Difference is not dramatic but visible. Old version brute force 9 moves - 51 min
and 9 sec. Speeding up to 32%. I still have few idea to try but for this I must
find the next free time.
>>Paul, do you have, by accident, Web address of Genius 2 ("free Uri's version).
>>Something happened to mine when I wanted to see this position on Genius 2. I use
>>Genius 2 (Genius 4 I have) because I remember that it was without any bugs in
>>mate solving and because Rebel 10 have limit of 100 moves. Meantime, will try to
>>see if address is still here in Chess Club old pages.
>
>I think it's this address: http://www.gambitchess.com/progr.htm
Great! Thanks, Paul! Will rush there.
It is curious for me to see if branching factor is mainly result of program
thinking or the position that it is looking in. Already, few times I could see
that people with visibly different programs come to very much the same result. I
want only to say that when one program found that given position have small
branching factor, the next one will find it on its own way. I could see few
times when Heiner gave his responses. He look very often into position by brute
force and it is the brute force search that is the most revelling. One of last
positions (13 moves that he solved up to the end) happened to have very moderate
branching factor also on mine. Will now look our last position on Genius to see
how much Genius branching factor is moderate. He do brute force mate search.
Only big data collection can respond on my initial question.
Salut,
Leonid.
>Groetjes,
>Paul
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.