Author: leonid
Date: 14:32:48 08/09/00
Go up one level in this thread
On August 09, 2000 at 17:04:37, Tom Kerrigan wrote: >On August 09, 2000 at 15:59:24, leonid wrote: > >>>I don't recall Ed ever calling his search brute force. >>> >>>-Tom >> >>If it is so, now I see why my branching factor is so miserable. >> >>I asked above question when I tried to solve this position by brute force. For >>black side I looked up to 10 plys deep and it took already 12 min 17 sec. Move >>was wrong. Black knight goes to the position e2. And for finding right move I >>must go to the next 12 plys search. But this could take some next 6 hours. This >>is how my old question about branching factor came to me. It prohibit to my >>program to see very rapidly and reach far distance. > >You're the only person in the entire world who does these "brute force" >searches. > >-Tom When you want to know if your basic speed is the right one, only brute force search could say you so. This I remember from writing my program for finding the mate. When I wrote my first program for mate search, it was not the brute based. Then I had erroneous impression that mine is the best ever written. Later, when I started to compare my brute force search, I found that I was wrong. The same brute force comparison helped me later to speed up all versions for my final mate solver. If you regard the practical part of frute force search, you are right. Part of my program that is done now, mate solver, it is not brute force search that do the main work. Brute force search find the mate only in around 15% of positions. 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.