Author: Stuart Cracraft
Date: 16:14:37 09/06/04
Go up one level in this thread
On September 06, 2004 at 18:12:40, Uri Blass wrote: >On September 06, 2004 at 17:50:11, Stuart Cracraft wrote: > >>On September 06, 2004 at 16:37:00, Uri Blass wrote: >> >>>On September 06, 2004 at 15:07:00, Stuart Cracraft wrote: >>> >>>>[D] 5n2/B3K3/2p2Np1/4k3/7P/3bN1P1/2Prn1P1/1q6 w - - 0 0 >>>> >>>>Anyone can get this besides Ed? >>>> >>>>Please post your search times. >>> >>>Yes >>> >>>Latest movei does it in 0.17 seconds at depth 6 on A3000 and movei that >>>participates in WBEC does a similiar result. >>> >>> >>>6 9941 17 133417 e3g4 e5f5 g4h6 f5e5 h6f7 e5f5 f7d6 f5e5 f6g4 e5d5 g4e3 d5e5 >>>d6f7 e5e4 f7g5 e4e5 g5f3 e5e4 f3d2 e4e5 d2f3 e5e4 f3g5 e4e5 g5f7 e5e4 f7d6 e4e5 >>>e3g4 e5d5 g4f6 d5e5 d6f7 e5f5 f7h6 f5e5 h6g4 e5f5 g4e3 f5e5 f6g4 e5e4 g4f2 e4e5 >>>f2d3 e5e4 d3f2 e4e5 f2g4 e5e4 g4f6 e4e5 e3c4 e5f5 c4d6 f5e5 f6g4 e5d5 c2c4 >>>6 9941 17 135968 e3g4 e5f5 g4h6 f5e5 h6f7 e5f5 f7d6 f5e5 f6g4 e5d5 g4e3 d5e5 >>>d6f7 e5e4 f7g5 e4e5 g5f3 e5e4 f3d2 e4e5 d2f3 e5e4 f3g5 e4e5 g5f7 e5e4 f7d6 e4e5 >>>e3g4 e5d5 g4f6 d5e5 d6f7 e5f5 f7h6 f5e5 h6g4 e5f5 g4e3 f5e5 f6g4 e5e4 g4f2 e4e5 >>>f2d3 e5e4 d3f2 e4e5 f2g4 e5e4 g4f6 e4e5 e3c4 e5f5 c4d6 f5e5 f6g4 e5d5 c2c4 >>> >>>Uri >> >>Had you tuned previously with this position (seen it before)? > >Yes but when I did the change that let movei to solve it I did not think >specifically about this position(in the past I did not find a solution that will >be good both for this position and other positions so I did not keep it but I >think that later I found good ideas for change that is good both for this >position and other positions). > >Now I am afraid that movei may crash in some positions >After all if it can search 59 plies with searching to depth of 6 plies it may >also search more than 100 plies with searching to depth of 11 plies in some >position. > >The chance that it can crash is very small and I know that it played hundreds of >games without crashing including many games in Leo's tournament but >I will probably check in the beginning of the search that ply is not too big in >order to prevent problems even if they are very rare. > >Note that in this case it extends almost 2 plies for a single reply to check but >in most cases it does not extend so much and the extension of almost 2 plies >that I have usually does not cause the tree to explode relative to no extension. > >Uri Why does it extend almost 2 plies for a single reply to check? Please talk about your >1 extension in this case.
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.