Author: Uri Blass
Date: 22:03:58 09/18/01
Go up one level in this thread
On September 18, 2001 at 20:14:15, Slater Wold wrote: >On September 18, 2001 at 13:44:33, Janosch Zwerensky wrote: > >>Hi everyone, >> >>I don't expect that currently any program can solve one of these problems given >>less than weeks of reflection time, but I'd like to know anyway what different >>progs say: >> >>[D] 6kr/8/rp1p1p1p/pPpPpPpP/P1P1P1P1/8/8/4K3 w - - 0 1 >> >>It is very easy to see (for a human) that in this position 1. bxa6 is a bad >>idea. How long does your program take to understand this, too? >> >>Regards, >>Janosch. > > >Again, Crafty has solved this. And in good time: I see from another post that Dann Corbit's Crafty18.11 could not solve it in an hour inspite of the fact that it finished iteration 25. I wonder what is the reason for it. Is it possible that big hash tables helped so much or maybe there is a super linear improvment from parallel search in these positions? I suspect that a difference in hash tables is the reason because hash tables help mainly in relatively simple positions and positions when the pawn are blocked are relatively simple(there are a lot of repetitions in the search). Uri
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.