Author: Uri Blass
Date: 22:12:39 09/04/01
Go up one level in this thread
On September 04, 2001 at 20:51:23, Peter Berger wrote: >On September 04, 2001 at 19:16:29, leonid wrote: > >>Solution time is excellent! >> >>Chessmaster 8000 for sure found mate by selective and its selective search is >>very effective. But how about brute force search? I am curious to know how he do >>on this sense. >> >>To spot its brute force search (just my suggestion) find what is the Chessmater >>time for 8 moves for the first position and in 12 moves for the second. In both >>he will not find the mate but probably will end by searching by brute force. >> >>If you could indicate its brute force search for two close moves (for 7 and 8 >>moves deep, for instance) it will be very revealing. This will permit to see his >>branching factor for this kind of search. >> >>Some programs are very efficent in brute force search but not that tuned for >>selective. The best brute force searcher that I saw here until now was Heiner's >>mate solver. His time is close to miracle. >> >>Cheers, >>Leonid. >> > >Hi Leonid, > >to the best of my knowledge Chessmaster 8000 can't be set up to do a "brute >force search" by an ordinary user - don't forget : it isn't a mate solver but a >normal chess playing program. I know that chessmaster6000 can be set up to do a brute force search. I did not try chessmaster6000 in the relevant positions but I guess that it is going to be clearly slower than chest or leonid's program in brute force. Brute force is only another option of chess playing program and they did not work on optimizing it for speed. Uri
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.