Author: blass uri
Date: 13:22:15 06/18/00
Go up one level in this thread
On June 18, 2000 at 07:14:20, Gian-Carlo Pascutto wrote: > >Hi all > >At the bottom of this post is a test position. The idea is not to check which >programs find the correct move (should be easy), but when the program first >spots it, with which score, when it fails high, how long it takes for the >fail-high to resolve and what score it gets back. > >The idea is to see how well the programs handle this kind of positions where >the extensions suddenly can get wild, just when the alpha-beta window opens. >Some can handle this very well, other have the search totally blow up... > >I've done a bit of testing already, and the results vary rather widely...so >I'd like to get as much data as possible on this one. If you are a programmer >yourself, _please_ indicate what extensions your program uses, or other >relevant info about your search. I'd like to get an idea of the do's/dont's >when extending. > >Also, if anyone has other positions like this (preferrably even harder/worse), >please share them. > >[D] rr4k1/pp2pp1p/q2p2p1/2pP3n/2P5/2BQP2R/PP3P2/2K4R w - - 0 19 > >PS. Is this a forced mate? If so, how many moves exactly? chessmasater6000(ss=10) can see a forced mate in 9 after 4 seconds and in 8 moves after 13 seconds. There are positions when the search of chessmaster6000 is stupid but not this position. I could see a very big branching factor(more than 60) in one endgame position that chessmaster did not solve(I gave up and did not wait to find the right branching factor) I do not remember the position but Enrique posted the endgame position in one of the last weeks. 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.