Author: Robin Smith
Date: 18:49:48 01/20/05
Go up one level in this thread
On January 17, 2005 at 22:10:21, Les Fernandez wrote: >A few weeks ago I posted these 2 positions and asked if some of you could >analyze them and report your findings. As a follow up Dann decided to run these >2 positions using 37 different engines to see if it took longer to solve >Position #1 vs Position #2. Please review the data and let me hear your >thoughts as to what could be causing this to happen. I had to split the charts >up since I could not fit them both across the width. The 2 positions lloked at >are: (Dann if you see this correct me if these 2 positions are wrong) <snip> All the programs are searching more nodes for position #1 than for position #2, so of course this takes more time. Since the mate depths seem to be comparable between the two positions, it must be that the lines are more forcing in position 2, so the branching factor is smaller, so the search tree is smaller, so the search time is smaller. -Robin
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.