Author: leonid
Date: 16:31:31 10/23/01
Go up one level in this thread
>Yes ... 64 bits ... an assembler chess programmer's dream ... but for me it >doesn't matter much ... I'm not going back to assembly any time soon, I like C >too much. :) Never mind kind of language that somebody will use, new opportunity will be there. New rewriting will take place. For those that already, in the 80th, wrote their programs for 64 bits servers it will be nothing new. >I don't think Chessmaster does brute force. And it doesn't need it either, it's >good enough selective! I am pratically sure that Chess Master somewhere do brute force with the selective in the same time. I remember, around 5 or 6 years ago, using it with Genius 2 and Wchess for verification of mate positions. Then Genius and Chess Master never fail on positions (at lest as far as I can remember) and this signify that it used brute force. With selective you miss few mates sooner or later. For searching mate inside of usual chess game, what you say is true. Selective do all the work. Brute force, even with the best of all programs, will be not quick enough for needed response. >I did a hashless search too for this last position, took 15 seconds to solution >instead of 4, so it helps Pretz a lot! Thanks, Paul! This is good to know. I thought otherwise. It could be also that on this position we have many moves to see inside of each ply and this make hash very effective. It could be otherwise if number of moves for each ply is smaller. But, once again, it should be tried on the few positions to be sure. Without direct verification everything is nothing but guess. Cheers, Leonid.
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.