Author: Vincent Lejeune
Date: 12:43:30 08/25/05
Go up one level in this thread
On August 25, 2005 at 11:33:19, Robert Hyatt wrote: > > >On August 25, 2005 at 06:14:11, Bernhard Bauer wrote: ... >>I am not sure either. >>If I would make only one blunder in 20% of my games, I would not think it's >>often. However, if I would blunder 20% of the moves in one game, that would be >>quite often. >>Look at the following 3 positions: >>8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w Fruit2.1 needs 2:20 min to find Kb1 >>7k/2p5/2p5/2P4p/3P1p1p/5P1P/8/K7 w Fruit2.1 gives Kb2 whithin 5 min >>2k5/2p2p2/2p1p3/2P1PpP1/1p1P1p2/1P3P2/1K3P2/8 w >>Fruit2.1 needs 55 sec to find Kb1. My crafty version only 15 sec. >> >>Let me recall something Bruce Moreland wrote: "Search should find it" >>Agressive pruning makes your engine faster and usually stronger, but not more >>reliable. >>Kind regards >>Bernhard > > >If you are interested in test sets, I can run most anything. I am currently >running the Nolot positions for 60 minutes each. On the opteron box, a 1-cpu >run gets five correct. Will see if the 2-4-8 cpu runs find more... Cool , we will be able to compare with results of DB2 (about right and wrong solutions) http://chessprogramming.org/cccsearch/ccc.php?art_id=150640
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.