Author: Uri Blass
Date: 15:11:51 09/09/01
Go up one level in this thread
On September 09, 2001 at 17:28:38, Gian-Carlo Pascutto wrote: >On September 09, 2001 at 17:17:50, Uri Blass wrote: > >>Singular extensions can save a lot of plies only in positions when there are a >>lot of singular lines when there is a big difference between the best move and >>the next best move. >> >>In the releavant position it simply does not happen and if you search through >>the logical lines you find that most of the moves of both sides >>are not singular. > >Then explain why my SE crafty has a 3 ply advantage here. I said most of the moves and not all the moves so 3 plies difference make sense but not 20 plies difference. > >Two things: > >a) computers do not search logical lines The illogical lines are simply nodes that we can ignore and get the same conclusion. >b) there is no need for a big difference. my implementation will > already extend on 0.25 pawns, or 0.50 pawns depending on the > situation. In most of the cases the difference is even smaller than 0.25 and if you extend for a difference of 0.25 then a move that is 0.25 worse is not going to get extended from the root and you are not going to see that it is losing 2 pawns. it is unsure what Hsu used exactly, but the margins > should have been similar in size > >>I suggest that somebody will ask Hsu about it. >>I do not know the email of hsu and I may be cnsidered as an enemy of hsu after >>my posts(inspite of the fact that I do not hate hsu) so I am afraid that he is >>not going to answer me but maybe he can answer you or Hyatt if you ask him about >>the position of that game. > >I very much doubt he would consider you an 'enemy'. At least you try to make >arguments against DB. Most people here just spew crap. > >Problem is if Hsu reponds to email from strangers, and if the still >remembers that game. Robert Hyatt is not a stranger so maybe he can ask Hsu. Uri
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.