Author: leonid
Date: 11:24:15 09/26/99
Go up one level in this thread
On September 26, 1999 at 13:43:49, Antonio Dieguez wrote: >On September 26, 1999 at 08:03:00, leonid wrote: > >>On September 26, 1999 at 01:56:18, Antonio Dieguez wrote: >> >>>On September 24, 1999 at 22:47:41, leonid wrote: >>> >>>>I look to reduce "branching factor" in my engin and, at least, one suggestion >>>>from the Web work. Suggestion to check my bounds by K...DAD. I hope somebody >>>>will come with the next one. It will be helpful if you will indicate some >>>>reading on the Web that touch this topic, or just your experience while looking >>>>for the same. It will be also good if you could say me how many nodes >>>>in each ply, generally speaking, speedy chess game is forced to see. >>>>Incapacity from my side to disconnect the hash tables from the games that I >>>>have seen could give me the wrong impression about the "branching factor" >>>>of other games on the first place. >>>>Distance between the best games and mine, for better undertanding. >>>>Best games, in general, see 16% of nodes from the play. >>>>My game see around 21% nodes from ply. >>> >>>if you want a factor 4 just call >>> >>>setBranchingFactor(4); >>> >>> >>>but be carefull! in some compilers it doesnt work! :) >>> >>> >>>>Thanks for every suggestion, >>> >>>no big deal. >>> >>>>Leonid. >> >>Nice response that left me perplex. Maybe it is nothing but joke. Only if >>your response is serious my engin is not written on C. Also it was not said >>by me (and this is my mistake) that branching factor was tried while search >>was done by "brute force". > >perplex? well I only wanted to obtain a little smile. >Am sorry if you didnt like it, if thats the case. > >>Leonid. Thanks! Sometime smile is the only way to face some grisly moment with our code before sun will come to embellish your life. 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.